[Resource Topic] 2015/647: Efficient ephemeral elliptic curve cryptographic keys

Welcome to the resource topic for 2015/647

Title:
Efficient ephemeral elliptic curve cryptographic keys

Authors: Andrea Miele, Arjen K. Lenstra

Abstract:

We show how any pair of authenticated users can on-the-fly agree on an el- liptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on constrained devices such as smartphones, allowing them to efficiently generate ephemeral parameters that are unique to any single cryptographic application such as symmetric key agreement. For such applications it thus offers an alternative to long term usage of stan- dardized or otherwise pre-generated elliptic curve parameters, obtaining security against cryptographic attacks aimed at other users, and eliminating the need to trust elliptic curves generated by third parties.

ePrint: https://eprint.iacr.org/2015/647

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .