32 search results - page 5 / 7 » Arithmetic Operators for Pairing-Based Cryptography |
ASAP
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper proposes different low-cost coprocessors for public key authentication on 8-bit smart cards. Elliptic curve cryptography is used for its efficiency per bit of key and ...
EUROCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
107
click to vote
CHES
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
PKC
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
101
click to vote
ESAS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this article we present the fastest known implementation of a modular multiplication for a 160-bit standard compliant elliptic curve (secp160r1) for 8-bit micro contro...