Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications

Article Properties
Cite
Paul, Bikram, et al. “Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications”. IEEE Transactions on Computers, vol. 72, no. 6, 2023, pp. 1581-94, https://doi.org/10.1109/tc.2022.3215638.
Paul, B., Nath, A., Krishnaswamy, S., Pidanic, J., Nemec, Z., & Trivedi, G. (2023). Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications. IEEE Transactions on Computers, 72(6), 1581-1594. https://doi.org/10.1109/tc.2022.3215638
Paul B, Nath A, Krishnaswamy S, Pidanic J, Nemec Z, Trivedi G. Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications. IEEE Transactions on Computers. 2023;72(6):1581-94.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electric apparatus and materials
Electric circuits
Electric networks
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
Title Journal Journal Categories Citations Publication Date
Low space‐complexity digit‐serial dual basis systolic multiplier over Galois field GF(2 m ) using Hankel matrix and Karatsuba algorithm IET Information Security
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
19 2013
Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials IEEE Transactions on Computers
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
56 2001
A novel digit-serial dual basis systolic karatsuba multiplier over $GF(2^{m})$GF(2m) 2012
Scalable and systolic dual basis multiplier over $GF(2^{m})$GF(2m) 2011
Low-complexity dual basis digit serial $GF(2^{m})$GF(2m) multiplier 2009