Constructive and destructive use of compilers in elliptic curve cryptography
From MaRDI portal
Publication:1015356
DOI10.1007/s00145-008-9023-0zbMath1159.94357OpenAlexW2024490197WikidataQ122958638 ScholiaQ122958638MaRDI QIDQ1015356
Publication date: 8 May 2009
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/19434
Related Items (1)
Uses Software
Cites Work
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Hyperelliptic cryptosystems
- Modular Multiplication Without Trial Division
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Elliptic Curve Cryptosystems
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Cryptography and Coding
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructive and destructive use of compilers in elliptic curve cryptography