Montgomery exponent architecture based on programmable cellular automata
From MaRDI portal
Publication:1010043
DOI10.1016/J.MATCOM.2007.09.005zbMath1280.94072OpenAlexW2040584359MaRDI QIDQ1010043
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
modular exponentiationirreducible polynomialpublic-key cryptosystemMontgomery multiplicationprogrammable cellular automata
Related Items (1)
Cites Work
This page was built for publication: Montgomery exponent architecture based on programmable cellular automata