Algorithms for base point generation on an Edwards curve with the use of point divisibility criteria
From MaRDI portal
Publication:341366
DOI10.1007/s10559-016-9870-xzbMath1409.94887MaRDI QIDQ341366
A. V. Bessalov, Alexei Bespalov, L. V. Koval'chuk
Publication date: 16 November 2016
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-016-9870-x
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
14H52: Elliptic curves
14G50: Applications to coding theory and cryptography of arithmetic geometry
Cites Work
- Interrelation of families of points of high order on the Edwards curve over a prime field
- Exact number of elliptic curves in the canonical form, which are isomorphic to Edwards curves over prime field
- Twisted Edwards Curves
- Twisted Edwards Curves Revisited
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves