English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/42886
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

Java Card implementation of the Elliptic Curve Integrated Encryption Scheme using prime and binary finite fields

AuthorsGayoso Martínez, Víctor; Hernández Encinas, Luis; Sánchez Ávila, Carmen
KeywordsJava Card
Elliptic curves
Public key encryption schemes
Issue Date2011
PublisherSpringer
CitationLecture Notes in Computer Science 6694 : 160-167(2011)
AbstractElliptic Curve Cryptography (ECC) can be considered an approach to public-key cryptography based on the arithmetic of elliptic curves and the Elliptic Curve Discrete Logarithm Problem (ECDLP). Regarding encryption, the best-known scheme based on ECC is the Ellip- tic Curve Integrated Encryption Scheme (ECIES), included in standards from ANSI, IEEE, and also ISO/IEC. In the present work, we provide a comparison of two Java Card implementations of ECIES that we have developed using prime and binary fields, respectively.
Description8 páginas, 2 tablas, 2 figuras.
Publisher version (URL)http://dx.doi.org/10.1007/978-3-642-21323-6
URIhttp://hdl.handle.net/10261/42886
DOI10.1007/978-3-642-21323-6
ISBN978-3-642-21322-9
ISSN0302-9743
E-ISSN1611-3349
Appears in Collections:(IFA) Artículos
Files in This Item:
File Description SizeFormat 
CISIS11-GT-1893 v1.0.pdf143,49 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.