Multi-precision squaring for public-key cryptography on embedded microprocessors

DOI10.1007/978-3-319-03515-4_15MaRDI QIDQ2872055zbMATH OpenOpenAlexFDO

Authors Hwajeong Seo, Zhe Liu, Jongseok Choi, Howon Kim

Publication date 14 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://orbilu.uni.lu/handle/10993/12935

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
• Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
• Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
• A low-complexity LUT-based squaring algorithm
• Square always exponentiation

Cited in

(6)

• Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
• Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
• High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
• A low-complexity LUT-based squaring algorithm
• scientific article; zbMATH DE number 1759646 (Why is no real title available?)
• The combinatorics of product scanning multiplication and squaring

This page was built for publication: Multi-precision squaring for public-key cryptography on embedded microprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872055)