394 research outputs found
A Spatiotemporal-chaos-based Encryption Having Overall Properties Considerably Better Than Advanced Encryption Standard
Spatiotemporal chaos of a two-dimensional one-way coupled map lattice is used
for chaotic cryptography. The chaotic outputs of many space units are used for
encryption simultaneously. This system shows satisfactory cryptographic
properties of high security; fast encryption (decryption) speed; and robustness
against noise disturbances in communication channel. The overall features of
this spatiotemporal-chaos-based cryptosystem are better than chaotic
cryptosystems known so far, and also than currently used conventional
cryptosystems, such as the Advanced Encryption Standard (AES).Comment: 11 pages, 3 figure
Slide attacks and LC-weak keys in T-310
T-310 is an important Cold War cipher (Cryptologia 2006). In a recent article (Cryptologia 2018), researchers show that, in spite of specifying numerous very technical requirements, the designers do not protect the cipher against linear cryptanalysis and some 3% of the keys are very weak. However, such a weakness does not necessarily allow breaking the cipher because it is extremely complex and extremely few bits from the internal state are used for the actual encryption. In this article, we finally show a method that allows recovering a part of the secret key for about half of such weak keys in a quasi-realistic setting. For this purpose, we revisit another recent article from Cryptologia from 2018 and introduce a new peculiar variant of the decryption oracle slide attack with d = 0
Human factors and missed solutions to Enigma design weaknesses
The German World War II Enigma suffered from design weaknesses that facilitated its large-scale decryption by the British throughout the war. The author shows that the main technical weaknesses (self-coding and reciprocal coding) could have been avoided using simple contemporary technology, and therefore the true cause of the weaknesses is not technological but must be sought elsewhere. Specifically, human factors issues resulted in the persistent failure to seek out more effective designs. Similar limitations seem to beset the literature on the period, which misunderstands the Enigma weaknesses and therefore inhibits broader thinking about design or realising the critical role of human factors engineering in cryptography
Linear cryptanalysis and block cipher design in East Germany in the 1970s
Linear cryptanalysis (LC) is an important codebreaking method that became popular in the 1990s and has roots in the earlier research of Shamir in the 1980s. In this article we show evidence that linear cryptanalysis is even older. According to documents from the former East Germany cipher authority ZCO, the systematic study of linear characteristics for nonlinear Boolean functions was routinely performed in the 1970s. At the same time East German cryptologists produced an excessively complex set of requirements known as KT1, which requirements were in particular satisfied by known historical used in the 1980s. An interesting line of inquiry, then, is to see if KT1 keys offer some level of protection against linear cryptanalysis. In this article we demonstrate that, strangely, this is not really the case. This is demonstrated by constructing specific counterexamples of pathologically weak keys that satisfy all the requirements of KT1. However, because we use T-310 in a stream cipher mode that uses only a tiny part of the internal state for actual encryption, it remains unclear whether this type of weak key could lead to key recovery attacks on T-310
Decryption oracle slide attacks on T-310
T-310 is an important Cold War cipher (Schmeh 2006). It was the principal encryption algorithm used to protect various state communication lines in Eastern Germany throughout the 1980s. The cipher seems to be quite robust, and until now no researcher has proposed an attack on T-310. This article studies decryption oracle and slide attacks on T-310
Oblivious Transfer based on Key Exchange
Key-exchange protocols have been overlooked as a possible means for
implementing oblivious transfer (OT). In this paper we present a protocol for
mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to
Diffie-Hellman protocol using the idea of obliviously exchanging encryption
keys. Since, Diffie-Hellman scheme is widely used, our protocol may provide a
useful alternative to the conventional methods for implementation of oblivious
transfer and a useful primitive in building larger cryptographic schemes.Comment: 10 page
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algorithm
Genetic algorithms are a population-based Meta heuristics. They have been
successfully applied to many optimization problems. However, premature
convergence is an inherent characteristic of such classical genetic algorithms
that makes them incapable of searching numerous solutions of the problem
domain. A memetic algorithm is an extension of the traditional genetic
algorithm. It uses a local search technique to reduce the likelihood of the
premature convergence. The cryptanalysis of simplified data encryption standard
can be formulated as NP-Hard combinatorial problem. In this paper, a comparison
between memetic algorithm and genetic algorithm were made in order to
investigate the performance for the cryptanalysis on simplified data encryption
standard problems(SDES). The methods were tested and various experimental
results show that memetic algorithm performs better than the genetic algorithms
for such type of NP-Hard combinatorial problem. This paper represents our first
effort toward efficient memetic algorithm for the cryptanalysis of SDES.Comment: 9Page
- …