Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography /

Publication Info: To appear in Proc. ANTS VI

Date: received 1 Apr 2004

Contact author: silver at math ohio-state edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20040401:182540 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]