On the importance of eliminating errors in cryptographic computations
From MaRDI portal
Publication:5934142
DOI10.1007/s001450010016zbMath1018.94014OpenAlexW2066425771WikidataQ127452576 ScholiaQ127452576MaRDI QIDQ5934142
Dan Boneh, Richard J. Lipton, Richard A. DeMillo
Publication date: 26 August 2003
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001450010016
Related Items (32)
Witness Maps and Applications ⋮ A note on perfect correctness by derandomization ⋮ Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions ⋮ The Chaining Lemma and Its Application ⋮ The random oracle model: a twenty-year retrospective ⋮ Fault attacks on hyperelliptic curve discrete logarithm problem over binary field ⋮ Analysis of the fault attack ECDLP over prime field ⋮ Fault Attacks on Public Key Elements: Application to DLP-Based Schemes ⋮ Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates ⋮ Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) ⋮ A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack ⋮ Physical attacks and beyond ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ Continuously non-malleable codes in the split-state model ⋮ Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems ⋮ Glitch and laser fault attacks onto a secure AES implementation on a SRAM-based FPGA ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ A Fault Attack on the LED Block Cipher ⋮ Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Elliptic curve cryptosystems in the presence of permanent and transient faults ⋮ Protecting ECC against fault attacks: the ring extension method revisited ⋮ Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ An Improved Fault Based Attack of the Advanced Encryption Standard ⋮ Fault based attack of the Rijndael cryptosystem ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Partial Key Exposure: Generalized Framework to Attack RSA ⋮ Thwarting side-channel analysis against RSA cryptosystems with additive blinding ⋮ Perturbating RSA Public Keys: An Improved Attack ⋮ A Note on Perfect Correctness by Derandomization ⋮ Revisiting prime power RSA
This page was built for publication: On the importance of eliminating errors in cryptographic computations
