10,054 reputation
12451
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 4 months
seen 7 hours ago

Oct
30
comment Low exponent attack against RSA
You shouldn't rely on secret RSA moduli: Hans-Joachim Knobloch - Breaking Public Keys - How to Determine an Unknown RSA Public Modulus.
Oct
30
comment Are there cryptographic hash functions that can be computed using only paper and pen without leaking any information about the plaintext?
Is there a textual description of this hash function? I don't want to watch an hour long video for something that almost certainly doesn't meet the requirements of the OP. Learning to keep 60+ bits in mind at the same time is probably possible, but certainly takes quite a bit of effort.
Oct
29
comment Elliptic Curves Readdition
In some ECC forms readdition can reuse some intermediate values of the previous addition speeding up the operation a bit.
Oct
28
comment Why does NTRUEncrypt lack a formal security proof?
You can't prove IND-CPA unconditionally. The best you can hope for is a reduction to a common problem like learning-with-errors. You also need to be really careful about the tightness of security reductions. Many proofs are asymptotic or prove an impractically low security level, so even if there is a reduction, it doesn't mean that the scheme is any good.
Oct
24
comment What can be learned from the ciphertext of LibSodium's crypto_box_detached()?
Three times "no".
Oct
24
comment Format Preserving Encryption for 32 or 64 bit plaintext values
You might be interested in the AEZ Caesar candidate.
Oct
22
comment What is the use of Mersenne Primes in cryptography
Some ECC implementation use extension fields with characteristic $2^{127}-1$. One example is snowshoe.
Oct
22
comment What is the use of Mersenne Primes in cryptography
While we use mersenne primes in crypto, we only use medium sized numbers. So the search for larger (mersenne) primes doesn't have crypto applications.
Oct
22
comment Encrypt a file for random access but only after an initial read of the whole file
@Travis you forgot to salt the password hash.
Oct
22
comment Encrypt a file for random access but only after an initial read of the whole file
@otus It's key dependent processing of the whole file. Since the intention of the OP is to only allow checking if the password is valid after processing the whole file, this should suffice.
Oct
22
comment Is it just as difficult to find a desired output in a hash digest, for MSB vs LSB?
The first byte after the 1 is extremely biased. Character Characters 2 to P occur with about 4.3% probability, characters R to z with 0.07% probability. 1 and Q are somewhere in the middle. I believe this results from the rare characters being impossible if the address has the usual length, only occurring in the rare case where the number is small enough to have a shorter encoding. The bias quickly disappears as you get to less significant digits.
Oct
22
comment Encrypt a file for random access but only after an initial read of the whole file
I wouldn't bother. Just focus on using a good password based KDF (such as scrypt). That way an attacker can verify the file with only a few bytes but they still incur the cost of the KDF for each password.
Oct
22
comment Encrypt a file for random access but only after an initial read of the whole file
@StephenTouset As far as I can tell it does. You first need to commit to a password and then process the whole file to learn the actual key and thus any information about the file.
Oct
21
comment Small Prime Difference in RSA
Where is the advantage of this over straight up trial division starting at $\sqrt{n}$?
Oct
21
comment Why do the elliptic curves recommended by NIST use 521 bits rather than 512?
Primes of this form $2^n-1$ are known as Mersenne primes.
Oct
21
revised becoming a cryptographer after math studies
added 1 character in body
Oct
21
revised The security of an encrypt-and-MAC
edited tags
Oct
21
revised Detect desynchronization in HOTP authentication
edited tags
Oct
21
comment Small Prime Difference in RSA
1) Compute the square root of the product. 2) Go to the next odd number. 3) Test if division works. 4) If not, add 2 and repeat from step 3.
Oct
20
comment Protection of Elliptic Curve Implementations against side-channel attacks
Some people care about software implementations and talk about the relevant performance and side channels, other people care about hardware implementations and talk about the relevant performance and side channels. The linked talk falls in the software category.