The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2011 vol.60)
pp: 1341-1353
Arash Hariri , The University of Western Ontario, London
Arash Reyhani-Masoleh , The University of Western Ontario, London
ABSTRACT
Multiplication is one of the most important operations in finite field arithmetic. It is used in cryptographic and coding applications, such as elliptic curve cryptography and Reed-Solomon codes. In this paper, we consider the finite field multiplication used in elliptic curve cryptography and design concurrent error detection circuits. It is shown in the literature that the Montgomery multiplication can be used in cryptography to accelerate the scalar multiplication. Here, we use a parity-based concurrent error detection approach to increase the reliability of different Montgomery multipliers available in the literature. First, we consider bit-serial Montgomery multiplication and propose an error detection circuit. Then, we apply the same technique on the digit-serial Montgomery multiplication. Finally, we consider low time-complexity bit-parallel Montgomery multiplication and design the required components to implement the concurrent error detection circuits. ASIC implementations have been completed to analyze the time and area overheads of the proposed schemes. Also, the error detection capability is investigated by software simulations. We show that our approach results in efficient error detection schemes with small time and area overheads.
INDEX TERMS
Montgomery multiplication, concurrent error detection, finite fields, elliptic curve cryptography.
CITATION
Arash Hariri, Arash Reyhani-Masoleh, "Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields", IEEE Transactions on Computers, vol.60, no. 9, pp. 1341-1353, September 2011, doi:10.1109/TC.2010.258
REFERENCES
[1] V.S. Miller, “Use of Elliptic Curves in Cryptography,” Proc. Advances in Cryptology-CRYPTO 85, pp. 417-426, 1986.
[2] N. Koblitz, “Elliptic Curve Cryptosystems,” Math. of Computation, vol. 48, no. 177, pp. 203-209, 1987.
[3] E.D. Mastrovito, VLSI Architectures for Computation in Galois Fields, PhD thesis, Linkoping Univ., 1991.
[4] L. Song and K. Parhi, “Low-Energy Digit-Serial/Parallel Finite Field Multipliers,” The J. VLSI Signal Processing, vol. 19, no. 2, pp. 149-166, 1998.
[5] A. Reyhani-Masoleh and M. Hasan, “Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over $GF (2^m)$ ,” IEEE Trans. Computers, vol. 53, no. 8, pp. 945-959, Aug. 2004.
[6] F. Rodriguez-Henriguez and C. Koc, “Parallel Multipliers Based on Special Irreducible Pentanomials,” IEEE Trans. Computers, vol. 52, no. 12, pp. 1535-1542, Dec. 2003.
[7] C. Koc and T. Acar, “Montgomery Multiplication in $GF(2^k)$ ,” Designs, Codes and Cryptography, vol. 14, no. 1, pp. 57-69, 1998.
[8] H. Fan and Y. Dai, “Fast Bit-Parallel $GF(2^n)$ Multiplier for All Trinomials,” IEEE Trans. Computers, vol. 54, no. 4, pp. 485-490, Apr. 2005.
[9] J. Massey and J. Omura, “Computational Method and Apparatus for Finite Field Arithmetic,” US Patent 4,587,627. 1986.
[10] H. Wu, M. Hasan, and I. Blake, “New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases,” IEEE Trans. Computers, vol. 47, no. 11, pp. 1223-1234, Nov. 1998.
[11] T. Beth and D. Gollman, “Algorithm Engineering for Public Key Algorithms,” IEEE J. Selected Areas in Communications, vol. 7, no. 4, pp. 458-466, May 1989.
[12] P. Montgomery, “Modular Multiplication without Trial Division,” Math. of Computation, vol. 44, no. 170, pp. 519-521, 1985.
[13] H. Wu, “Montgomery Multiplier and Squarer for a Class of Finite Fields,” IEEE Trans. Computers, vol. 51, no. 5, pp. 521-529, May 2002.
[14] L. Batina, N. Mentens, B. Preneel, and I. Verbauwhede, “Balanced Point Operations for Side-Channel Protection of Elliptic Curve Cryptography,” IEEE Proc. Information Security, vol. 152, no. 1, pp. 57-65, Oct. 2005.
[15] A. Hariri and A. Reyhani-Masoleh, “Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over $GF(2^m)$ ,” IEEE Trans. Computers, vol. 58, no. 10, pp. 1332-1345, Oct. 2009.
[16] K. Sakiyama, L. Batina, B. Preneel, and I. Verbauwhede, “High-Performance Public-Key Cryptoprocessor for Wireless Mobile Applications,” Mobile Networks and Applications, vol. 12, no. 4, pp. 245-258, 2007.
[17] S. Mitra and E. McCluskey, “Which Concurrent Error Detection Scheme to Choose?” Proc. Int'l Test Conf., pp. 985-994, 2000.
[18] I. Koren and C.M. Krishna, Fault-Tolerant Systems. Morgan Kaufman, 2007.
[19] Residue Number System Arithmetic: Modern Applications in Digital Signal Processing, M. A. Soderstrand, W. K. Jenkins, G. A. Jullien, and F. J. Taylor, eds., IEEE Press, 1986.
[20] C. Giraud and H. Thiebeauld, “A Survey on Fault Attacks,” Proc. Smart Card Research and Advanced Applications VI, pp. 159-176, 2004.
[21] H. Bar-El, H. Choukri, D. Naccache, M. Tunstall, and C. Whelan, “The Sorcerer's Apprentice Guide to Fault Attacks,” Proc. IEEE, vol. 94, no. 2, pp. 370-382, Feb. 2006.
[22] S. Fenn, M. Gossel, M. Benaissa, and D. Taylor, “On-Line Error Detection for Bit-Serial Multipliers in $GF(2^m)$ ,” J. Electronic Testing: Theory and Applications, vol. 13, no. 1, pp. 29-40, 1998.
[23] A. Reyhani-Masoleh and M. Hasan, “Fault Detection Architectures for Field Multiplication Using Polynomial Bases,” IEEE Trans. Computers, vol. 55, no. 9, pp. 1089-1103, Sept. 2006.
[24] S. Bayat-Sarmadi and M. Hasan, “On Concurrent Detection of Errors in Polynomial Basis Multiplication,” IEEE Trans. Very Large Scale Integration Systems, vol. 15, no. 4, pp. 413-426, Apr. 2007.
[25] W. Chelton and M. Benaissa, “Concurrent Error Detection in $GF(2^m)$ Multiplication and Its Application in Elliptic Curve Cryptography,” IET Circuits, Devices and Systems, vol. 2, no. 3, pp. 289-297, 2008.
[26] S. Bayat-Sarmadi and M. Hasan, “Concurrent Error Detection in Finite Field Arithmetic Operations Using Pipelined and Systolic Architectures,” IEEE Trans. Computers, vol. 58, no. 11, pp. 1553-1567, Nov. 2009.
[27] C.W. Chiou, C.-C. Chang, C.-Y. Lee, T.-W. Hou, and J.-M. Lin, “Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier Over $GF(2^m)$ ,” IEEE Trans. Computers, vol. 58, no. 6, pp. 851-857, June 2009.
[28] C.-Y. Lee, C.W. Chiou, and J.-M. Lin, “Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of $GF(2^m)$ ,” J. Electronic Testing: Theory and Applications, vol. 21, no. 5, pp. 539-549, 2005.
[29] C.-Y. Lee, C.W. Chiou, and J.-M. Lin, “Concurrent Error Detection in a Polynomial Basis Multiplier over $GF(2^m)$ ,” J. Electronic Testing: Theory and Applications, vol. 22, no. 2, pp. 143-150, 2006.
[30] C.W. Chiou, C.Y. Lee, A.W. Deng, and J.M. Lin, “Concurrent Error Detection in Montgomery Multiplication over $GF (2^m)$ ,” IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, vol. E89-A, no. 2, pp. 566-574, 2006.
[31] A. Hariri and A. Reyhani-Masoleh, “Fault Detection Structures for the Montgomery Multiplication over Binary Extension Fields,” Proc. Workshop Fault Diagnosis and Tolerance in Cryptography (FDTC), pp. 37-46, 2007.
[32] Recommended Elliptic Curves for Fed. Gov. Use http://csrc.nist.gov/groups/ST/toolkit/documents/ dssNISTReCur. pdf, 2009.
[33] A. Hariri and A. Reyhani-Masoleh, “Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields,” Proc. Second Int'l Workshop Arithmetic of Finite Fields (WAIFI), pp. 103-116, 2008.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool