Reference : Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/2279
Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two
English
Müller, Volker mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
1998
Journal of Cryptology
Springer-Verlag
11
4
219-234
Yes (verified by ORBilu)
International
0933-2790
[en] Elliptic curve ; Frobenius expansion ; Finite field of characteristic 2
[en] The paper shows how Frobenius expansions can be used to speed up mul­tiplication of points on elliptic curves that are defined over very small fields of charac­teristic two. The Frobenius expansion algorithm is analyzed in theory and in practice. It can gain significant improvements in practical applica­tions. These curves are there­fore especially interesting for implementations of elliptic curve cryptosystems.
Researchers ; Students
http://hdl.handle.net/10993/2279

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
JC_fast_mult_char2.pdfAuthor postprint271 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.