Fault attacks against the Miller's algorithm in edwards coordinates

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Initially, the use of pairings did not involve any secret entry. However in an Identity Based Cryptographic protocol, one of the two entries of the pairing is secret, so fault attack can be applied to Pairing Based Cryptography to find it. In [18], the author shows that Pairing Based Cryptography in Weierstrass coordinates is vulnerable to a fault attack. The addition law in Edwards coordinates is such that the exponentiation in Edwards coordinates is naturally protected to Side Channel attacks. We study here if this property protects Pairing Based Cryptography in Edwards coordinates against fault attacks. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

El Mrabet, N. (2010). Fault attacks against the Miller’s algorithm in edwards coordinates. In Communications in Computer and Information Science (Vol. 76 CCIS, pp. 72–85). https://doi.org/10.1007/978-3-642-13365-7_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free