Reputation
4,287
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
16 29
Newest
 Enlightened
Impact
~59k people reached

  • 0 posts edited
  • 2 helpful flags
  • 581 votes cast
Nov
6
answered Is there any reason not to use Single-Key EM with AES and a constant key?
Oct
24
answered How bad is it to use the identity function as hash for ECDSA?
Oct
18
comment What level of security is provided when a Feistel Cipher is used as a round function of another Feistel Cipher?
Turtle's high-level structure is also known as the "Russian Dolls" construction, which was analyzed by Patarin and Seurin. It is secure, but requires a lot of key material (cf. §4).
Oct
14
awarded  Good Answer
Oct
13
comment Using a product of a series of curve25519 scalars as a private key
Yes; it is perfectly fine to multiply scalars together, but you will have to ensure implementation correctness yourself.
Oct
13
comment Using a product of a series of curve25519 scalars as a private key
Your other question regarding the higher bits is answered here.
Sep
8
revised Using same modulus for RSA
deleted 4 characters in body
Sep
8
answered Using same modulus for RSA
Sep
1
revised Edwards / Montgomery ECC with Weierstrass Implementation?
added 27 characters in body
Sep
1
revised Edwards / Montgomery ECC with Weierstrass Implementation?
added 20 characters in body
Sep
1
answered Edwards / Montgomery ECC with Weierstrass Implementation?
Aug
19
awarded  Yearling
Aug
18
comment Why not to use curve over field of $p^m$ with $p > 2$ for ECDSA?
$\mathbb{F}_{p^m}$ can work, but it is a more brittle choice since a larger number of attacks have to be considered. It is not idiotic, but the (speed) advantages had better be worth it. As of right now, the only fields where there are considerable advantages are of the form $\mathbb{F}_{p^2}$ for large $p$.
Aug
18
comment Why not to use curve over field of $p^m$ with $p > 2$ for ECDSA?
Which ECDSA paper is that? The NIST one? If so, it is likely that it restricts to $\mathbb{F}_p$ and $\mathbb{F}_{{2}^{m}}$ because those are the only standardized curves.
Jul
22
revised Logjam-style attack on Factoring?
added 33 characters in body
Jul
22
answered Logjam-style attack on Factoring?
Jul
17
awarded  Enlightened
Jul
17
awarded  Nice Answer
Jun
13
answered Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
Jun
11
comment RSA public key recovery from signatures
Vanilla Python will likely be too slow here. Instead, try Sage or, if you do not want a gigantic package, use gmpy to use GMP for the arithmetic. It will be much faster than Python's native quadratic algorithms.