Checking before output may not be enough against fault-based cryptanalysis
From MaRDI portal
Publication:3417029
DOI10.1109/12.869328zbMath1300.94101MaRDI QIDQ3417029
Publication date: 9 January 2007
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5be314fb30d315d7e85229c9a4fe6794508bd040
94A60: Cryptography
Related Items
A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA), Fault Analysis Study of IDEA, Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates, DEFAULT: cipher level resistance against differential fault attack, A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding, Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm, New fault attacks using Jacobi symbol and application to regular right-to-left algorithms, Polar differential power attacks and evaluation, Complete reverse-engineering of AES-like block ciphers by SCARE and FIRE attacks, Error detection and error correction procedures for the advanced encryption standard, Fault attacks on nonce-based authenticated encryption: application to Keyak and Ketje, Fault template attacks on block ciphers exploiting fault propagation, Security of hedged Fiat-Shamir signatures under fault attacks, \textsf{Transform} without \textsf{encode} is not sufficient for SIFA and FTA security: a case study, Safe-error attacks on SIKE and CSIDH, Statistical Fault Attacks on Nonce-Based Authenticated Encryption Schemes, Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation, Binary Huff Curves, Square Always Exponentiation, Preventing Fault Attacks Using Fault Randomization with a Case Study on AES, Securing RSA against Fault Analysis by Double Addition Chain Exponentiation, Exponent Recoding and Regular Exponentiation Algorithms
