Reputation
26,584
Next tag badge:
419/400 score
79/80 answers
Badges
2 37 112
Newest
 Benefactor
Impact
~411k people reached

Jul
23
revised Collision or second preimage for the ChaCha core?
hopefully clarify the reference code
Jul
17
comment How many bits to flip in an RSA public key to do signature forgery?
@dannycrane: Yes, in $2/{\log_e n}$ the letter $e$ is the base of natural logarithm, not the public exponent. $\;$ No, in $(1 - 2/{\log_e n}) ^ {\log_2 n - 1} \approx 0.044$, exponentiation is meant; think of $\log_2 n - 1$ as a number of trials, each flipping a bit with odds $1-2/{\log_e n}$ of not reaching a prime.
Jul
17
comment How many bits to flip in an RSA public key to do signature forgery?
Nice. Flipping a single bit of $e$ to make it $1$, if $e$ is suitable (most $e$ used in practice are), and that's accepted by Alice (which would not be unseen), is another way, involving less work.
Jul
17
comment How many bits to flip in an RSA public key to do signature forgery?
Do you mean: Eve is restricted to invent (e', n') that differ from (e, n) in a small number of bits ? If yes, what is the convention used to map (e, n) to a bitstring ? In particular, would it prevent changing the customary e=65537 to e=1 by flipping the high-order bit, or would that be otherwise rejected by Alice ?
Jul
15
revised Why should the primes used in RSA be distinct?
Mention FIPS 186's prescription
Jul
11
revised Why should the primes used in RSA be distinct?
Remove link to vanished answer
Jul
11
comment Why should the primes used in RSA be distinct?
@rt_mn: in RSA with distinct primes $p$ and $q$, $d\equiv e^{-1}\pmod{(p-1)\cdot(q-1)}$ is a sufficient, but not necessary condition for $d$ being a valid private exponent.
Jul
11
revised Why should the primes used in RSA be distinct?
Add Ricky Demer's reason
Jul
11
answered Why should the primes used in RSA be distinct?
Jul
10
comment How far is public-key crypto involved in “banking world”?
As to your first bullet: yes, see EMV 4.3
Jul
8
comment RSA algorithm assignment
Hints: a) consider what happens when $e$ is small; say 3, 5, or 17, which are reasonable choices when proper padding is used. $\;$ b) regardless of $e$, consider odds that $K$ can be written as the product of two integers neither exceeding, say, $2^{40}$.
Jul
8
revised RSA algorithm assignment
improve appearance
Jul
7
comment RSA with $\lambda(n)$ or $\varphi(n)$
@tylo: very right. My mistake. I wish I could edit (rather than delete) wrong comments.
Jun
29
revised How to select parameters based on some condition
polish, fix ob1
Jun
29
revised How to select parameters based on some condition
polish
Jun
29
answered How to select parameters based on some condition
Jun
26
revised bcrypt - collision-resistance against chosen salt and work factor?
Clarify what input is
Jun
25
revised Why is HMAC-SHA1 still considered secure?
Detail what it would take to break SHA-1
Jun
25
revised Why is HMAC-SHA1 still considered secure?
polish
Jun
25
comment what are the most common stream ciphers algorithms?
I think you mean Salsa20 (a family of 3 stream ciphers Salsa20/8, Salsa20/12, Salsa20/20) rather than ChaCha20 (the 20-round version of ChaCha), since ChaCha was published in 2008.