A class of safe and efficient binary Edwards curves
| Autor: | Luckas A. Farias, Paulo S. L. M. Barreto, Bruno Albertini |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
Hardware architecture Computer Networks and Communications Computer science Edwards curve Scalar (mathematics) Binary number 02 engineering and technology 020202 computer hardware & architecture Elliptic curve VHDL 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Twist Field-programmable gate array computer Software computer.programming_language |
| Zdroj: | Journal of Cryptographic Engineering. 8:271-283 |
| ISSN: | 2190-8516 2190-8508 |
| DOI: | 10.1007/s13389-017-0174-5 |
| Popis: | This work describes a family of binary Edwards curves that admit modular reductions (an operation that can be responsible for up to 30% of the processing time in point arithmetic) twice as fast than the best usual settings, while essentially being as secure as a binary elliptic curve can be (in terms of being rigid and twist safe). Moreover, we present a hardware architecture with a generic VHDL description that can be synthesized to any FPGA with enough area to support the circuit. For this architecture, we are able to execute a point multiplication by scalar on $$\mathbb {F}_{562}$$ in 2.28 ms on Cyclone IV GX, in 1.23 ms on Virtex-7 and in 1.01 ms on Zynq 7020. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink