eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

Paper 2017/334

Updating key size estimations for pairings

Razvan Barbulescu and Sylvain Duquesne

Abstract

Recent progress on NFS imposed a new estimation of the security of pairings. In this work we study the best attacks against some of the most popular pairings and propose new key sizes using an analysis which is more precise than the analysis in a recent article of Menezes, Sarkar and Singh. We also select pairing-friendly curves for standard security levels.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published by the IACR in JOC 2018
DOI
10.1007/s00145-018-9280-5
Contact author(s)
sylvain duquesne @ univ-rennes1 fr
History
2018-02-01: last of 4 revisions
2017-04-18: received
See all versions
Short URL
https://ia.cr/2017/334
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/334,
      author = {Razvan Barbulescu and Sylvain Duquesne},
      title = {Updating key size estimations for pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2017/334},
      year = {2017},
      doi = {10.1007/s00145-018-9280-5},
      note = {\url{https://eprint.iacr.org/2017/334}},
      url = {https://eprint.iacr.org/2017/334}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.