Paper 2004/087

Using primitive subgroups to do more with fewer bits

K. Rubin and A. Silverberg

Abstract

This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of algebraic tori and abelian varieties.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. To appear in Proc. ANTS VI
Contact author(s)
silver @ math ohio-state edu
History
2004-04-01: received
Short URL
https://ia.cr/2004/087
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/087,
      author = {K.  Rubin and A.  Silverberg},
      title = {Using primitive subgroups to do more with fewer bits},
      howpublished = {Cryptology ePrint Archive, Paper 2004/087},
      year = {2004},
      note = {\url{https://eprint.iacr.org/2004/087}},
      url = {https://eprint.iacr.org/2004/087}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.