user avatar
user avatar
user avatar
CurveEnthusiast
  • Member for 5 years, 8 months
  • Last seen more than 1 year ago
32 votes
Accepted

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

17 votes
Accepted

Security of Schnorr signature versus DSA and DLP

15 votes
Accepted

Why must an elliptic curve group for ECC have prime order?

14 votes
Accepted

Visualization of Elliptic Point Addition

11 votes
Accepted

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

9 votes
Accepted

Compact Schnorr signature?

8 votes
Accepted

Point-at-infinity and error handling

8 votes

why are non singular curves used in elliptic curve cryptography?

8 votes
Accepted

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

7 votes

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

7 votes

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

7 votes
Accepted

Elliptic curve with non-prime generator?

7 votes
Accepted

Forgery attack for Merkle–Damgård MAC scheme with prefix method

7 votes
Accepted

BN-Curves for 256-bit symmetric security

6 votes

Breaking Insecure Elliptic Curve Cryptography

6 votes
Accepted

IZK versus NIZK

5 votes
Accepted

Tricking the Schnorr's protocol

5 votes
Accepted

Cryptography - Perfect secrecy $\implies$ adversarial indistinguishability - proof

5 votes

32-bit or 16-bits elliptic curves

5 votes
Accepted

Proving knowledge of a value and computation that uses it

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

Is the additive discrete Logarithm problem always easy in Fields?

4 votes
Accepted

Incorrect solution for Discrete Log Problem when using the Index Calculus algorithm

4 votes
Accepted

Derive a shared secret between different curves

4 votes
Accepted

Elliptic Curve Cryptography calculation of $y^2 \equiv x^3 + x + 1 \pmod{23}$

4 votes
Accepted

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

4 votes
Accepted

Curves intended for both signing and key agreement

3 votes

How calculation over $GF(2^2)$ is executed?

3 votes

Schnorr protocol: how does malicious verifier win?