A flexible architecture for finite field galois fields(2m)) arithmetic processor

Journal of Low Power Electronics

Volumn 7, Issue 3, 2011, Pages 314-327

  Faisal, Ibrahim ^a   Jeddi, Zahra ^a   Amini, Esmaeil ^a   Bayoumi, Magdy ^a  

^a University of Louisiana at Lafayette   (United States)

Author keywords

Cryptoprocessor; ECC; Field Arithmetic; Modular Inversion; Modular Multiplication; Public Key Encryption

Indexed keywords

CLOCKS; PROGRAMMABLE LOGIC CONTROLLERS; PUBLIC KEY CRYPTOGRAPHY;

CRYPTO-PROCESSOR; FIELD ARITHMETIC; MODULAR INVERSION; MODULAR MULTIPLICATION; PUBLIC-KEY ENCRYPTION;

SYSTEM-ON-CHIP;

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

References (22)

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. N. Kobilitz, Elliptic curve cryptosystems, Mathematics of Computation 48, 203 (1987).
3. V. Miller, Uses of elliptic curves in cryptography, Proceedings of the Advances in Cryptography 218, 417 (1986).
4. J. Daemen and V. Rijmen, The Design of Rijndael: AES-The Advanced Encryption Standard, Springer, New York (2002).
5. FIPS 186-2, Digital signature standard, Federal Information Processing Standards Publication 186-2 (2000).
6. 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.
7. P. Kitsos, G. Theodoridis, and O. Koufopavlou, An efficient reconfigurable, multiplier architecture for Galois Field GF(2m-, Elsevier Microelectronics Journal 34, 975 (2003).
8. 2m), IEEE Journal on Selected Areas in Communications 4, 62 (1986).
9. 2m), IEEE Transactions on Computers 42, 1010 (1993).
10. N. Gura, S. Chang Shantz, H. Eberle, S. Gupta, V. Gupta, D. Finchelstein, E. Goupy, and D. Stebila, An end-to-end systems approach to elliptic curve cryptography, Cryptographic Hardware and Embedded Systems-CHES 2002, Lecture Notes in Computer Science, Springer, Berlin/Heidelberg (2003), Vol. 2523, pp. 15-22.
11. H. Wu, Bit-parallel polynomial basis multiplier for new classes of finite fields, IEEE Transactions on Computers 57, 1023 (2008).
12. J. Goodman and A. Chandrakasan, An energy-efficient reconfigurable public-key cryptography processor, IEEE Journal of Solid- State Circuits 36, 1808 (2001).
13. C. Paar, P. Fleischmann, and P. Soria-Rodriguez, Fast arithmetic for public-key algorithms in Galois Field with composite components, IEEE Transactions on Computers 48, 1025 (1999).
14. 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).
15. 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).
16. 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).
17. D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, Springer-Verlag (2004), pp. 259-260.
18. 2m) on 32 bit processors, Journal o Signal Processing Systems 60, 31 (2010).
19. 2m), Proceedings of the Thirty Eighth Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA (2004).
20. L. L. Song and K. K. Parhi, Efficient finite field serial/parallel multiplication, Proceedings of the IEEE International Conference on Application Specific Systems, Architectures, and Processors, Chicago, USA (1996), pp. 19-21.
21. 2n), IEEE Transactions on Circuits and Systems-I 53, 2606 (2006).
22. S. Moon, A binary redundant scalar point multiplication in secure elliptic curve cryptosystems, International Journal of Network Security 3, 132 (2006).