Pages that link to "Item:Q1379662"
From MaRDI portal
The following pages link to Montgomery multiplication in \(\text{GF}(2^ k)\) (Q1379662):
Displaying 16 items.
- Montgomery multiplication over rings (Q468150) (← links)
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (Q765476) (← links)
- An iterative modular multiplication algorithm in RNS (Q814756) (← links)
- Polynomial basis multiplication over \(\text{GF}(2^m)\) (Q850783) (← links)
- Programmable cellular automata based Montgomery hardware architecture (Q876683) (← links)
- Montgomery exponent architecture based on programmable cellular automata (Q1010043) (← links)
- Rings of low multiplicative complexity (Q1570228) (← links)
- Communication-computation trade-off in executing ECDSA in a contactless smartcard (Q2491280) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) (Q3511179) (← links)
- Modular Reduction in GF(2 n ) without Pre-computational Phase (Q3519553) (← links)
- Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields (Q3519555) (← links)
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering (Q3644213) (← links)
- Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields (Q4932751) (← links)
- $\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms (Q5444320) (← links)