DocumentCode :
3245520
Title :
A Residue Approach of the Finite Fields Arithmetics
Author :
Bajard, Jean Claude
Author_Institution :
Univ. Montpellier 2, Montpellier
fYear :
2007
fDate :
4-7 Nov. 2007
Firstpage :
358
Lastpage :
362
Abstract :
Finite fields arithmetic is one of the challenges in current computer arithmetic. It occurs, in particular, in cryptography where the needs increase with the evolution of the technologies and also of the attacks. Through our research, we have proposed different systems based on residues representations. Different kinds of finite fields are concerned with. For each of them, some specificities of the representations are exploited to ensure the efficiency, as well as for the performances, than for the robustness to side channel attacks. In this paper, we deal with three similar approaches: the first one is dedicated to prime field using residue number systems, a second one concerns extension finite fields of characteristic two, the last one discusses of medium characteristic finite fields. The main interest of these systems is their inherent modularity, well suited for circuit implementations.
Keywords :
cryptography; residue number systems; cryptography; finite field arithmetics; residue number systems; residue representations; side channel attacks; Circuits; Computer science; Cryptography; Digital arithmetic; Galois fields; Interpolation; Lagrangian functions; Polynomials; Robustness; Sun;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signals, Systems and Computers, 2007. ACSSC 2007. Conference Record of the Forty-First Asilomar Conference on
Conference_Location :
Pacific Grove, CA
ISSN :
1058-6393
Print_ISBN :
978-1-4244-2109-1
Electronic_ISBN :
1058-6393
Type :
conf
DOI :
10.1109/ACSSC.2007.4487229
Filename :
4487229
Link To Document :
بازگشت