Programmable cellular automata based Montgomery hardware architecture
From MaRDI portal
Recommendations
- Montgomery exponent architecture based on programmable cellular automata
- An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
- Modular Divider for Elliptic Curve Cryptographic Hardware Based on Programmable CA
- New parallel architecture for modular multiplication and squaring based on cellular automata
- Montgomery in practice: How to do it more efficiently in hardware
Cites work
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Modular Multiplication Without Trial Division
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- Montgomery multiplier and squarer for a class of finite fields
- Montgomery multiplier and squarer in \(\text{GF}(2^m)\)
Cited in
(4)- Montgomery exponent architecture based on programmable cellular automata
- scientific article; zbMATH DE number 5360745 (Why is no real title available?)
- Programmable cellular automata (PCA) based advanced encryption standard (AES) hardware architecture
- Modular Divider for Elliptic Curve Cryptographic Hardware Based on Programmable CA
This page was built for publication: Programmable cellular automata based Montgomery hardware architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876683)