Using primitive subgroups to do more with fewer bits

@article{Rubin2004UsingPS,
  title={Using primitive subgroups to do more with fewer bits},
  author={Karl Rubin and Alice Silverberg},
  journal={IACR Cryptology ePrint Archive},
  year={2004},
  volume={2004},
  pages={87}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Looking beyond XTR

View 17 Excerpts
Highly Influenced

A

K. Rubin
Silverberg, Algebraic tori in cryptography, to appear in High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, Fields Institute Communications Series, AMS, Providence, RI, • 2004
View 6 Excerpts
Highly Influenced

Doing More with Fewer Bits

View 9 Excerpts
Highly Influenced

P

A. J. Menezes
C. van Oorschot, S. A. Vanstone, Handbook of applied cryptography, CRC Press, Boca Raton, FL, • 1997
View 11 Excerpts
Highly Influenced

Public-key cryptosystems based on cubic finite field extensions

IEEE Trans. Information Theory • 1999
View 4 Excerpts
Highly Influenced

A One Round Protocol for Tripartite Diffie–Hellman

Journal of Cryptology • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…