Multi-precision squaring for public-key cryptography on embedded microprocessors
From MaRDI portal
Publication:2872055
DOI10.1007/978-3-319-03515-4_15zbMATH Open1295.94143OpenAlexW1490200949MaRDI QIDQ2872055FDOQ2872055
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
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)
- High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
- A low-complexity LUT-based squaring algorithm
- The combinatorics of product scanning multiplication and squaring
- Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
- Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
- Title not available (Why is that?)
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)