Reputation
Next tag badge:
429/400 score
74/80 answers
Badges
2 41 115
Impact
~432k people reached

Aug
25
revised How feasible would it be to generate 300 million public key pairs in 8 hours?
Clarify the justification of benchmarks single-threadedness.
Aug
25
comment Why is RSA encryption significantly faster than decryption?
Given that $e=2^{16}+1$ is parse, and the mostly random nearly 1024-bit $d$ is not, with common exponent scanning techniques, the ratio of modular multiplication is more like ${3\over2}1020/(16+1)\approx90$ (rather than $60$); further, at the 1024-bit level CRT does not quite save a factor of $4$, so in my experience RSA-1024 decryption/signature is more like $25$ (rather than $15$) times slower than RSA encryption/signature verification with $e=2^{16}+1$ (unless multiple cores, Montgomery pre-computations, sliding windows exponentiation, multi-primes, or side-channel hardening is considered).
Aug
25
revised How feasible would it be to generate 300 million public key pairs in 8 hours?
Motivate reference to Poncho's answer
Aug
25
revised How feasible would it be to generate 300 million public key pairs in 8 hours?
Link to Poncho's answer.
Aug
25
revised How feasible would it be to generate 300 million public key pairs in 8 hours?
DSA is feasible.
Aug
25
revised How feasible would it be to generate 300 million public key pairs in 8 hours?
Benchmarks assumed singe-core
Aug
24
revised Does it make sense to have a compression function that uses 64-bit of the message to create an output of 64-bit?
polish
Aug
24
revised Why the $IV$ used in Merkle-Damgard has to be fixed to a specific value?
Better exaplain notation
Aug
24
comment How feasible would it be to generate 300 million public key pairs in 8 hours?
The "reasonable strength" requirement in the question had dissuaded me of even thinking of sharing primes. Your "generating the RSA keys to search for some criteria" is a nice justification for this unusual way of doing things. Do you have some (semi-)real use case for this, perhaps some attack ?
Aug
24
revised Digital signature algorithms within the European Union
Mention a current standard
Aug
24
revised Why the $IV$ used in Merkle-Damgard has to be fixed to a specific value?
Mention nothing-up-my-sleeves number as IV
Aug
24
revised Why does the padding in Merkle–Damgård hash functions like MD5 contain the message length?
better notation for the addition variant
Aug
24
answered Why the $IV$ used in Merkle-Damgard has to be fixed to a specific value?
Aug
23
revised Digital signature algorithms within the European Union
added 19 characters in body
Aug
23
answered Digital signature algorithms within the European Union
Aug
23
comment Modular reduction for NIST prime P256— understanding the data
Given your general state of confusion, you might benefit from A (relatively easy to understand) primer on elliptic curve cryptography, skipping directly to Elliptic curves: Building blocks of a better trapdoor (I dislike the intro on toy RSA).
Aug
23
revised How feasible would it be to generate 300 million public key pairs in 8 hours?
Expand to detail DSA and cover RSA.
Aug
23
answered How feasible would it be to generate 300 million public key pairs in 8 hours?
Aug
23
comment Does it make sense to have a compression function that uses 64-bit of the message to create an output of 64-bit?
@B-Con: I understand what you describe in your comment and the following one; but not how that would allows to find a collision or preimage more efficiently than a generic birthday attack.
Aug
23
comment Does it make sense to have a compression function that uses 64-bit of the message to create an output of 64-bit?
@Thomas: I nailed that cryptanalytic attack!