126 search results - page 14 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
CHES
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this article we present a low-cost coprocessor for smartcards which supports all necessary mathematical operations for a fast calculation of the Elliptic Curve Digital...
CHES
2000
Springer
14 years 23 days ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
PKC
2009
Springer
14 years 9 months ago
2009
Springer
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases...
ITCC
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
ISW
2010
Springer
13 years 6 months ago
2010
Springer
The concept of grouping proofs has been introduced by Juels to permit RFID tags to generate a verifiable proof that they have been scanned simultaneously, even when readers or tags...