Skip to main content
CurveEnthusiast's user avatar
CurveEnthusiast's user avatar
CurveEnthusiast's user avatar
CurveEnthusiast
  • Member for 7 years, 8 months
  • Last seen more than 3 years ago
3 votes

Elliptic Curve Cryptography, decrypting returns false result

9 votes
Accepted

Compact Schnorr signature?

5 votes
Accepted

Proving knowledge of a value and computation that uses it

0 votes

Elliptic Curve Isogenies, Frobenius endomorphism relation to characteristic equation

0 votes

Inversion Free Elliptic Curve Operations

17 votes
Accepted

Security of Schnorr signature versus DSA and DLP

5 votes
Accepted

If p mod 4 = 3, does choosing a=1 in the parameters of EdDSA really achieve best performance?

4 votes

Elliptic Curve Point at Inifnity in Projective Coordinates

4 votes

The notion of sub-exponential security

6 votes

Breaking Insecure Elliptic Curve Cryptography

3 votes
Accepted

Gaussian distribution over ideal lattices

2 votes
Accepted

Are there any applications of Lie algebras or Lie groups in cryptography?

6 votes

32-bit or 16-bits elliptic curves

7 votes
Accepted

BN-Curves for 256-bit symmetric security

2 votes

Order of an elliptic curve defined over a prime field

8 votes
Accepted

Point-at-infinity and error handling

1 vote

EC: How to prevent discovery of base point after commutative operation

7 votes

Elliptic curves in Edwards form (or Edwards curve) and addition formulas

3 votes

Supersingular vs non-singular (Same or different)

2 votes

Security of the server's private key

10 votes
Accepted

Why are elliptic curves constructed using prime fields and not composite fields?

8 votes

why are non singular curves used in elliptic curve cryptography?

1 vote

Elliptic curves with field sizes that not byte-aligned

35 votes
Accepted

What does "birational equivalence" mean in a cryptographic context?

4 votes
Accepted

Curves intended for both signing and key agreement

4 votes
Accepted

Can you help me understand this exam answer related to “breaking discrete logarithm over P256”?

7 votes

Advantage of $\operatorname{GF}(2^8)$ over $\mathbb Z/2^8\mathbb Z$ in AES/Rijndael

3 votes
Accepted

Role of primitive roots in Pollard's P-1 factorization algorithm

3 votes

Schnorr protocol: how does malicious verifier win?

12 votes
Accepted

What is the difference between regular and "twisted" ECC curves?