Using Primitive Subgroups to Do More with Fewer Bits [chapter]

K. Rubin, A. Silverberg
2004 Lecture Notes in Computer Science  
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. Rubin was partially supported by NSF grant DMS-0140378. Silverberg thanks NSA for support, and the ANTS VI organizers for inviting her to speak.
doi:10.1007/978-3-540-24847-7_2 fatcat:rswga3wcora57kw2agp36obaie