Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2523, Issue , 2003, Pages 318-332

  Stam, Martijn ^a   Lenstra, Arjen K ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; HARDWARE;

CYCLOTOMIC POLYNOMIALS; EXPONENTIATIONS; FINITE FIELDS; LUC; XTR;

EMBEDDED SYSTEMS;

EID: 35248854585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36400-5_24     Document Type: Article

References (24)

1. n). In C. G. Günther, editor, Advances in Cryptography- Eurocrypt'88, volume 330 of Lecture Notes in Computer Science, pages 251-255. Springer-Verlag, 1988.
2. D. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 2000.
3. S. A. Brands. Rethinking Public Key Infrastructures and Digital Certificates Building in Privacy. PhD thesis, Technische Universiteit Eindhoven, 1999.
4. H. Cohen. Analysis of the flexible window powering algorithm. Submitted for publication, available from math.u-bordeaux.fr/~cohen, 2001.
5. H. Cohen and A. K. Lenstra. Supplement to implementation of a new primality test. Mathematics of Computation, 48(177): S1-S4, 1987.
6. R. Gramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In H. Krawczyk, editor, Advances in Cryptography-Crypto'98, volume 1462 of Lecture Notes in Computer Science, pages 13-25. Springer-Verlag, 1998.
7. T. EIGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469-472, 1985.
8. R. Gallant, R. Lambert, and S. Vanstone. Faster point multiplication on elliptic curves with efficient endomorphisms. In J. Kilian, editor, Advances in Cryptography-Crypto'01, volume 2139 of Lecture Notes in Computer Science, pages 190-200. Springer-Verlag, 2001.
9. D. M. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math., 6(1):124-138, 1993.
10. A. Lempel, G. Seroussi, and S. Winograd. On the complexity of multiplication in finite fields. Theoretical Computer Science, 22:285-296, 1983.
11. A. K. Lenstra. Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields. In V. Varadharajan, J. Pieprzyk, and Y. Mu, editors, ACISP'97, volume 1270 of Lecture Notes in Computer Science, pages 127-138. Springer-Verlag, 1997.
12. A. K. Lenstra and E. R. Verheul. Key improvements to XTR. In T. Okamoto, editor, Advances in Cryptography-Asiacrypt'00, volume 1976 of Lecture Notes in Computer Science, pages 220-233. Springer-Verlag, 2000.
13. A. K. Lenstra and E. R. Verheul. The XTR public key system. In M. Bellare, editor, Advances in Cryptography-Crypto'00, volume 1880 of Lecture Notes in Computer Science, pages 1-19. Springer-Verlag, 2000.
14. R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, 1994.
15. S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106-110, 1978.
16. J. Pollard. Monte carlo methods for index computation (modp). Mathematics of Computation, 32(143):918-924, 1978.
17. O. Schirokauer, Mar. 2000. Personal communication.
18. O. Schirokauer, D. Weber, and T. F. Denny. Discrete logarithms: the effectiveness of the index calculus method. In H. Cohen, editor, ANTS II, volume 1122 of Lecture Notes in Computer Science, pages 337-361. Springer-Verlag, 1996.
19. B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In M. Wiener, editor, Advances in CryptographyCrypto'99, volume 1666 of Lecture Notes in Computer Science, pages 148-164. Springer-Verlag, 1999.
20. P. Smith and C. Skinner. A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms. In J. Pieprzyk and R. Safavi-Naini, editors, Advances in Cryptography- Asiacrypt'94, volume 917 of Lecture Notes in Computer Science, pages 357-364. Springer-Verlag, 1995.
21. J. A. Solinas. Low-weight binary representations for pairs of integers. Technical report, CACR (University of Waterloo) preprint series, 2001.
22. M. Stam and A. K. Lenstra. Speeding up XTR. In C. Boyd, editor, Advances in Cryptography - Asiacrypt'01, volume 2248 of Lecture Notes in Computer Science, pages 125-143. Springer-Verlag, 2001.
23. E. Teske. On random walks for PoIlard's rho method. Mathematics of Computation, 70:809-825, 2001.
24. J. von zur Gathen and M. Nöcker. Exponentiation in finite fields: theory and practice. In T. Mora and H. Mattson, editors, AAECC-12, volume 1255 of Lecture Notes in Computer Science, pages 88-133. Springer-Verlag, 1997.