• Efficient modular division imp...

Treffer: Efficient modular division implementation: ECC over GF(p) affine coordinates application

Title:
Efficient modular division implementation: ECC over GF(p) affine coordinates application
Authors:
MEURICE DE DORMALE, Guerric, BULENS, Philippe, QUISQUATER, Jean-Jacques
Source:
FPL 2004 : field-programmable logic and applications (Antwerp, 30 August - 1 September 2004)Lecture notes in computer science. :231-240
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Traitement des langages et microprogrammation, Language processing and microprogramming, Electronique, Electronics, Electronique des semiconducteurs. Microélectronique. Optoélectronique. Dispositifs à l'état solide, Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices, Circuits intégrés, Integrated circuits, Circuits intégrés par fonction (dont mémoires et processeurs), Integrated circuits by function (including memories and processors), Architecture reconfigurable, Reconfigurable architectures, Clé publique, Public key, Llave pública, Conception circuit, Circuit design, Diseño circuito, Courbe elliptique, Elliptic curve, Curva eliptica, Cryptage RSA, RSA ciphering, Cifrado RSA, Cryptographie clé publique, Public key cryptography, Diviseur, Divider, Divisor, Equipement ménager, Domestic appliances, Equipo doméstico, Inversion, Inversión, Largeur bande, Bandwidth, Anchura banda, Réseau porte programmable, Field programmable gate array, Red puerta programable, Soustraction, Subtraction, Sustracción, Système coordonnée, Coordinate system, Sistema coordenadas
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Université Catholique de Louvain, UCL Crypto Group, Laboratoire de Microélectronique (DICE), Place du Levant 3, 1348 Louvain-La-Neuve, Belgium
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16107589
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Electronics
Accession Number:
edscal.16107589
Database:
PASCAL Archive

Weitere Informationen

Elliptic Curve Public Key Cryptosystems (ECPKC) are becoming increasingly popular for use in mobile appliances where bandwidth and chip area are strongly constrained. For the same level of security, ECPKC use much smaller key length than the commonly used RSA. The underlying operation of affine coordinates elliptic curve point multiplication requires modular multiplication, division/inversion and addition/substraction. To avoid the critical division/inversion operation, other coordinate systems may be chosen, but this implies more operations and a strong increase in memory requirements. So, in area and memory constrained devices, affine coordinates should be preferred, especially over GF(p). This paper presents a powerful reconfigurable hardware implementation of the Takagi modular divider algorithm. Resulting 256-bit circuits achieved a ratio throughput/area improved by at least 900 % of the only known design in Xilinx Virtex-E technology. Comparison with typical modular multiplication performance is carried out to suggest the use of affine coordinates also for speed reason.