Reputation
36,475
Next tag badge:
399/400 score
85/80 answers
Badges
1 32 77
Newest
 Enlightened
Impact
~525k people reached

Dec
31
reviewed No Action Needed Discrete logarithm modulo a smooth number
Dec
30
comment Associative but NOT Commutative Reducing Function Construction with Existing Hash Function(s)
Actually, associativity implies more commuting pairs than that; if we designate $a^k = H(\{a,a,a,...,a\})$, then $a^i$, $a^j$ are a commuting pair (for any $a, i, j$)
Dec
30
answered Is the DES F-function injective for a given subkey?
Dec
30
comment How are random numbers for RSA generated?
Actually, Algorithm A.1.2.1.2 tests primes in the order $2(t_0+j)qp_0+1$ (where $t_0$ is the original value of $t$) for $j = 0,1,2,...$ (except for wraparound, which almost never happens). You can sieve values in that arithmetic order quite well.
Dec
30
comment How are random numbers for RSA generated?
I compared a MR-based approach using a sieve (eliminating numbers with factors up to circa 500,000) to avoid numbers with small factors to a Shawe-Taylor algorithm modified to use a sieve; I believe a large sieve is actually faster than Fouque/Tibouchi (because it allows you to avoid more modular exponentiations). If you tried Shawe-Taylor without anything to avoid testing numbers with small factors, well, yeah, that's going to be slow.
Dec
30
reviewed Close OTP from Sony BIOS password recover
Dec
30
reviewed Close Do Brute-Force Attacks and Cryptanalysis refute Kerckhoffs's principle?
Dec
30
reviewed Close How are random numbers for RSA generated?
Dec
30
comment How are random numbers for RSA generated?
Actually, in my experience, random constructive proven primes (using Shawe-Taylor) can be done about as fast as random primes validated using a handful of M-R tests.
Dec
23
comment Calculate number of chips to solve bit commitment using hash function
What 89 bit string would you be brute-forcing? You know R1...
Dec
23
comment Calculate number of chips to solve bit commitment using hash function
How far have you gotten so far?
Dec
23
answered Associative but NOT Commutative Reducing Function Construction with Existing Hash Function(s)
Dec
22
answered For which RSA moduli, precisely, is $e=d$ for all $e$?
Dec
22
reviewed No Action Needed Viability of an “Unconventional” Hashing Scheme?
Dec
22
reviewed No Action Needed Specific example of a MAC in TLS?
Dec
22
reviewed No Action Needed Why shouldn't I use ECB encryption?
Dec
22
revised Find private exponent in RSA
edited body
Dec
18
reviewed No Action Needed why $e(g,g)^N=1$ in bilinear pairings holds?
Dec
18
revised Why are primes important for encryption
edited tags
Dec
17
reviewed Approve one time pad regarding