Montgomery exponent architecture based on programmable cellular automata
From MaRDI portal
Publication:1010043
DOI10.1016/j.matcom.2007.09.005zbMath1280.94072MaRDI 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 exponentiation; irreducible polynomial; public-key cryptosystem; Montgomery multiplication; programmable cellular automata
Related Items
Cites Work