Using primitive subgroups to do more with fewer bits. (English) Zbl 1125.94328
Buell, Duncan (ed.), Algorithmic number theory. 6th international symposium, ANTS-VI, Burlington, VT, USA, June 13–18, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22156-5/pbk). Lecture Notes in Computer Science 3076, 18-41 (2004).
Summary: 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 [see the authors’ papers in Advances in cryptology – CRYPTO 2002. Lect. Notes Comput. Sci. 2442, 336–353 (2002; Zbl 1026.94540), Advances in cryptology – CRYPTO 2003. Lect. Notes Comput. Sci. 2729, 349–365 (2003; Zbl 1122.94400) and High primes and misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams. Fields Institute Communications 41, 317–326 (2004; Zbl 1073.94014)].
For the entire collection see [Zbl 1052.11002].
For the entire collection see [Zbl 1052.11002].
MSC:
| 94A60 | Cryptography |
| 11T71 | Algebraic coding theory; cryptography (number-theoretic aspects) |
| 14G50 | Applications to coding theory and cryptography of arithmetic geometry |
