Advertisement

Injective Encodings to Binary Ordinary Elliptic Curves

  • Mojtaba Fadavi
  • Reza Rezaeian FarashahiEmail author
  • Soheila Sabbaghian
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11349)

Abstract

Representing points of elliptic curves in a way that no pattern can be detected by sensors in the transmitted data is a crucial problem in elliptic curve cryptography. One of the methods that we can represent points of the elliptic curves in a way to be indistinguishable from random bit strings is using injective encoding function. So far, several injective encodings to elliptic curves have been presented, but the previous encoding functions have not supported the binary elliptic curves. More precisely, the only injective encoding to binary elliptic curves was given for Hessian curves, the family of elliptic curves with a point of order 3. In this paper, we propose approaches for constructing injective encoding algorithms to the ordinary binary elliptic curves \(y^2+xy=x^3+ax^2+b\) with \(\mathrm {Tr}(a)=1\) as well as those with \(\mathrm {Tr}(a+1)=0\).

Keywords

Elliptic curve Cryptography Injective encoding 

Notes

Acknowledgment

The authors thank Diego Aranha and Anonymous reviewers for the useful comments of this work. This research was in part supported by a grant from IPM (No. 96050416).

References

  1. 1.
    Avanzi, R., et al.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)Google Scholar
  2. 2.
    Aranha, D.F., Fouque, P.-A., Qian, C., Tibouchi, M., Zapalowicz, J.-C.: Binary elligator squared. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 20–37. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-13051-4_2CrossRefGoogle Scholar
  3. 3.
    Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM Conference on Computer and Communications Security, pp. 967–980. ACM (2013)Google Scholar
  4. 4.
    Brier, E., Coron, J.-S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient indifferentiable hashing into ordinary elliptic curves. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 237–254. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-14623-7_13CrossRefGoogle Scholar
  5. 5.
    Boyko, V., MacKenzie, P., Patel, S.: Provably secure password-authenticated key exchange using Diffie-Hellman. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 156–171. Springer, Heidelberg (2000).  https://doi.org/10.1007/3-540-45539-6_12CrossRefGoogle Scholar
  6. 6.
    Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-44647-8_13CrossRefGoogle Scholar
  7. 7.
    Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-45682-1_30CrossRefGoogle Scholar
  8. 8.
    Farashahi, R.R.: Hashing into Hessian curves. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 278–289. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-21969-6_17CrossRefGoogle Scholar
  9. 9.
    Fouque, P.-A., Joux, A., Tibouchi, M.: Injective encodings to elliptic curves. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol. 7959, pp. 203–218. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-39059-3_14CrossRefGoogle Scholar
  10. 10.
    Hesse, O.: Über die Elimination der Variabeln aus drei algebraischen Gleichungen vom zweiten Grade mit zwei Variabeln. J. Reine Angew. Math. 10, 68–96 (1844)CrossRefGoogle Scholar
  11. 11.
    Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography, 1st edn. Springer, New York (2004).  https://doi.org/10.1007/b97644CrossRefzbMATHGoogle Scholar
  12. 12.
    Icart, T.: How to hash into elliptic curves. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 303–316. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-03356-8_18CrossRefGoogle Scholar
  13. 13.
    Jablon, D.P.: Strong password-only authenticated key exchange. SIGCOMM Comput. Commun. 26(5), 5–26 (1996)CrossRefGoogle Scholar
  14. 14.
    Menezes, A., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field, pp. 1639–1647. IEEE (1993)Google Scholar
  15. 15.
    Resende, A.C.D., Aranha, D.F.: Faster unbalanced private set intersection. J. Internet Serv. Appl. 9(1), 1–18 (2018)CrossRefGoogle Scholar
  16. 16.
    Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comput. 44(170), 483–494 (1985)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Silverman, J.H.: The Arithmetic of Elliptic Curves. Springer, Berlin (1995)Google Scholar
  18. 18.
    Shallue, A., van de Woestijne, C.E.: Construction of rational points on elliptic curves over finite fields. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 510–524. Springer, Heidelberg (2006).  https://doi.org/10.1007/11792086_36CrossRefGoogle Scholar
  19. 19.
    Washington, L.C.: Elliptic Curves: Number Theory and Cryptography, 2nd edn. CRC Press, Boca Raton (2008)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Mojtaba Fadavi
    • 1
  • Reza Rezaeian Farashahi
    • 1
    • 2
    Email author
  • Soheila Sabbaghian
    • 1
  1. 1.Department of Mathematical SciencesIsfahan University of TechnologyIsfahanIran
  2. 2.School of MathematicsInstitute for Research in Fundamental Sciences (IPM)TehranIran

Personalised recommendations