Elliptic curves are a mathematical structure. In cryptography, it is common to use the structure $y^2 = x^3 + ax^2 + b$ over a finite field. Questions relating to elliptic curves and derived algorithms should use this tag and might also consider specific tags such as discrete-logarithm and ecdsa.

learn more… | top users | synonyms (1)

3
votes
1answer
168 views

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 ...
0
votes
1answer
23 views

EC based authenticated key exchange

From my little understanding of EC based authenticated key exchange protocols that it is not possible for authenticated key exchange without signing/signature scheme, please confirm? If both client ...
0
votes
1answer
72 views

How many characters per block in an El Gamal ECC cryptosystem?

While I look for how many characters that can be encrypted using the The elliptic curve ElGamal cryptosystem. of each block found for these lines. But I can not understand Actually in our case we ...
0
votes
0answers
45 views

Elliptic curve trapdoor function without modular arithmetic?

From what I understand, an elliptic contains a set points satisfying the equation $y^2=x^3 + ax + b$ together with the point at infity. It seems clear how multiplication with a scalar and a point ...
0
votes
0answers
27 views

Elliptic Curves Readdition

I found the term re-addition in https://www.hyperelliptic.org/EFD/g1p/auto-shortw-projective.html and I cannot figure out what it is. It has actually same complexity of addition and I dont see the ...
0
votes
0answers
68 views

initiate the elliptic curve

when we consider a curve in a prime field for example Weierstrass form and want to initiate it in Miracl,we should give these inputs for initiate curve: ebrick_init(&binst,x,y,a,b,n,window,nb) ...
0
votes
0answers
72 views

advantages of hashing over elliptic curve signatures for a proof of work protocol

I'm trying to create a proof-of-work protocol for a proof-of-concept software, and it's basically something like this: ...
0
votes
0answers
64 views

Scalar multiplication of elliptic curve point by a fraction

I'm implementing an algorithm that works on a generic finite cyclic group written in the classic multiplicative notation: (G,*) = < g > , n = |g| At a ...
0
votes
0answers
38 views

Size of Messages Exchanged by PRV and VER for Schnorr Protocol

In this file Elliptic Curve Based Zero Knowledge Proofs and Their Applicability on Resource Constrained Devices I don't understand the Table 6 (Table 6: Size of Messages Exchanged by the Prover(PRV) ...
0
votes
0answers
135 views

RSA and ECDSA Certificate Sizes

Is there a table (or a whitepaper from official sources) that compares the size of X509 certificates generated with RSA (starting from 1024 bits) and ECDSA (starting from 160 bits) ? Thanks for the ...
-1
votes
0answers
26 views

Creating of finite field over small prime number for Elliptic Curve

I need automatically generate field over small prime number for Elliptic Curve over Fp. For example I have Fp=23 and a=1, b=0. So filed has 23 points. Each point has to satisfy this equation: ...