High-performance computing VLSI system for bit-parallel exponentiation in GF(2^m)

References

• Arzi, B. (1993). Architectures for exponentiation over GF(2m) adopted for smart-card application. IEEE Transactions on Computers, 42, 494–497.
   Web of Science ®Google Scholar
• Daly, A., Marnane, W., Kerins, T., & Popovici, E. (2004). An FPGA implementation of a GP(p)ALU for encryption processors. Microprocessors and Microsystems, 28, 253–260.
   Web of Science ®Google Scholar
• Ercegovac, M. D., Lang, T., & Moreno, J. H. (1999). Introduction to Digital System. New York, NY: John Wiley & Sons.
   Google Scholar
• Fan, H., & Hasan, M. A. (2007). A new approach to sub-quadratic space complexity parallel multipliers for extended binary fields. IEEE Transactions on Computers, 56, 224–233.
   Web of Science ®Google Scholar
• Fenn, S. T. J, Benaissa, M., & Taylor, D. (1996). GF(2m) multiplication and division over the dual basis. IEEE Transactions on Computers, 45, 319–327.
   Web of Science ®Google Scholar
• Ghafoor, A., & Singh, A. (1989). Systolic architecture for finite field exponentiation. Proceedings of an IEEE, pt. E, 136, 465–470.
   Google Scholar
• Grabbe, C., Bednara, M., Teich, J., von zur Gathen, J., & Shokrollahi, J. (2003). ‘FPGA designs of parallel high performance GF(2^233) multiplers’. http://www-math.upb.de~aggathenPublicationsgrabed03.pdf
   Google Scholar
• Henriquez, F. R., & Koc, C. K. (2003). Parallel multipliers based on special irreducible pentanomials. IEEE Transactions on Computers, 52, 1–8.
   Google Scholar
• Hwang, S. Y., Park, G. Y., Kim, D. H., & Jhang, K. S. (2010). Efficient implementation of a pseudorandom sequence generation for high-speed data communications. ETRI Journal, 32(2), 222–229.
   Web of Science ®Google Scholar
• Koc, C. K., & Sunar, B. (1998). Low complexity bit-parallel canonical and normal basis multipliers for a class of finite fields. IEEE Transactions on Computers, 47, 353–356.
   Web of Science ®Google Scholar
• Kovac, M., & Rangnathan, N. (1996). ACE: A VLSI chip for Galois field GF(2m). IEEE Transactions on Circuits and Systems, 43, 289–297.
   Google Scholar
• Martinez, M. A. G, Luna, G. M., & Henriquez, F. R. (2003). Hardware implementation of the binary method for exponentiation in GF(2m). Proceedings of the Fourth International Conference on Computer Science, 131–134.
   Google Scholar
• Mathew, J., Jabir, A. M., & Pradhan, D. K. (2008). ‘Design techniques for bit-parallel Galois field multipliers with on-line single error correction and double error detection’, 14th IEEE International On-Line Testing Symposium, 16–21.
   Google Scholar
• Mathew, J., Jabir, A. M., Rahaman, H., & Pradhan, D. K. (2009). Single error correctable bit parallel multipliers over GF(2m). IET Computers & Digital Techniques, 3(3), 281–288.
   Web of Science ®Google Scholar
• Nabaa, G., & Najm, F. N. (2005). ‘Minimization of delay sensitivity to process induced voltage threshold variations’. http://www.eecg.toronto.edu/~najm/papers/newcas05-georges.pdf
   Google Scholar
• Pionteck, T., Staake, T., Stiefmeier, T., Kabulepa, L.D., & Geisner, M. (2004). ‘Design of a re-configurable AES encryption/decryption engine for mobile terminals’, Proc. 2004 Symposium on Circuits and Systems-ISCAS 04, 2, 545–548.
   Google Scholar
• Rahaman, H., Mathew, J., Jabir, A.M., & Pradhan, D.K. (2010). Simplified bit parallel systolic multipliers for special class of galois field (2m)with testability. IET Computers & Digital Techniques, 4(5), 428–437.
   Web of Science ®Google Scholar
• Rahaman, H., Mathew, J., Jabir, A. M., & Pradhan, D. K. (2012). ‘VLSI architecture for bit parallel systolic multipliers for special class of GF(2^m) using dual bases’, VDAT 2012, Shibpur, India, 258–269.
   Google Scholar
• Slind, K. (2003). ‘A verification of AES’. http://www.cs.utah.edu.~slindpapersaes.html
   Google Scholar
• Sunar, B., & Koc, C. K. (2001). An efficient optimal normal basis type II multiplier. IEEE Transactions on Computers, 50, 83–87.
   Web of Science ®Google Scholar
• Wang, C. C., & Pei, D. (1990). A VLSI design for computing exponentiations in and its application to generate pseudorandom number sequences. IEEE Transactions on Computer, 39, 258–262.
   Web of Science ®Google Scholar
• Wicker, S. B. (1996). Error Control Systems for Digital Communication and Storage. Upper Saddle River, NJ: Prentice-Hall.
   Google Scholar
• Yoo, S. M., Kotturi, D., Pan, D.W., & Blizzard, J. (2005). An AES crypto chip using a high-speed parallel pipelined architecture. Microprocessors ad Microsystems, 29, 317–326.
   Web of Science ®Google Scholar