Sandy2X
| Autor: | Tung Chou |
|---|---|
| Přispěvatelé: | Discrete Mathematics |
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
business.industry
Computer science Computation Signatures Curve25519 Cryptography Diffie-Hellman Parallel computing Speed Ivy Bridge Ed25519 Bridge (interpersonal) Field arithmetic Set (abstract data type) Elliptic curve Vectorization Elliptic curves Multiplier (economics) Hardware_ARITHMETICANDLOGICSTRUCTURES business Constant time |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319313009 SAC Selected Areas in Cryptography – SAC 2015: 22nd International Conference, Sackville, NB, Canada, August 12–14, 2015, Revised Selected Papers, 145-160 STARTPAGE=145;ENDPAGE=160;TITLE=Selected Areas in Cryptography – SAC 2015 |
| ISSN: | 0302-9743 |
| Popis: | This paper sets speed records on well-known Intel chips for the Curve25519 elliptic-curve Diffie-Hellman scheme and the Ed25519 digital signature scheme. In particular, it takes only $$159\,128$$159128 Sandy Bridge cycles or $$156\,995$$156995 Ivy Bridge cycles to compute a Diffie-Hellman shared secret, while the previous records are $$194\,036$$194036 Sandy Bridge cycles or $$182\,708$$182708 Ivy Bridge cycles. There have been many papers analyzing elliptic-curve speeds on Intel chips, and they all use Intel's serial $$64 \times 64 \rightarrow 128$$64×64i¾?128-bit multiplier for field arithmetic. These papers have ignored the 2-way vectorized $$32 \times 32 \rightarrow 64$$32×32i¾?64-bit multiplier on Sandy Bridge and Ivy Bridge: it seems obvious that the serial multiplier is faster. However, this paper uses the vectorized multiplier. This is the first speed record set for elliptic-curve cryptography using a vectorized multiplier on Sandy Bridge and Ivy Bridge. Our work suggests that the vectorized multiplier might be a better choice for elliptic-curve computation, or even other types ofcomputation that involve prime-field arithmetic, even in the case where the computation does not exhibit very nice internal parallelism. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|