scispace - formally typeset
Journal ArticleDOI

Implementing Curve25519 for Side-Channel--Protected Elliptic Curve Cryptography

Pascal Sasdrich, +1 more
- Vol. 9, Iss: 1, pp 3
TLDR
This work shows that Curve25519 is likewise competitive on FPGAs even when countermeasures to thwart side-channel power analysis are included, and achieves a maximal performance of more than 32,000 point multiplications per second on a Xilinx Zynq 7020 FPGA.
Abstract
For security-critical embedded applications Elliptic Curve Cryptography (ECC) has become the predominant cryptographic system for efficient key agreement and digital signatures. However, ECC still involves complex modular arithmetic that is a particular burden for small processors. In this context, Bernstein proposed the highly efficient ECC instance Curve25519 that particularly enables efficient software implementations at a security level comparable to AES-128 with inherent resistance to simple power analysis (SPA) and timing attacks. In this work, we show that Curve25519 is likewise competitive on FPGAs even when countermeasures to thwart side-channel power analysis are included. Our basic multicore DSP-based architectures achieves a maximal performance of more than 32,000 point multiplications per second on a Xilinx Zynq 7020 FPGA. Including a mix of side-channel countermeasures to impede simple and differential power analysis, we still achieve more than 27,500 point multiplications per second with a moderate increase in logic resources.

read more

Citations
More filters
Proceedings Article

Verifiable ASICs

TL;DR: This paper designs and implements physically realizable, area-efficient, high throughput ASICs (for a prover and verifier), in fully synthesizable Verilog, based on the CMT and Allspice interactive proof protocols, and meets or exceeds the performance of executing directly on the trusted platform.
Journal ArticleDOI

Elliptic Curve Cryptography with Efficiently Computable Endomorphisms and Its Hardware Implementations for the Internet of Things

TL;DR: This work studies the computation of an ECDSA signature verification operation on a twisted Edwards curve with an efficiently computable endomorphism, which allows reducing the number of point doublings by approximately 50 percent compared to a conventional implementation.
Journal ArticleDOI

Field Programmable Gate Array Applications—A Scientometric Review

TL;DR: This paper reviews the top FPGAs’ applications by a scientometric analysis in ScientoPy, covering publications related to FPGA from 1992 to 2018, finding the top 150 applications that are divided into the following categories: digital control, communication interfaces, networking, computer security, cryptography techniques, machine learning, digital signal processing, image and video processing, big data, computer algorithms and other applications.
Proceedings ArticleDOI

Full Accounting for Verifiable Outsourcing

TL;DR: Giraffe as mentioned in this paper is an interactive proof geared to data-parallel computation, which makes this protocol asymptotically optimal for the prover and improves the verifier's main bottleneck by almost 3x.
Book ChapterDOI

A Design Methodology for Stealthy Parametric Trojans and Its Application to Bug Attacks

TL;DR: This work examines how particularly stealthy Trojans can be introduced to a given target circuit by way of a two-phase approach.
References
More filters
Journal ArticleDOI

New Directions in Cryptography

TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI

A public key cryptosystem and a signature scheme based on discrete logarithms

TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Book ChapterDOI

Differential Power Analysis

TL;DR: In this paper, the authors examine specific methods for analyzing power consumption measurements to find secret keys from tamper resistant devices. And they also discuss approaches for building cryptosystems that can operate securely in existing hardware that leaks information.
Journal ArticleDOI

Elliptic curve cryptosystems

TL;DR: The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
Book ChapterDOI

Use of Elliptic Curves in Cryptography

TL;DR: In this paper, an analogue of the Diffie-Hellmann key exchange protocol was proposed, which appears to be immune from attacks of the style of Western, Miller, and Adleman.
Related Papers (5)