Probabilistic Admissible Encoding on Elliptic Curves - Towards PACE with Generalized Integrated Mapping

  • Łukasz Krzywiecki
  • Przemysław Kubiak
  • Mirosław Kutyłowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8327)

Abstract

We consider admissible encodings on an elliptic curve, that is, the hash functions that map bitstrings to points of the curve. We extend the framework of admissible encodings, known from CRYPTO 2010 paper, to some class of non-deterministic mapping algorithms. Using Siguna Müller’s probabilistic square root algorithm we show a mapping that works efficiently for any finite field \(\mathbb{F}_q\) of characteristic greater than 3, and that is immune to timing attacks. Thereby we remove limitations of the mappings analyzed in the CRYPTO 2010 paper. Consequently, we remove limitations of a so called PACE Integrated Mapping protocol, which has recently been standardized by ICAO, and is used to protect contactless identity documents against unauthorized access.

Keywords

indifferentiability admissible encoding non-deterministic square root algorithm finite field elliptic curve 

References

  1. 1.
    Accredited Standards Committee X9, Inc., Financial Industry Standards: ANS X9.62-2005, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). American National Standard for Financial Services (2005)Google Scholar
  2. 2.
    Bach, E.: A note on square roots in finite fields. IEEE Transactions on Information Theory 36(6), 1494–1498 (1990)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Bernstein, D.J.: Faster square roots in annoying finite fields. Note: to be incorporated into author’s High-speed cryptography book (November 2001)Google Scholar
  4. 4.
    Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptology 17(4), 297–319 (2004)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Brier, E., Coron, J.S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient indifferentiable hashing into ordinary elliptic curves. Cryptology ePrint Archive, Report 2009/340 (2009)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    BSI: Advanced Security Mechanisms for Machine Readable Travel Documents 2.11. Technische Richtlinie TR-03110-3 (2013)Google Scholar
  8. 8.
    Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damgård revisited: How to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 430–448. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Coron, J.-S., Gouget, A., Icart, T., Paillier, P.: Supplemental Access Control (PACE v2): Security analysis of PACE Integrated Mapping. In: Naccache, D. (ed.) Quisquater Festschrift. LNCS, vol. 6805, pp. 207–232. Springer, Heidelberg (2012)Google Scholar
  10. 10.
    Demay, G., Gaži, P., Hirt, M., Maurer, U.: Resource-restricted indifferentiability. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 664–683. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  11. 11.
    ISO/IEC JTC1 SC17 WG3/TF5 for the International Civil Aviation Organization: Supplemental access control for machine readable travel documents. Technical Report (2011) version 1.02 (March 2008)Google Scholar
  12. 12.
    Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 21–39. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  13. 13.
    Müller, S.: On the computation of square roots in finite fields. Des. Codes Cryptography 31(3), 301–312 (2004)CrossRefMATHGoogle Scholar
  14. 14.
    Postl, H.: Fast evaluation of Dickson polynomials. Contrib. to General Algebra 6, 223–225 (1988)MathSciNetGoogle Scholar
  15. 15.
    Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with composition: Limitations of the indifferentiability framework. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 487–506. Springer, Heidelberg (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Łukasz Krzywiecki
    • 1
  • Przemysław Kubiak
    • 1
  • Mirosław Kutyłowski
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of TechnologyPoland

Personalised recommendations