Using primitive subgroups to do more with fewer bits

K.  Rubin; A.  Silverberg

Paper 2004/087 Original: eprint.iacr.org/2004/087 ↗

Using primitive subgroups to do more with fewer bits

K. Rubin

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
Category: Public-key cryptography
Publication info: Preprint.
History: 2004-04-01: last updated; 2004-04-01: published
Short URL: https://ia.cr/2004/087
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2004/087}
}