2,148 research outputs found
Fault Attack on FPGA implementations of Trivium Stream Cipher
This article presents the development of an experimental
system to introduce faults in Trivium stream ciphers
implemented on FPGA. The developed system has made possible
to analyze the vulnerability of these implementations against
fault attacks. The developed system consists of a mechanism
that injects small pulses in the clock signal, and elements that
analyze if a fault has been introduced, the number of faults
introduced and its position in the inner state. The results obtained
demonstrate the vulnerability of these implementations against
fault attacks. As far as we know, this is the first time that
experimental results of fault attack over Trivium are presented.Ministerio de Economía y Competitividad TEC2010-16870Ministerio de Economía y Competitividad TEC2013-45523- RMinisterio de Economía y Competitividad CSIC 201550E039
Fault Analysis of Grain Family of Stream Ciphers
In this paper, we present fault attack on Grain family of stream ciphers, an eStream finalist. The earlier fault attacks on Grain work on LFSR whereas our target for fault induction is the NFSR. Our attack requires a small number of faults to be injected; 150 only for Grain v1 and only 312 and 384 for Grain-128 and Grain-128a, respectively. The number of faults are much lesser than the earlier reported fault attacks; 1587 for Grain-128 and 1831 for Grain-128a
A Security Analysis of IoT Encryption: Side-channel Cube Attack on Simeck32/64
Simeck, a lightweight block cipher has been proposed to be one of the
encryption that can be employed in the Internet of Things (IoT) applications.
Therefore, this paper presents the security of the Simeck32/64 block cipher
against side-channel cube attack. We exhibit our attack against Simeck32/64
using the Hamming weight leakage assumption to extract linearly independent
equations in key bits. We have been able to find 32 linearly independent
equations in 32 key variables by only considering the second bit from the LSB
of the Hamming weight leakage of the internal state on the fourth round of the
cipher. This enables our attack to improve previous attacks on Simeck32/64
within side-channel attack model with better time and data complexity of 2^35
and 2^11.29 respectively.Comment: 12 pages, 6 figures, 4 tables, International Journal of Computer
Networks & Communication
Fast algebraic immunity of Boolean functions and LCD codes
Nowadays, the resistance against algebraic attacks and fast algebraic attacks
are considered as an important cryptographic property for Boolean functions
used in stream ciphers. Both attacks are very powerful analysis concepts and
can be applied to symmetric cryptographic algorithms used in stream ciphers.
The notion of algebraic immunity has received wide attention since it is a
powerful tool to measure the resistance of a Boolean function to standard
algebraic attacks. Nevertheless, an algebraic tool to handle the resistance to
fast algebraic attacks is not clearly identified in the literature. In the
current paper, we propose a new parameter to measure the resistance of a
Boolean function to fast algebraic attack. We also introduce the notion of fast
immunity profile and show that it informs both on the resistance to standard
and fast algebraic attacks. Further, we evaluate our parameter for two
secondary constructions of Boolean functions. Moreover, A coding-theory
approach to the characterization of perfect algebraic immune functions is
presented. Via this characterization, infinite families of binary linear
complementary dual codes (or LCD codes for short) are obtained from perfect
algebraic immune functions. The binary LCD codes presented in this paper have
applications in armoring implementations against so-called side-channel attacks
(SCA) and fault non-invasive attacks, in addition to their applications in
communication and data storage systems
Transparent code authentication at the processor level
The authors present a lightweight authentication mechanism that verifies the authenticity of code and thereby addresses the virus and malicious code problems at the hardware level eliminating the need for trusted extensions in the operating system. The technique proposed tightly integrates the authentication mechanism into the processor core. The authentication latency is hidden behind the memory access latency, thereby allowing seamless on-the-fly authentication of instructions. In addition, the proposed authentication method supports seamless encryption of code (and static data). Consequently, while providing the software users with assurance for authenticity of programs executing on their hardware, the proposed technique also protects the software manufacturers’ intellectual property through encryption. The performance analysis shows that, under mild assumptions, the presented technique introduces negligible overhead for even moderate cache sizes
A Review on Biological Inspired Computation in Cryptology
Cryptology is a field that concerned with cryptography and cryptanalysis. Cryptography, which is a key technology in providing a secure transmission of information, is a study of designing strong cryptographic algorithms, while cryptanalysis is a study of breaking the cipher. Recently biological approaches provide inspiration in solving problems from various fields. This paper reviews major works in the application of biological inspired computational (BIC) paradigm in cryptology. The paper focuses on three BIC approaches, namely, genetic algorithm (GA), artificial neural network (ANN) and artificial immune system (AIS). The findings show that the research on applications of biological approaches in cryptology is minimal as compared to other fields. To date only ANN and GA have been used in cryptanalysis and design of cryptographic primitives and protocols. Based on similarities that AIS has with ANN and GA, this paper provides insights for potential application of AIS in cryptology for further research
A Simple Attack on Some Clock-Controlled Generators
We present a new approach to edit distance attacks on certain
clock-controlled generators, which applies basic concepts of Graph Theory to
simplify the search trees of the original attacks in such a way that only the
most promising branches are analyzed. In particular, the proposed improvement
is based on cut sets defined on some graphs so that certain shortest paths
provide the edit distances. The strongest aspects of the proposal are that the
obtained results from the attack are absolutely deterministic, and that many
inconsistent initial states of the target registers are recognized beforehand
and avoided during search
- …