High-speed high-security signatures
This paper shows that a $390 mass-market quad-core 2.4 GHz Intel Westmere (Xeon
E5620) CPU can create 109000 signatures per second and verify 71000 signatures per …
E5620) CPU can create 109000 signatures per second and verify 71000 signatures per …
Elligator: elliptic-curve points indistinguishable from uniform random strings
DJ Bernstein, M Hamburg, A Krasnova… - Proceedings of the 2013 …, 2013 - dl.acm.org
Censorship-circumvention tools are in an arms race against censors. The censors study all
traffic passing into and out of their controlled sphere, and try to disable censorship …
traffic passing into and out of their controlled sphere, and try to disable censorship …
Exploiting the power of GPUs for asymmetric cryptography
R Szerwinski, T Güneysu - … and Embedded Systems–CHES 2008: 10th …, 2008 - Springer
Abstract Modern Graphics Processing Units (GPU) have reached a dimension with respect
to performance and gate count exceeding conventional Central Processing Units (CPU) by …
to performance and gate count exceeding conventional Central Processing Units (CPU) by …
Ultra high performance ECC over NIST primes on commercial FPGAs
Abstract Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice
due to their significantly smaller bit size of the operands compared to other public-key …
due to their significantly smaller bit size of the operands compared to other public-key …
Fast cryptography in genus 2
In this paper, we highlight the benefits of using genus 2 curves in public-key cryptography.
Compared to the standardized genus 1 curves, or elliptic curves, arithmetic on genus 2 …
Compared to the standardized genus 1 curves, or elliptic curves, arithmetic on genus 2 …
Genus 2 point counting over prime fields
For counting points of Jacobians of genus 2 curves over a large prime field, the best known
approach is essentially an extension of Schoof's genus 1 algorithm. We propose various …
approach is essentially an extension of Schoof's genus 1 algorithm. We propose various …
Endomorphisms for faster elliptic curve cryptography on a large class of curves
SD Galbraith, X Lin, M Scott - … International Conference on the Theory and …, 2009 - Springer
Efficiently computable homomorphisms allow elliptic curve point multiplication to be
accelerated using the Gallant-Lambert-Vanstone (GLV) method. We extend results of Iijima …
accelerated using the Gallant-Lambert-Vanstone (GLV) method. We extend results of Iijima …
How to Manipulate Curve Standards: A White Paper for the Black Hat http://bada55.cr.yp.to
This paper analyzes the cost of breaking ECC under the following assumptions:(1) ECC is
using a standardized elliptic curve that was actually chosen by an attacker;(2) the attacker is …
using a standardized elliptic curve that was actually chosen by an attacker;(2) the attacker is …
Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV–GLS curves (extended version)
A Faz-Hernández, P Longa, AH Sánchez - Journal of Cryptographic …, 2015 - Springer
We propose efficient algorithms and formulas that improve the performance of side channel
protected elliptic curve computations with special focus on scalar multiplication exploiting …
protected elliptic curve computations with special focus on scalar multiplication exploiting …
Verifying curve25519 software
This paper presents results on formal verification of high-speed cryptographic software. We
consider speed-record-setting hand-optimized assembly software for Curve25519 elliptic …
consider speed-record-setting hand-optimized assembly software for Curve25519 elliptic …