Montgomery exponent architecture based on programmable cellular automata

DOI10.1016/J.MATCOM.2007.09.005MaRDI QIDQ1010043zbMATH OpenOpenAlexFDO

Authors Jun-Cheol Jeon, Kee-Young Yoo

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

irreducible polynomialmodular exponentiationMontgomery multiplicationprogrammable cellular automatapublic-key cryptosystem

Mathematics Subject Classification ID

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

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 2089179
• Programmable cellular automata based Montgomery hardware architecture
• Fast Exponentiaion over GF(2m) Based on Cellular Automata
• scientific article; zbMATH DE number 1983211

Cites work

• scientific article; zbMATH DE number 954401 (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)\)
• Structure of parallel multipliers for a class of fields GF(2^ m)

Cited in

(5)

• Revisiting the 7/23 train accident using computer reconstruction simulation for causation and prevention analysis
• scientific article; zbMATH DE number 2089179 (Why is no real title available?)
• Fast Exponentiaion over GF(2m) Based on Cellular Automata
• Computational Science and Its Applications – ICCSA 2004
• Programmable cellular automata based Montgomery hardware architecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010043)