Non-linear residue codes for robust public-key arithmetic

Authors:
Gunnar Gaubatz;Berk Sunar;Mark G. Karpovsky
Affiliations:
Cryptography & Information Security Laboratory, Worcester Polytechnic Institute, Massachusetts;Cryptography & Information Security Laboratory, Worcester Polytechnic Institute, Massachusetts;Reliable Computing Laboratory, Boston University, Masachusetts
Venue:
FDTC'06 Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
Year:
2006

Citing 8
Cited 7

Fault-tolerant computing: theory and techniques; vol. 1

Fault-tolerant computing: theory and techniques; vol. 1
Checking Before Output May Not Be Enough Against Fault-Based Cryptanalysis

IEEE Transactions on Computers
Analyzing and Comparing Montgomery Multiplication Algorithms

IEEE Micro
A new CRT-RSA algorithm secure against bellcore attacks

Proceedings of the 10th ACM conference on Computer and communications security
Robust Protection against Fault-Injection Attacks on Smart Cards Implementing the Advanced Encryption Standard

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Cryptanalysis of a provably secure CRT-RSA algorithm

Proceedings of the 11th ACM conference on Computer and communications security
Tamper resistance: a cautionary note

WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
New class of nonlinear systematic error detecting codes

IEEE Transactions on Information Theory

Novel PUF-Based Error Detection Methods in Finite State Machines

Information Security and Cryptology --- ICISC 2008
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Design and implementation of robust embedded processor for cryptographic applications

Proceedings of the 3rd international conference on Security of information and networks
Design of Memories with Concurrent Error Detection and Correction by Nonlinear SEC-DED Codes

Journal of Electronic Testing: Theory and Applications
Design of reliable and secure multipliers by multilinear arithmetic codes

ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Secure multipliers resilient to strong fault-injection attacks using multilinear arithmetic codes

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Attacks on implementations of cryptographic algorithms: side-channel and fault attacks

Proceedings of the 6th International Conference on Security of Information and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very high probability of detecting arbitrary errors of any weight. Our scheme lends itself well for straightforward implementation of standard modular multiplication techniques, i.e. Montgomery or Barrett Multiplication, secure against active fault injection attacks. Due to the non-linearity of the code the probability of detecting an error does not only depend on the error pattern, but also on the data. Since the latter is not usually known to the adversary a priori, a successful injection of an undetected error is highly unlikely. We give a proof of the robustness of these codes by providing an upper bound on the number of undetectable errors.