Subtraction-free almost Montgomery inverse algorithm

DOI10.1016/J.IPL.2004.12.012zbMath1182.68085OpenAlexW2035146829MaRDI QIDQ1041714

Josef Hlaváč, Róbert Lórencz

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.012

zbMATH Keywords

cryptographyfinite field arithmeticalmost montgomery inverse algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Elliptic Curve Cryptosystems
• High-radix and bit recoding techniques for modular exponentiation
• The Montgomery inverse and its applications
• The Montgomery modular inverse-revisited

This page was built for publication: Subtraction-free almost Montgomery inverse algorithm