User CurveEnthusiast

33 votes

Accepted

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

answered Jan 16, 2017 at 16:50

17 votes

Accepted

Security of Schnorr signature versus DSA and DLP

answered Jun 24, 2017 at 16:59

16 votes

Accepted

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

answered Nov 11, 2016 at 10:36

14 votes

Accepted

Visualization of Elliptic Point Addition

answered Nov 21, 2016 at 10:39

12 votes

Accepted

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

answered Dec 20, 2016 at 14:07

10 votes

Accepted

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

answered Jan 24, 2017 at 12:10

9 votes

Accepted

Compact Schnorr signature?

answered Mar 19, 2018 at 17:18

8 votes

Accepted

Point-at-infinity and error handling

answered Feb 14, 2017 at 20:31

8 votes

why are non singular curves used in elliptic curve cryptography?

answered Jan 24, 2017 at 9:21

7 votes

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

answered Jan 7, 2017 at 16:36

7 votes

Accepted

Elliptic curve with non-prime generator?

answered Nov 29, 2016 at 14:23

7 votes

Accepted

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

answered Nov 30, 2016 at 10:06

7 votes

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

answered Jan 31, 2017 at 20:47

7 votes

Accepted

BN-Curves for 256-bit symmetric security

answered Mar 16, 2017 at 12:12

6 votes

Breaking Insecure Elliptic Curve Cryptography

answered Apr 13, 2017 at 20:44

6 votes

Accepted

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

answered Nov 6, 2016 at 18:30

6 votes

Accepted

IZK versus NIZK

answered Dec 7, 2016 at 8:14

5 votes

Accepted

Tricking the Schnorr's protocol

answered Nov 21, 2016 at 10:25

5 votes

32-bit or 16-bits elliptic curves

answered Mar 27, 2017 at 15:24

5 votes

Accepted

Proving knowledge of a value and computation that uses it

answered Oct 3, 2017 at 15:46

5 votes

Accepted

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

answered Apr 26, 2017 at 6:52

4 votes

The notion of sub-exponential security

answered Apr 15, 2017 at 9:28

4 votes

Elliptic Curve Point at Inifnity in Projective Coordinates

answered Apr 24, 2017 at 10:17

4 votes

Accepted

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

answered Nov 26, 2016 at 11:35

4 votes

Is the additive discrete Logarithm problem always easy in Fields?

answered Nov 11, 2016 at 22:08

4 votes

Accepted

Derive a shared secret between different curves

answered Dec 7, 2016 at 12:13

4 votes

Accepted

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

answered Dec 5, 2016 at 20:19

4 votes

Accepted

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

answered Jan 14, 2017 at 16:10

4 votes

Accepted

Curves intended for both signing and key agreement

answered Jan 16, 2017 at 8:09

3 votes

Supersingular vs non-singular (Same or different)

answered Jan 31, 2017 at 12:07

Stack Exchange Network

54 Answers

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

Security of Schnorr signature versus DSA and DLP

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

Visualization of Elliptic Point Addition

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

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

Compact Schnorr signature?

Point-at-infinity and error handling

why are non singular curves used in elliptic curve cryptography?

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

Elliptic curve with non-prime generator?

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

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

BN-Curves for 256-bit symmetric security

Breaking Insecure Elliptic Curve Cryptography

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

IZK versus NIZK

Tricking the Schnorr's protocol

32-bit or 16-bits elliptic curves

Proving knowledge of a value and computation that uses it

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

The notion of sub-exponential security

Elliptic Curve Point at Inifnity in Projective Coordinates

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

Is the additive discrete Logarithm problem always easy in Fields?

Derive a shared secret between different curves

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

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

Curves intended for both signing and key agreement

Supersingular vs non-singular (Same or different)