Abstract
This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields K, where K can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which take in input two random points from two different subgroups. In other words, for a given elliptic curve E defined over a finite field \(\mathbb {F}_q\) and two random points \(P \in \mathcal {P}\) and \(Q\in \mathcal {Q}\), where \(\mathcal {P}\) and \(\mathcal {Q}\) are two subgroups of \(E(\mathbb {F}_q)\), our function extracts the least significant bits of the abscissa of the point \(P\oplus Q\) when q is a large prime, and the k-first \(\mathbb {F}_p\) coefficients of the abscissa of the point \(P\oplus Q\) when \(q = p^n\), where p is a prime greater than 5. We show that the extracted bits are close to uniform.
Our construction extends some interesting randomness extractors for elliptic curves, namely those defined in [7, 9, 10], when \(\mathcal {P} = \mathcal {Q}\). The proposed constructions can be used in any cryptographic schemes which require extraction of random bits from two sources over elliptic curves, namely in key exchange protocol, design of strong pseudo-random number generators, etc.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahmadi, O., Shparlinski, I.E.: Exponential Sums over Points of Elliptic Curves. arXiv preprint arXiv:1302.4210 (2013)
Ankney, R., Honson, D., Matyas, M.: The Unified Model. Contribution to X9F1, October 1995
ANSI X9.42, Agreement of Symmetric Algorithm Keys using Diffie-Hellman, Working draft, July 1998
ANSI X9.63, Elliptic Curve Key Agreement and Key Transport Protocols, Working draft, July 1998
Barker, E.B., Chen, L., Roginsky, A., Smid, M.E.: Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography, NIST Special Publication 800–56A Revision 2, May 2013
Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998). doi:10.1007/BFb0054851
Chevalier, C., Fouque, P.-A., Pointcheval, D., Zimmer, S.: Optimal randomness extraction from a Diffie-Hellman element. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 572–589. Springer, Heidelberg (2009)
Ciss, A.A.: Arithmétique et Extracteurs déterministes sur les courbes elliptiques. Thèse de doctorat unique (2012)
Ciss, A.A., Sow, D.: Randomness extraction in elliptic curves and secret key derivation at the end of Diffie-Hellman protocol. Int. J. Appl. Cryptol. 2(4), 360–365 (2012)
Ciss, A.A., Sow, D.: On randomness extraction in elliptic curves. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 290–297. Springer, Heidelberg (2011)
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644–654 (1976)
Dodis, Y., Gennaro, R., Håstad, J., Krawczyk, H., Rabin, T.: Randomness extraction and key derivation using the CBC, cascade and HMAC modes. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 494–510. Springer, Heidelberg (2004)
Farashahi, R.R., Pellikaan, R.: The quadratic extension extractor for (hyper)elliptic curves in odd characteristic. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 219–236. Springer, Heidelberg (2007)
Farashahi, R.R., Sidorenko, A., Pellikaan, R.: Extractors for binary elliptic curves. Des. Codes Crypt. 94, 171–186 (2008)
Gürel, N.: Extracting bits from coordinates of a point of an elliptic curve, Cryptology ePrint Archive, Report 2005/324 (2005). http://eprint.iacr.org/
Håstad, J., Impagliazzo, R., Levin, L., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364–1396 (1999)
IEEE P1363, Standard specification for public key cryptography, Working draft, July 1998
Koblitz, N.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
Kohel, D.R., Shparlinski, I.E.: On exponential sums and group generators for elliptic curves over finite fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 395–404. Springer, Heidelberg (2000)
Shaltiel, R.: An introduction to randomness extractors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 21–41. Springer, Heidelberg (2011)
Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48(4), 860–879 (2001)
Winterhof, A.: Incomplete additive character sums and applications. In: Jungnickel, D., Niederreiter, H. (eds.) Finite Fields and Applications, pp. 462–474. Springer, Heidelberg (2001)
Acknowledgments
The authors acknowledge support from the Simons Foundation through the Pole of Research in Mathematics and their Applications to Information Security in Subsaharan Africa (PRMAIS) and the LIRIMA-MACISA project.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ciss, A.A., Sow, D. (2017). Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange. In: El Hajji, S., Nitaj, A., Souidi, E. (eds) Codes, Cryptology and Information Security. C2SI 2017. Lecture Notes in Computer Science(), vol 10194. Springer, Cham. https://doi.org/10.1007/978-3-319-55589-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-55589-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55588-1
Online ISBN: 978-3-319-55589-8
eBook Packages: Computer ScienceComputer Science (R0)