A low-power parallel architecture for finite galois field GF(2m) arithmetic operations for elliptic curve cryptography

Journal of Low Power Electronics

Volumn 8, Issue 4, 2012, Pages 440-451

  Amini, Esmaeil ^a   Jeddi, Zahra ^a   Khattab, Ahmed ^b   Bayoumi, Magdy ^a  

^a University of Louisiana at Lafayette   (United States)

^b CAIRO UNIVERSITY   (Egypt)

Author keywords

ECC; Field Arithmetic; Modular Inversion; Modular Multiplication; Parallel Architecture; Public Key Encryption

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

ARITHMETIC OPERATIONS; ELLIPTIC CURVE CRYPTOGRAPHY; FIELD ARITHMETIC; MODULAR INVERSION; MODULAR MULTIPLICATION; PROPOSED ARCHITECTURES; PUBLIC-KEY ENCRYPTION; SCALAR POINT MULTIPLICATION;

PARALLEL ARCHITECTURES;

EID: 84865155235     PISSN: 15461998     EISSN: 15462005     Source Type: Journal    
DOI: 10.1166/jolpe.2012.1205     Document Type: Article

References (19)

1. R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120 (1978).
2. V. Miller, Uses of elliptic curves in cryptography, Proceedings of the Advances in Cryptography (1986), Vol. 218, pp. 417-426.
3. N. Kobilitz, Elliptic curve cryptosystems. Mathematics of Computation 48, 203 (1987).
4. D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, Springer-Verlag, Berlin, Germany (2004), pp. 259-260.
5. m) and its applications. IEEE Transactions on VLSI Systems 17, 541 (2009).
6. E. Savaş and Ç. K. Koç, Finite field arithmetic for cryptography. IEEE Circuits and Systems Magazine 10, 40 (2010).
7. M. Hasan and M. Ebtedaei, Efficient architectures for computations over variable dimensional Galois Field. IEEE Transactions on Circuits Systems\-I: Fundamental Theory and Applications 45, 1205 (1998).
8. N. Gura, S. C. Shantz, H. Eberle, S. Gupta, V. Gupta, D. Finchel-stein, E. Goupy, and D. Stebila, An End-to-End Systems Approach to Elliptic Curve Cryptography, Proceedings of 4th International Workshop on Cryptographic Hardware and Embedded Systems (2002), 1 p. 349-365.
9. X. Joedman and A. Chandrakasan, An energy-Efficient reconfigurable public-key cryptography processor. IEEE Journal of Solid-State Circuits 36, 1808 (2001).
10. m) multipliers for curve-based cryptography. IEEE Transactions on Computers 55, 1306 (2006).
11. m). Elsevier Microelectronics Journal 34, 975 (2003).
12. C. Chiou, C. Lee, and J. Lin, Unified dual-field multiplier in GF(p) and GF(2k). Institute of Engineering and Technology (IET) Information Security 3, 45 (2009).
13. m. IEEE Transactions on Computers 56, 909 (2007).
14. m), Proceedings of IEEE International Midwest Symposium on Circuits and Systems (2010), pp. 57-60.
15. M. Koschuch, J. Lechner, A. Weitzer et al., Hardware/software co design of elliptic curve cryptography on an 8051 microcontroller, Proceeding of Workshop of Cryptographic Hardware and Embedded System (2006), pp. 430-444. (Pubitemid 44710732)
16. J. Chen and M. Shieh, A high-performance unified-field reconfigurable cryptographic processor. IEEE Transaction on Very Large Scale Integration (VLSI) Systems 18, 1145 (2010).
17. m). J. Low Power Electron. 7, 314 (2011).
18. m). IEEE Transactions on Computers 42, 1010 (1993).
19. V. Gupta, D. Stebila, and S. Chang, Integrating elliptic curve cryptography (ECC) into the web's security infrastructure, Proceedings of International World Wide Web Conference on Alternate Track Papers and Posters (2004), pp. 402-403.