Dual-field arithmetic unit for GF(p) and GF(2m)

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

Volumn 2523, Issue , 2003, Pages 500-514

  Wolkerstorfer, Johannes ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Finite field arithmetic; Hardware implementation; Inversion; Modular reduction; Multiplication; Redundant number representation

Indexed keywords

CRYPTOGRAPHY; EMBEDDED SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

FINITE FIELD ARITHMETIC; HARDWARE IMPLEMENTATIONS; INVERSION; MODULAR REDUCTION; MULTIPLICATION; REDUNDANT NUMBER REPRESENTATIONS;

HARDWARE;

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

References (17)

1. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, New York, 1997.
2. R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, Cambridge, 1986.
3. A. K. Lenstra and E. R. Verheul, Selecting Cryptographic Key Sizes, Journal of Cryptology, vol. 14, pp. 255-293, 2001.
4. ANSI X9.62, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), ANSI standard, 1999.
5. ANSI X9.63, Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography, ANSI standard, 2001.
6. IEEE P1363, Standard Specifications for Public-Key Cryptography, IEEE standard, 2000.
7. ISO / IEC 15946, Information Technology - Security Techniques - Cryptographic Techniques Based on Elliptic Curves, Committee Draft (CD), 1999.
8. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, Feb. 2000.
9. J. M. Rabaey, M. Pedram (ed.), Low Power Design Methodologies, Kluwer Academic Publishers, 1996.
10. E. D. Mastrovito, VLSI Architectures for Computations in Galois Fields, PhD thesis, Linköping University, Linköping, Sweden, 1991.
11. C. Paar, Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields, PhD thesis, Universität Essen, 1994.
12. Ç. Koç, C.Y. Hung, A Fast Algorithm for Modular Reduction, IEE Proceedings: Computers and Digital Techniques 145(4), pp. 265-271, July 1998.
13. M. Brown, D. Hankerson, A. Menezes, Software Implementation of the NIST Elliptic Curves over Prime Fields, Proceedings of CT-RSA 2001, LNCS 2020, pp. 250-265, Springer Verlag, 2001.
14. D. Hankerson, J. L. Hernandez, A. Menezes, Software Implementation of Elliptic Curve Cryptography over Binary Fields, Cryptographic Hardware and Embedded Systems - CUES 2000, LNCS 1965, pp. 1-24, Springer Verlag, Berlin, 2000.
15. m), Cryptographic Hardware and Embedded Systems - CHES 2000, LNCS 1965, pp. 281-296, Springer Verlag, Berlin, 2000.
16. m), Cryptographic Hardware and Embedded Systems - CHES 2001, LNCS 2162, pp. 206-223, Springer Verlag, 2001.
17. J. Goodman, A. P. Chandrakasan, An Energy-efficient Reconfigurable Public-Key Cryptography Processor, IEEE Journal of Solid-State Circuits, pp. 1808-1820, November 2001.