Programmable cellular automata based Montgomery hardware architecture

DOI10.1016/J.AMC.2006.08.018zbMath1115.68009OpenAlexW2030250902MaRDI QIDQ876683

Kee-Young Yoo, Jun-Cheol Jeon

Publication date: 26 April 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.018

zbMATH Keywords

Reed-Solomon codeMontgomery algorithmirreducible all one polynomialmultiplication and squaringprogrammable cellular automata

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Cellular automata (computational aspects) (68Q80) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Montgomery multiplier and squarer for a class of finite fields

This page was built for publication: Programmable cellular automata based Montgomery hardware architecture