Have a personal or library account? Click to login
Point Compression and Coordinate Recovery for Edwards Curves over Finite Field Cover

Point Compression and Coordinate Recovery for Edwards Curves over Finite Field

Annals of West University of Timisoara - Mathematics and Computer Science
Volume 52 (2014): Issue 2 (December 2014)
By: Benjamin Justus  
Open Access
|Mar 2015

References

  1. [1] Benjamin Justus and Daniel Loebenberger, Differential Addition in Generalized Edwards Coordinates, IWSEC, 2010, 316-32510.1007/978-3-642-16825-3_21
    Search in Google Scholar
  2. [2] Alina Dudeanu and George-Razvan Oancea and Sorin Iftene, An x- Coordinate Point Compression Method for Elliptic Curves over Fp, SYNASC, 2010, 65-7110.1109/SYNASC.2010.23
    Search in Google Scholar
  3. [3] Majid Khabbazian and T. Aaron Gulliver and Vijay K. Bhargava, Double Point Compression with Applications to Speeding Up Random Point Multiplication, IEEE Trans. Computers, 56 (3), (2007), 305-31310.1109/TC.2007.47
    Search in Google Scholar
  4. [4] IEEE 1363-2000: Standard Specification For Public Key Cryptorgraphy, American National Standards Institute, IEEE Computer Society, 2000.
    Search in Google Scholar
  5. [5] Daniel J. Bernstein and Peter Birkner and Tanja Lange and Christiane Peters, ECM using Edwards curves, Math. Comput., 82 (282), (2013)10.1090/S0025-5718-2012-02633-0
    Search in Google Scholar
  6. [6] Torbjörn Granlund and the GMP development team, GMP-5.0.5, 2012.
    Search in Google Scholar
  7. [7] Daniel J. Bernstein and Tien-Ren Chen and Chen-Mou Cheng and Tanja Lange and Bo-Yin Yang, ECM on Graphics Cards, EUROCRYPT, 2009, 483-50110.1007/978-3-642-01001-9_28
    Search in Google Scholar
  8. [8] Paul Zimmermann and Bruce Dodson, 20 Years of ECM, ANTS, 2006, 525-54210.1007/11792086_37
    Search in Google Scholar
  9. [9] Katsuyuki Okeya and Kouichi Sakurai, Effcient Elliptic Curve Cryptosys- tems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve, CHES, Vol. Generators, 2001, 126-14110.1007/3-540-44709-1_12
    Search in Google Scholar
  10. [10] Eric Brier and Marc Joye, Weierstra Elliptic Curves and Side-Channel Attacks, Public Key Cryptography, 2002, 335-34510.1007/3-540-45664-3_24
    Search in Google Scholar
  11. [11] Eric Bach and Jeffrey Shallit, Algorithmic Number Theory, MIT Press, 1, 1996
    Search in Google Scholar
  12. [12] Wouter Castryck and Steven D. Galbraith and Reza Rezaeian Farashahi, Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation, IACR Cryptology ePrint Archive, 2008, (2008), 218
    Search in Google Scholar
DOI: https://doi.org/10.2478/awutm-2014-0014 | Journal eISSN: 1841-3307 | Journal ISSN: 1841-3293
Journal RSS Feed
Language: English
Page range: 111 - 125
Submitted on: Jun 25, 2014
Accepted on: Dec 10, 2014
Published on: Mar 25, 2015
Published by: West University of Timisoara
In partnership with: Paradigm Publishing Services
Publication frequency: Volume open
Keywords:
Point Compression,
IEEE Std 1363-2000,
Elliptic Curve,
Finite Field,
Edwards Curve
Related subjects:
Mathematics,
General mathematics

© 2015 Benjamin Justus, published by West University of Timisoara
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 52 (2014): Issue 2 (December 2014)Next article