Programmable cellular automata based Montgomery hardware architecture

DOI10.1016/J.AMC.2006.08.018zbMATH Open1115.68009OpenAlexW2030250902MaRDI QIDQ876683FDOQ876683

Authors: Jun-Cheol Jeon, Kee-Young Yoo 

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

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
• scientific article; zbMATH DE number 2089179
• scientific article; zbMATH DE number 2079919

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

• Title not available (Why is that?)
• Modular Multiplication Without Trial Division
• Title not available (Why is that?)
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Montgomery multiplier and squarer for a class of finite fields
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• Title not available (Why is that?)

Cited In (4)

• Programmable cellular automata (PCA) based advanced encryption standard (AES) hardware architecture
• Montgomery exponent architecture based on programmable cellular automata
• Title not available (Why is that?)
• 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)