On the implementation of elliptic curve cryptosystems

DOI10.1007/0-387-34805-0_18MaRDI QIDQ3972886zbMATH OpenFDO

Authors Guy Castagnoli, Andreas Bender

Publication date 26 June 1992

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-34805-0_18

zbMATH Keywords

characteristic \(p\)cryptographypoints on an elliptic curve

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational aspects of algebraic curves (14Q05) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

[For the entire collection see Zbl 0719.00029.] The group of points on an elliptic curve over a field of characteristic \(p>3\) can be defined as the set of solutions \((x,y)\) of the general Weierstrass equation \(y^ 2=x^ 3+ax+b\) and, in the case of characteristic \(p=2\), \(y^ 2+y=x^ 3+ax+b\). The authors consider the family of elliptic curves having coefficient \(a=0\), in which case, the order of the group of the elliptic curve over \(\text{GF}(p)\) with \(p=-1\bmod 3\) is \((p+1)\) and over \(\text{GF}(2^ m)\) where \(m\) is odd is \(2^{m+1}\). The authors propose this family of elliptic curves for cryptographic use and give numerical examples which could have some cryptographic applications.

Recommendations

• scientific article; zbMATH DE number 4145824
• scientific article; zbMATH DE number 4191556
• Elliptic curve cryptosystems and their implementation
• Implementation of cryptographic algorithms for elliptic curves
• Implementing elliptic curve cryptography
• Elliptic Curve Cryptosystems
• scientific article; zbMATH DE number 697834
• Elliptic Curve Cryptography: A Software Implementation
• Generation and implementation of cryptographically strong elliptic curves
• Efficient elliptic curve cryptosystems

Cited in

(20)

• Constructive and destructive use of compilers in elliptic curve cryptography
• Elliptic curve cryptosystems over small fields of odd characteristic
• Elliptic curve cryptosystems and their implementation
• Cryptography on elliptic curves over \(p\) -adic number fields
• Generation and implementation of cryptographically strong elliptic curves
• Point choosing algorithm of elliptic curve cryptography
• Set of points on elliptic curve in projective coordinates
• An exploration of affine group laws for elliptic curves
• Compact elliptic curve representations
• scientific article; zbMATH DE number 6001033 (Why is no real title available?)
• scientific article; zbMATH DE number 4191556 (Why is no real title available?)
• scientific article; zbMATH DE number 4145824 (Why is no real title available?)
• The group structure of elliptic curves
• Parameters for secure elliptic curve cryptosystem -- improvements on Schoof's algorithm
• An End-to-End Systems Approach to Elliptic Curve Cryptography
• scientific article; zbMATH DE number 2042246 (Why is no real title available?)
• Modulus search for elliptic curve cryptosystems
• Isomorphic transformations of an elliptic curve over a finite field
• Bézier Coefficients Matrix for ElGamal Elliptic Curve Cryptosystem
• Parametric families of elliptic curves with cyclic F_p-rational points groups

This page was built for publication: On the implementation of elliptic curve cryptosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972886)