Reputation
13,651
Next tag badge:
99/100 score
17/20 answers
Badges
1 34 70
Impact
~260k people reached

Jun
22
reviewed No Action Needed How is wpa2 authentication structured
Jun
22
reviewed No Action Needed Attack for RSA 1024 bit with Low Public Exponent
Jun
22
comment RSA: How effective is this keypair-trash attack
In the duplicate I already wrote that there are $2^{500}$ primes relevant for 1024 bit RSA which has a security of about 80 bits against GNFS. What more do you want? An illustration of how unimaginably huge $2^{500}$ is?
Jun
22
comment How to determine the exponent when using RSA
Similar question RSA Key generation: How is multiplicative inverse computed?
Jun
22
comment How to determine the exponent when using RSA
1) You need multiply with the modular multiplicative inverse instead of dividing. 2) $\mathrm{GCD}(e, \phi) \neq 1$, so your choice of $e$ is incompatible with your choice of $q$.
Jun
22
comment What is more efficient, pairing based cryptography or non pairing based cryptography?
@Nubila You didn't even link the paper you're talking about. You didn't give enough context. Your question isn't answerable like that.
Jun
22
comment What is more efficient, pairing based cryptography or non pairing based cryptography?
@Nubila I just posted two schemes that require pairings, what more do you want?
Jun
22
revised What is more efficient, pairing based cryptography or non pairing based cryptography?
edited tags
Jun
22
comment RSA: How effective is this keypair-trash attack
How many universes are you willing to turn into databases in order to hold this data? 1024 bit RSA keys are already borderline breakable, yet a database big enough to contain even a tiny fraction of all relevant prime factors (not even the keys themselves, which are far more numerous) would exceed a single universe.
Jun
22
reviewed Leave Open What is more efficient, pairing based cryptography or non pairing based cryptography?
Jun
22
revised What is more efficient, pairing based cryptography or non pairing based cryptography?
added 16 characters in body; edited tags; edited title
Jun
22
answered What is more efficient, pairing based cryptography or non pairing based cryptography?
Jun
22
reviewed Close An example of Knapsack Cryptosystem cracks/attacks?
Jun
22
reviewed Close How can I start the following crypto project?
Jun
21
reviewed Approve Encrypting a key with the same key using AES
Jun
21
reviewed No Action Needed Understanding Meet-in-the-Middle attack on block ciphers
Jun
21
reviewed Reviewed SSH rekey security implications
Jun
21
revised SSH rekey security implications
deleted 11 characters in body
Jun
21
comment Determine safety of exercise hash functions
Since there are no restrictions on what $h_{666}$ is, and the question says "may be less safe", you're allowed to assume the worst about $h_{666}$. For A) you could assume that it returns a constant value. For C) what if $h_{666}=h_{md5}(m) \oplus h_{sha1}(m) \oplus h_B(m)$ plus some constant padding?
Jun
21
comment Determine safety of exercise hash functions
@fgrieu I think the zero-padding referred to the individual hashes, expanding them all to 666 bits so you can xor them, not the the messages.