References
- B. Schneier, "Foundations", in Applied Cryptography, London, UK: John Wiley & Sons Inc., 1996.
- FIPS PUB 46-3, Data Encryption Standard (DES), NIST, Springfield, VA, USA, 1977.
- FIPS PUB 197, Advanced Encryption Standard (AES), NIST, Springfield, VA, USA, 2001.
- N. Koblitz, "Elliptic Curve Cryptosystems," Math. Comput., vol. 48, 1987, pp. 203-209. https://doi.org/10.1090/S0025-5718-1987-0866109-5
- V.S. Miller, "Use of Elliptic Curves in Cryptography," Proc. Adv. Cryptology-Crypto, CA, USA, Aug. 18-22, 1986, pp. 417-426.
- R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Commun. ACM, vol. 21, no. 2, Feb. 1978, pp. 120-126. https://doi.org/10.1145/359340.359342
-
T.C. Chen, S.W. Wei, and H.J. Tsai, "Arithmetic Unit for Finite Field GF(
$2^m$ )," IEEE Trans. Circuits Syst. I, vol. 55, no. 3, Apr. 2008, pp. 828-837. https://doi.org/10.1109/TCSI.2008.919757 - S. Roman, Field Theory, New York, USA: Springer, 2006.
- M. Wang and I.F. Blake, "Bit Serial Multiplication in Finite Fields," SIAM J. Discrete Math., vol. 3, no. 1, 1990, pp. 140-148. https://doi.org/10.1137/0403012
- H. Wu, "Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis," Int. Workshop Cryptograph. Hardw. Embedded Syst., Worcester, MA, USA, Aug. 12-13, 1999, pp. 280-291.
- L. Song and K.K. Parhi, "Low-Energy Digit-Serial/Parallel Finite Field Multipliers," J. VLSI Signal Process. Syst., Signal, Image Video Technol., vol. 19, no. 2, July 1998, pp. 149-166. https://doi.org/10.1023/A:1008013818413
-
S.W. Wei, "A Systolic Power-Sum Circuit for GF (
$2^m$ )," IEEE Trans. Comput., vol. 43, no. 2, Feb. 1994, pp. 226- 229. https://doi.org/10.1109/12.262128 - L. Song and K.K. Parhi, "Optimum Primitive Polynomials for Low-Area Low-Power Finite Field Semi-systolic Multipliers," IEEE Workshop Signal Process. Syst. SIPS 97-Des. Implement., Leicester, UK, Nov. 5, 1997, pp. 375- 384.
-
H. Ho, "Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(
$2^m$ )," J. Signal Process. Syst., vol. 75, no. 3, 2014, pp. 203-208. https://doi.org/10.1007/s11265-013-0791-x -
J.H. Guo and C.L. Wang, "Digit-Serial Systolic Multiplier for Finite Fields GF(
$2^m$ )," IEE Proc.-Comput. Digital Techn., vol. 145, no. 2, Mar. 1998, pp. 143- 148. https://doi.org/10.1049/ip-cdt:19981906 -
C.S. Yeh, I.S. Reed, and T.K. Truong, "Systolic Multipliers for Finite Fields GF(
$2^m$ )," IEEE Trans. Comput., vol. C-33, no. 4, Apr. 1984, pp. 357-360. https://doi.org/10.1109/TC.1984.1676441 -
C.L. Wang and J.L. Lin, "Systolic Array Implementation of Multipliers for Finite Fields GF(
$2^m$ )," IEEE Trans. Circuits Syst., vol. 38, no. 7, 1991, pp. 796-800. https://doi.org/10.1109/31.135751 - C.-W. Wu and M.-K. Chang, "Bit-Level Systolic Arrays for Finite-Field Multiplications," J. VLSI Signal Process. Syst., vol. 10, no. 1, June 1995, pp. 85-92. https://doi.org/10.1007/BF02407028
-
S.K. Jain and K.K. Parhi, "Low Latency Standard Basis GF (
$2^m$ ) Multiplier and Squarer Architectures," Int. Conf. Acoustics, Speech, Signal Process., Detroit, MI, USA, May 9-12, 1995, pp. 2747-2750. - S.K. Jain, L. Song, and K.K. Parhi, "Efficient Semisystolic Architectures for Finite-Field Arithmetic," IEEE Trans, Very Large Scale Integr. Syst., vol. 6, no. 1, Mar. 1998, pp. 101-113. https://doi.org/10.1109/92.661252
-
C.K. Koc and T. Acar, "Montgomery Multiplication in GF (
$2^k$ )," Des., Codes Cryptography, vol. 14, no. 1, Apr. 1998, pp. 57-69. https://doi.org/10.1023/A:1008208521515 -
S. Kwon, C.H. Kim, and C.P. Hong, "A Systolic Multiplier with LSB First Algorithm Over GF(
$2^m$ ) Which is as Efficient as the One with MSB First Algorithm," Int. Symp. Circuits Syst., Bangkok, Thailand, May 25-28, 2003, pp. V-633-V-636. - C.Y. Lee, Y.H. Chiu, and C.W. Chiou, "New Bit-Parallel Systolic Multiplier over GF(2m) Using the Modified Booth's Algorithm," IEEE Asia Pacific Conf. Circuits Syst., Singapore, Dec. 4-7, 2006, pp. 610-613.
- S. Kwon, C.H. Kim, and C.P. Hong, "Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2m) Using LSB First Algorithm," Int. Workshop Fuzzy Logic Applicat., Crema, Italy, Sept. 2005, pp. 420-426.
-
C.W. Chiou et al., "Efficient VLSI Implementation for Montgomery Multiplication in GF(
$2^m$ )," Tamkang J. Sci. Technol., vol. 9, no. 4, Apr. 2006, pp. 365-372. -
C.Y. Lee et al., "Low-Complexity Bit-Parallel Systolic Multipliers Over GF(
$2^m$ )," IEEE Conf. Syst., Man, Cybernetics, Taipei, Taiwan, Oct. 8-11, 2006, pp. 1-6. - C.W. Chiou, C.Y. Lee, and J.M. Lin, "Finite Field Polynomial Multiplier with Linear Feedback Shift Register," Tamkang J. Sci. Technol., vol. 10, no. 3, 2007, pp. 253-264.
-
C.Y. Lee, "Low-Complexity Bit-Parallel Systolic Multipliers Over GF (
$2^m$ )," Integr., VLSI J., vol. 41, no. 1, Jan. 2008, pp. 106-112. https://doi.org/10.1016/j.vlsi.2007.05.001 -
C.Y. Lee, "Multiplexer-Based Bit-Parallel Systolic Multipliers Over GF(
$2^m$ )," Comput. Electr. Eng., vol. 34, no. 5, Sept. 2008, pp. 392-405. https://doi.org/10.1016/j.compeleceng.2007.09.004 -
A.P. Fournaris and O. Koufopavlou, "Versatile Multiplier Architectures in GF(
$2^k$ ) Fields Using the MONTGOMERY Multiplication Algorithm," Integr., VLSI J., vol. 41, no. 3, May 2008, pp. 371-384. https://doi.org/10.1016/j.vlsi.2007.07.004 -
S. Kwon, C.H. Kim, and C.P. Hong, "More Efficient Systolic Arrays for Multiplication in GF(
$2^m$ ) Using LSB First Algorithm with Irreducible Polynomials and Trinomials," Comput. Electr. Eng., vol. 35, no. 1, Jan. 2009, pp. 159-167. https://doi.org/10.1016/j.compeleceng.2008.09.009 - K.W. Kim and J.C. Jeon, "Polynomial Basis Multiplier Using Cellular Systolic Architecture," IETE J. Res., vol. 60, no. 2, 2014, pp. 194-199. https://doi.org/10.1080/03772063.2014.914699
- S.E. Mathe and L. Boppana, "Efficient Bit-Parallel Systolic Polynomial Basis Multiplier over GF(28) based on Irreducible Polynomials." Indian J. Sci. Technol., vol. 9, no. S1, 2016, pp. 1-6.
-
S.S. Erdem, T. Yanik, and C.K. Koc, "Polynomial Basis Multiplication oVer GF(
$2^m$ )," Acta Applicandae Math., vol. 93, no. 1, Sept. 2006, pp. 33-55. https://doi.org/10.1007/s10440-006-9047-0 - F. Rodriguez-Henriquez et al., "Binary Finite Field Arithmetic", in Cryptographic Algorithms on Reconfigurable Hardware. New York, USA; Springer, 2007, pp. 139-188.
Cited by
- Systolic array multiplier for augmenting data center networks communication link vol.22, pp.6, 2017, https://doi.org/10.1007/s10586-018-2092-4