Paper 2015/647 Original: eprint.iacr.org/2015/647 ↗
Efficient ephemeral elliptic curve cryptographic keys
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2015-07-01: last updated
- 2015-07-01: published
- Short URL
- https://ia.cr/2015/647
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/647,
author = {Andrea Miele and Arjen K. Lenstra},
title = {Efficient ephemeral elliptic curve cryptographic keys},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/647},
year = {2015},
url = {https://eprint.iacr.org/2015/647}
}