Description:
Cryptography, cryptanalysis, and related issues. (Moderated)
|
|
|
Solving B from h(A || P) with h = MD5
|
| |
On the code-base I am working with I came across a method to create one-off authentication URIs with format OneOff(A) = A || h(A || P) where A is the requested URI with username and other information and P that user's password. I am now wondering that is there a way to crack this sort of scheme faster than using brute-force? What I've gathered from different... more »
|
|
|
security model for broadcast encryption
|
| |
Hi, everyone. I've interested in the broadcast encryption schemes. And now, I'm thinking about the sender authentication in the broadcast encryption. That subject is about how to we authenticate the broadcaster in the environment with several broadcast senders, For example, a malicious attacker first legitimately join the group... more »
|
|
|
Draft paper submission deadline extended: ISP-09
|
| |
Draft paper submission deadline extended: ISP-09 The deadline for draft paper submission at the 2009 International Conference on Information Security and Privacy (ISP-09) (website: [link] ) is extended due to numerous requests from the authors. The conference will be held during July 13-16 2009... more »
|
|
|
PKC'09 Call for Participation
|
| |
PKC'09: CALL FOR PARTICIPATION ------------------------------ 12th IACR International Conference on Practice and Theory in Public Key Cryptography (PKC) 2009 March 18-20, 2009, Irvine, CA, USA [link] GENERAL INFORMATION: -------------------- We invite your participation at PKC 2009, the 12th installment of the... more »
|
|
|
How long can we wait before we absolutely must take steps to
|
| |
...This is basically what I was saying. If you have a one time pad you are absolutely secure. Mind you have to deliver your one time pad and this may well be a dificulty. It was a difficulty forthe Germans in WW2. The wheels for Enigma had to be set up using plain German. This was how the code was cracked, it would not have been cracked... more »
|
|
|
Is this problem relevant to the Diffie-Hellman problem?
|
| |
I have a problem in my study of cryptography: We know that if a polynomial f(x) has a degree of k, given a set of k +1 data points (x_0,f(x_0)),...,(x_k,f(x_k)), we can know the evaluation of f(x) at any value x, by the polynomial interpolation. The method of polynomial interpolation is: Given the Lagrange... more »
|
|
|
Cartcam block cipher - C implementation
|
| |
After first look, in ~3 minutes, I see following weaknesses: 1. Weak keys: If all key values are x*32, then in the all iterations, rotation shift values (mod1, mod2) always will be 0. Hence, rotation block will be not work for these weak keys. 2. Obvious: If key is "all 0-s", and plaintext also "all 0-s", cyphertext also will... more »
|
|
|
