Montgomery exponent architecture based on programmable cellular automata

DOI10.1016/J.MATCOM.2007.09.005zbMath1280.94072OpenAlexW2040584359MaRDI QIDQ1010043

Kee-Young Yoo, Jun-Cheol Jeon

Publication date: 3 April 2009

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2007.09.005

zbMATH Keywords

modular exponentiationirreducible polynomialpublic-key cryptosystemMontgomery multiplicationprogrammable cellular automata

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80)

Related Items (1)

Revisiting the 7/23 train accident using computer reconstruction simulation for causation and prevention analysis

Cites Work

• Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Modular Multiplication Without Trial Division
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• Unnamed Item

This page was built for publication: Montgomery exponent architecture based on programmable cellular automata