نتایج جستجو برای: differential fault analysis

تعداد نتایج: 3091401  

2009
Joseph Henry

This paper presents a new approach to power transformer differential protection based on HS-transform and SVM (support vector machine). Here, HS-transform is used to generate frequency contours from samples of differential current and parseval’s theorem is used to extract the features like energy and standard deviation. Subsequently these features are used as inputs to SVM for fault classificat...

2000
Ingrid Biehl Bernd Meyer Volker Müller

In this paper we extend the ideas for differential fault attacks on the RSA cryptosystem (see [4]) to schemes using elliptic curves. We present three different types of attacks that can be used to derive information about the secret key if bit errors can be inserted into the elliptic curve computations in a tamper-proof device. The effectiveness of the attacks was proven in a software simulatio...

Journal: :IACR Cryptology ePrint Archive 2006
Guillaume Fumaroli David Vigilant

As the core operation of many public key cryptosystems, group exponentiation is central to cryptography. Attacks on its implementation in embedded device setting is hence of great concern. Recently, implementations resisting both simple side-channel analysis and fault attacks were proposed. In this paper, we go further and present an algorithm that also inherently thwarts differential side-chan...

Journal: :IACR Cryptology ePrint Archive 2014
Thomas Basmer Christian Wittke Zoya Dyka Peter Langendörfer

Side channel and fault attacks take advantage from the fact that the behavior of crypto implementations can be observed and provide hints that simplify revealing keys. These attacks use identical devices either for preparation of attacks or for measurements. By the preparation of attacks the structure and the electrical circuit of devices, that are identical to the target, is analyzed. By side ...

Journal: :IACR Cryptology ePrint Archive 2011
Charles Bouillaguet Patrick Derbez Pierre-Alain Fouque

In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate the strengh of these tool, we show that they allows to automatically discover new attacks on round-reduced AES with very low data complexity, and to find improved attacks on the AES-based MACs Alpha-MAC and Pelican-MA...

2012
Bruno Robisson Hélène Le Bouder Jean-Max Dutertre Assia Tria

Security is a key component for information technologies and communication. Security is a very large research area involved in the whole information technology, related to both hardware and software. This paper focuses on hardware security, and more specifically on hardware cryptanalysis whose aim is to extract confidential information (such as encryption keys) from cryptographic circuits. Many...

2002
Christian Aumüller Peter Bier Wieland Fischer Peter Hofreiter Jean-Pierre Seifert

This article describes concrete results and practically validated countermeasures concerning differential fault attacks on RSA using the CRT. We investigate smartcards with an RSA coprocessor where any hardware countermeasures to defeat fault attacks have been switched off. This scenario was chosen in order to analyze the reliability of software countermeasures. We start by describing our labor...

Journal: :IACR Cryptology ePrint Archive 2015
Sujoy Sinha Roy Kimmo Järvinen Ingrid Verbauwhede

We propose a lightweight coprocessor for 16-bit microcontrollers that implements high security elliptic curve cryptography. It uses a 283-bit Koblitz curve and offers 140-bit security. Koblitz curves offer fast point multiplications if the scalars are given as specific τ -adic expansions, which results in a need for conversions between integers and τ -adic expansions. We propose the first light...

2008
Pierre-Alain Fouque Reynald Lercier Frédéric Valette

In this paper, we present a new fault attack on elliptic curve scalar product algorithms. This attack is tailored to work on the classical Montgomery ladder method when the y-coordinate is not used. No weakness has been reported so far on such implementations, which are very efficient and were promoted by several authors. But taking into account the twist of the elliptic curves, we show how, wi...

2009
Nadia El Mrabet

We complete the study of [16] and [20] about the Miller’s algorithm. The Miller’s algorithm is a central step to compute the Weil, Tate and Ate pairings. The aim of this article is to analyse the weakness of the Miller’s algorithm when it undergoes a fault attack. We prove that the Miller’s algorithm is vulnerable to a fault attack which is valid in all coordinate systems, through the resolutio...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید