A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
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