scispace - formally typeset
Open AccessProceedings ArticleDOI

Scan-based attack against elliptic curve cryptosystems

Reads0
Chats0
TLDR
The experimental results demonstrate that a secret key in a practical ECC circuit can be deciphered using 29 points over the elliptic curve E within 40 seconds.
Abstract
Scan-based attacks are techniques to decipher a secret key using scanned data obtained from a cryptography circuit. Public-key cryptography, such as RSA and elliptic curve cryptosystem (ECC), is extensively used but conventional scan-based attacks cannot be applied to it, because it has a complicated algorithm as well as a complicated architecture. This paper proposes a scan-based attack which enables us to decipher a secret key in ECC. The proposed method is based on detecting intermediate values calculated in ECC. By monitoring the 1-bit sequence in the scan path, we can find out the register position specific to the intermediate value in it and we can know whether this intermediate value is calculated or not in the target ECC circuit. By using several intermediate values, we can decipher a secret key. The experimental results demonstrate that a secret key in a practical ECC circuit can be deciphered using 29 points over the elliptic curve E within 40 seconds.

read more

Citations
More filters
Journal Article

A high-performance reconfigurable elliptic curve processor for GF(2m)

TL;DR: In this article, a processor architecture for elliptic curves cryptosystems over fields GF(2 m ) is proposed, which is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curve and finite fields.
Journal ArticleDOI

Secure Scan and Test Using Obfuscation Throughout Supply Chain

TL;DR: By perturbing test patterns/responses and protecting the Obfuscation Key, the proposed architecture is proven to be robust against existing noninvasive scan-based attacks, and can protect all scan data from attackers in foundry, assembly, and system development without compromising the testability.
Journal ArticleDOI

Scan-Based Side-Channel Attack against RSA Cryptosystems Using Scan Signatures

TL;DR: A scan-based side-channel attack which enables us to retrieve a secret key in an RSA circuit based on detecting intermediate values calculated inAn RSA circuit by monitoring a 1-bit time-sequence specific to some intermediate values.
Proceedings ArticleDOI

Pre-silicon security verification and validation: a formal perspective

TL;DR: Proof-carrying hardware and its applications are introduced in detail, and the use of theorem proving methods for providing high-level protection of IP cores are demonstrated, to ensure that the hardware implementation is equivalent to its design specification, thus leaving little space for malicious logic insertion.
Journal ArticleDOI

Test Versus Security: Past and Present

TL;DR: A detailed survey on the state-of-the-art in scan-based side-channel attacks on symmetric and public-key cryptographic hardware implementations, both in the absence and presence of advanced DfT structures, such as test compression and X-masking, which may make the attack difficult.
References
More filters
Journal ArticleDOI

A method for obtaining digital signatures and public-key cryptosystems

TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
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.
Book

Elliptic Curves in Cryptography

TL;DR: In the past few years elliptic curve cryptography has moved from a fringe activity to a major challenger to the dominant RSA/DSA systems as mentioned in this paper, and it has become all pervasive.
Journal ArticleDOI

Speeding the Pollard and elliptic curve methods of factorization

TL;DR: In this paper, a parametrization of elliptic curves is proposed to speed up the p 1 and Monte Carlo methods. But the parametrized elliptic curve method requires n/2 + o(n) multiplications.
Related Papers (5)