Montgomery multiplication in \(\text{GF}(2^ k)\)
From MaRDI portal
Publication:1379662
DOI10.1023/A:1008208521515zbMath0887.11054MaRDI QIDQ1379662
Publication date: 10 May 1998
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008208521515
68Q25: Analysis of algorithms and problem complexity
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields, $\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms, Montgomery multiplication over rings, Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm, An iterative modular multiplication algorithm in RNS, Polynomial basis multiplication over \(\text{GF}(2^m)\), Programmable cellular automata based Montgomery hardware architecture, Montgomery exponent architecture based on programmable cellular automata, Rings of low multiplicative complexity, Communication-computation trade-off in executing ECDSA in a contactless smartcard, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity, Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ), Modular Reduction in GF(2 n ) without Pre-computational Phase, Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields, Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
