Questions tagged [elliptic-curves]

Elliptic curves are algebraic-geometric structures with applications in cryptography. Such a curve consists of the set of solutions to a cubic equation over a finite field equipped with a group operation. Questions relating to elliptic curves and derived algorithms should use this tag and might also consider more specific tags such as discrete-logarithm and ecdsa.

Filter by
Sorted by
Tagged with
11 votes
2 answers
4k views

Different ways/algorithms for implementing AES

I have seen a couple software implementations of the Advanced Encryption Standard. They are pretty much straight forward, i.e. they are implemented exactly the same way as the AES is described. This ...
jordi88's user avatar
  • 111
11 votes
1 answer
3k views

Is every point on an elliptic curve of a prime order group a generator?

If the order of elliptic group is prime then every point is a generator of that group. I tested the above statement on some elliptic curves and found it true. Does that really work on all curves? Is ...
Rashmi's user avatar
  • 121
11 votes
1 answer
2k views

curve25519 weak points for contributory behaviour

The Diffie-Hellman on curve25519 is usually calculated using the base point $(9,…)$ which induces a cyclic subgroup of $G:=\{\infty\}\cup(E(F_{p^2})\cap(F_p\times F_p))$ with index 8, i.e. there is a ...
Perseids's user avatar
  • 562
11 votes
1 answer
5k views

Mapping of message onto elliptic curve and reverse it?

I would like to perform a variant of Elliptic Curve ElGamal in java using the BouncyCastle libraries. I currently face the difficulty of mapping a message $m$ onto the elliptic curve $E_p$. I have so ...
franckysnow's user avatar
11 votes
1 answer
309 views

How does the process of creating a new secure Elliptic Curve look like?

I'm especially curious about the technique djb would have used to come up with his Curve 25519. Say I have already written down my goals, such as - Twist Secure, Speed, Side Channel resistance, etc. ...
Cookies's user avatar
  • 213
11 votes
1 answer
5k views

ECDSA vs RSA: Performance on Android platform and surprising results

For our privacy-preserving protocol, an encrypted channel is established. In order to protect our system from man-in-the-middle attacks, a signature-based approach is used. After we've implemented it ...
OnTarget's user avatar
  • 453
11 votes
1 answer
1k views

HD (Hierarchical Deterministic) Keys using Safe Curves?

Bitcoin's HD (Hierarchical Deterministic) Keys as described in BIP32 allow for a master key to be created (a private key and a chain code) such that a tree of both public and private keys can be ...
Christopher Allen's user avatar
11 votes
1 answer
1k views

Why are elliptic curves over a field of characteristic 2 or 3 insecure?

The following is a quotation from my cryptography course: Recent results on the discrete logarithm raise big concerns on the security of elliptic curves over a binary field. What are these ...
user1868607's user avatar
  • 1,243
10 votes
2 answers
4k views

Ed25519 is a signature or just elliptic curve

Ed25519 is a signature or just elliptic curve? EDDSA is signature, what using curve ed25519?
J.Madison's user avatar
  • 133
10 votes
3 answers
493 views

What's up with unnamed elliptic curves in e-passports?

At my work I deal with the cryptographic aspects of the international E-Passport specification (the crypto chips embedded in your passports, the kiosks at airports that talk to them, and the ...
Mike Ounsworth's user avatar
10 votes
2 answers
1k views

What is a "constant time" work around when dealing with the point at infinity for prime curves?

I've been working for some time, on designing a constant time solution for dealing with the "point at infinity" for prime curves. So, far I'm using the Standard Projective Coordinates for ...
Aravind A's user avatar
  • 1,000
10 votes
1 answer
3k views

Is the term "Elliptic Curve Discrete Logarithm Problem" a misnomer?

I have just started studying Elliptic Curve Cryptography, and I have this doubt. In ECC the group operation is addition (and not multiplication). So, why is ECDLP stated as a variation of the discrete ...
P Godbole's user avatar
  • 103
10 votes
2 answers
2k views

How do malware rely safely on ECDH algorithm to maintain secrecy of keys?

In traditional malware (especially ransomware) using RSA approach, the public key may be hard-coded in the malware binary and is used to encrypt a symmetric key generated on the system. The symmetric ...
learnerX's user avatar
  • 687
10 votes
1 answer
1k views

How are curve names constructed?

I started with the question: Brainpool curves exist in a variant ending in ..r1 and ..t1. What does it mean? But there are also "secp.." and "sect.." just like NIST's "..r1&...
Anonymous20DB28's user avatar
10 votes
2 answers
5k views

Why are NaCl secret keys 64 bytes for signing, but 32 bytes for box?

Ed25519 secret and public keys can both be represented in 32 bytes. Why does NaCl use 64 byte signing keys?
knaccc's user avatar
  • 4,712
10 votes
3 answers
2k views

Curve 25519 (X25519, Ed25519) Convert coordinates between Montgomery curve and twisted Edwards curve

I have some misunderstanding about EdDSA conversion coordinates between Montgomery curve and twisted Edwards curve. In https://www.rfc-editor.org/rfc/rfc7748 I see that a base point for Curve25519 is ...
sribin's user avatar
  • 248
10 votes
1 answer
5k views

Why can ECC key sizes be smaller than RSA keys for similar security?

I understand how ECC is based on the discrete log problem and RSA on integer factorization. I've read several references that show how a solution to either of these problems can typically be adapted ...
Rick's user avatar
  • 103
10 votes
1 answer
874 views

Visualization of Elliptic Point Addition [closed]

In an introductory text, I found that point addition for elliptic curves can be made plausible as follows: Given two Points, P, Q, the sum is defined as the point on the curve I get by connecting P ...
MichaelW's user avatar
  • 1,477
10 votes
1 answer
8k views

ECDH or RSA more secure for symmetric key wrapping?

Suppose a message is encrypted with a symmetric block cipher with a random key. RSA is often used to wrap the symmetric key using the recipient's public key. In this case, the size of the message is ...
NumberFour's user avatar
10 votes
1 answer
2k views

Key exchange using ECDH vs ECIES?

I'm a beginner to ECC crypto programming. Can anyone explain to me the difference between using ECDH for shared key exchange and the use of ECIES by encrypting a shared key with the public key of the ...
hab's user avatar
  • 265
10 votes
1 answer
8k views

EC curve selection

Say for instance, this webservice offers the following curves. sect283k1 sect283r1 sect409k1 sect409r1 sect571k1 sect571r1 secp256k1 prime256v1 secp384r1 ...
Kinny's user avatar
  • 103
10 votes
2 answers
7k views

How to derive a symmetric key from ECDH shared secret?

I am trying to implement the internal primitives of ECDH. Currently I'm able to multiply the receiver's public EC point with the sender's private key to arrive at the shared EC point. Next step is to ...
sce's user avatar
  • 167
10 votes
1 answer
1k views

ECIES vs. RSA + AES

I am confused about the distinction between RSA and ECC (Elliptic curve) regarding encryption and would appreciate it if someone could confirm whether my understanding is correct. To encrypt a large ...
Vlad's user avatar
  • 539
10 votes
1 answer
1k views

Curve25519 Key Validation

According to the original paper of Bernstein, there is no key validation needed when using Curve25519 for Diffie-Hellman Key Exchange. However, where does this property come from? Is there any proof ...
Marc's user avatar
  • 297
10 votes
1 answer
347 views

Is the Representation Problem hard on elliptic curves?

The RP in ECC would be to find $a_1,\ldots,a_n$ (integers) given $P$ and $Q_1,\ldots,Q_n$ (points in the EC) such that $P = a_1 \cdot Q_1 + \ldots + a_n \cdot Q_n$. Is it hard when DH-like ...
SDL's user avatar
  • 1,867
10 votes
1 answer
3k views

Point halving on elliptic curves of even order

I am trying to understand how point halving on elliptic curves of even order works. Specifically: suppose $g$ is an elliptic curve, and $G$ is a generator point on this curve. The order of group ...
irakliy's user avatar
  • 969
10 votes
1 answer
998 views

When using Ristretto or Decaf with Ed25519 and Ed448, do scalars still need pruning/trimming/clamping?

Decaf is a point compression method that builds a prime-order group for (twisted) Edwards curves and Montgomery curves with cofactor $h = 4$ based on the Jacobi quartic [H2015]. The promise is to ...
xorhash's user avatar
  • 731
10 votes
1 answer
3k views

Performance of ECDSA, ECKCDSA and ECGDSA

It is proven that ECDSA algorithms are faster in key and signature generation compared to RSA. In addition, the signatures are much shorter. However, I would like to know the performance difference ...
budderick's user avatar
  • 425
10 votes
1 answer
847 views

Is this a safe way to prove the knowledge of an ECDSA Signature?

I think that I've found a good solution to prove the knowledge of an ECDSA signature without revealing it. In short terms it consists in generating an ECDSA signature using the point $R$ as generator, ...
Jan Moritz's user avatar
9 votes
2 answers
2k views

Summarize the mathematical problem at the heart of breaking a Curve25519 public key

It's pretty easy to generate a Curve25519 private key: generate 32 random bytes of data and then do: e[0] &= 248 e[31] &= 127 e[31] |= 64 You can then ...
Kevin Burke's user avatar
9 votes
2 answers
3k views

Raw curve25519 public key points

I'm trying to understand curve25519, and ECC public points. I'm playing with Minisign, to better understand the fundamentals of ECC. Minisign uses curve25519 and outputs public keys as base64 ...
Woodstock's user avatar
  • 1,374
9 votes
1 answer
3k views

What is the projective space?

In Elliptic Curve Cryptography, using the projective space is often mentioned to accelerate the computations and to represent the point at infinity. But What is the Projective space exactly ? How can ...
Biv's user avatar
  • 9,969
9 votes
2 answers
2k views

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

I come across this: Numbers mod composite number does not form a field rather it forms a ring and every number has a multiplicative inverse under integer mod prime Maybe these are the reasons ...
Venkatesh's user avatar
  • 472
9 votes
3 answers
3k views

Elliptic Curves of different forms

Looking at http://safecurves.cr.yp.to/ to find a safe curve, I find that most curves described here are of a different form from that generally used. In Bouncy Castle, for example, ...
Niels Abildgaard's user avatar
9 votes
2 answers
1k views

Geometric interpretation of an Edwards curve

Addition on an elliptic curve in Weierstrass form (over the rationals) is typically depicted with the following figure: (Image CC SA 3.0 https://en.wikipedia.org/wiki/File:ECClines.svg) To add two ...
Ruben De Smet's user avatar
9 votes
1 answer
6k views

Subtracting a point in elliptic curve cryptography?

I've had lots of practice adding points for my crypto class. However I've run into a situation where I need to subtract two points for decryption: ...
ConditionRacer's user avatar
9 votes
1 answer
433 views

Why are there so many different elliptic curves?

There are Chinese, French and NIST curves. There's a Million Dollar one. The BADA55 Research Team studied 1 million variants. Some are based on widely different formulae. Indeed there are entire ...
Paul Uszak's user avatar
  • 15.2k
9 votes
4 answers
5k views

Is Elliptic Curve Diffie-Hellman (ECDH) still secure if I use the public key more than one time?

Elliptic Curve Diffie-Hellman (ECDH) with Public parameters: Ep (a,b) and G = (x, y) Private Keys: ...
Daniel Specht's user avatar
9 votes
2 answers
3k views

How did someone discover N, order of G for SECP256k1?

Could someone please explain, in simple and easy terms, how the creators did (or should have) derived the N, order of G for ...
Mine's user avatar
  • 209
9 votes
1 answer
3k views

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

When I do: openssl ecparam -list_curves I get, among other entries: ...
DepressedDaniel's user avatar
9 votes
2 answers
10k views

How to measure ECC key size?

I have implemented a ECC key generation scheme successfully. Now I need to find ECC key sizes of each generating key pairs. I assumed that ECC key size is the size of the ECC private Key. So I would ...
user2934766's user avatar
9 votes
1 answer
2k views

Find Elliptic Curve Parameters, a and b, Given Two Points on the Curve

I am new to Elliptic Curve Cryptography and am working on a CTF challenge that uses Elliptic Curves. Currently, I am trying to find the generator, $G$, and am given the public and private keys, $P$ ...
jinscoe123's user avatar
9 votes
2 answers
2k views

How many valid X25519 private keys are there?

According to the Curve25519 website: Computing secret keys. Inside your program, to generate a 32-byte Curve25519 secret key, start by generating 32 secret random bytes from a cryptographically safe ...
Ben Zelnick's user avatar
9 votes
1 answer
1k views

Why are co-factors 4 and 8 so popular when co-factor is more than one?

For elliptic curve cryptography, I seem to keep coming across curves with either co-factors of 4 or 8 whenever it is a non-prime order group. Is this a co-incidence? Have we studied ECC for curves ...
WeCanBeFriends's user avatar
9 votes
1 answer
2k views

Point addition equation in projective co ordinates

How can I get point addition equation for elliptic curves in projective co ordinate system? Can I get it by changing $$ x = X/Z $$ and $$ y =Y/Z $$ in the equation for affine co ordinates' group law? ...
vijita's user avatar
  • 127
9 votes
1 answer
2k views

Is it possible to decrypt an ECDSA private key if the same nonce is used across different private keys?

If the same nonce is used across different messages under the same private key, the private key can be easily revealed. However, let's consider another scenario. Two private keys, x1 and x2, are ...
Anonymous's user avatar
  • 143
9 votes
1 answer
6k views

How to find the order of a generator on an elliptic curve?

I was looking out to find optimum generator for an elliptic curve $E$ over a prime field $\mathbb F_p$. I found the following algorithm: Choose random point $P$ on the curve. Find the order of a ...
Venkatesh's user avatar
  • 472
9 votes
2 answers
3k views

ECC algorithm pollard's $\rho$ complexity

One of the methods to break a ECDLP is Pollard's rho algorithm. When ECDLP is defined over a finite field $F_p$, and given a relation $S=w.T$, where S and T are a member of $F_p$. Then ECDLP is to ...
Vineet Menon's user avatar
  • 1,995
9 votes
1 answer
1k views

Families of public/private keys in elliptic curve cryptography

I'm looking for a related key scheme for elliptic curve cryptography. The basic idea would be that there would be a master public key and a master private key. From the master public key, you could ...
David Schwartz's user avatar
9 votes
1 answer
12k views

Is Curve P-384 equal to secp384r1?

I am a bit confused with different notations of elliptic curves. Specifically, I am comparing the NIST specification with the SECG specification. More specifically I want to know if the NIST curve $...
grees's user avatar
  • 391

1 2
3
4 5
43