Treffer: Montgomery scalar multiplication for genus 2 curves
Title:
Montgomery scalar multiplication for genus 2 curves
Authors:
Source:
ANTS - VI : algorithmic number theory (Burlington VT, 13-18 June 2004)Lecture notes in computer science. :153-168
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 28 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Algèbre, Algebra, Théorie des nombres, Number theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Algorithme compétitif, Competitive algorithms, Carte à puce, Smart cards, Courbe elliptique, Elliptic curve, Curva eliptica, Cryptanalyse, Cryptanalysis, Criptoanálisis, Cryptographie, Cryptography, Criptografía, Matrice Jacobi, Jacobi matrix, Matriz Jacobi, Multiplication, Multiplicación, Courbe hyperelliptique, Hyperelliptic curve, Curvo elíptico, Multiplicateur Montgomery, Montgomery multiplier, Multiplicador Montgomery
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Université Montpellier II, Laboratoire I3S, UMR CNRS 5149, Place Eugène Bataillon CC 051, 34005 Montpellier, France
ISSN:
0302-9743
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
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
Mathematics
Telecommunications and information theory
Mathematics
Telecommunications and information theory
Accession Number:
edscal.15852454
Database:
PASCAL Archive
Weitere Informationen
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this method was only known for elliptic curves. We obtain an algorithm that is competitive compared to the usual methods of scalar multiplication and that has additional properties such as resistance to timings attacks. This algorithm has very important applications in cryptography using hyperelliptic curves and more particularly for people interested in cryptography on smart cards.