Topic
Differential cryptanalysis
About: Differential cryptanalysis is a research topic. Over the lifetime, 2131 publications have been published within this topic receiving 54681 citations.
Papers published on a yearly basis
Papers
More filters
Book•
05 Apr 2015TL;DR: The effects of weakly chosen password-keys on the security of block ciphers are examined to study the effects of an optimization heuristic cryptanalytic attack on block cipher.
Abstract: Block cipher algorithms are commonly used to secure confidential information in everyday user applications. However, it is quite common for ignorant users to use familiar dictionary words as their personal passwords. This research examines the effects of weakly chosen password-keys on the security of block ciphers. A new hybrid optimization heuristic cryptanalytic attack (tabu search and genetic algorithm) is used to conduct an intelligent key-search attack on classical ciphers and modern ciphers. The algorithm chosen to represent modern block ciphers is the advanced encryption standard (AES) algorithm. AES is an algebraic product cipher which combines elements of substitution and transposition. Therefore, the primarily aims of this paper is to study the effects of an optimization heuristic cryptanalytic attack on block cipher.
10 citations
Dissertation•
24 Jan 2007
10 citations
TL;DR: By adding 8 bits for each byte using a function and another mathematical function to position the bits in a binary tree and using its in-order tour, this cipher can be made protected.
Abstract: Transposition ciphers are stronger than simple substitution ciphers. However, if the key is short and the message is long, then various cryptanalysis techniques can be applied to break such ciphers. By adding 8 bits (one byte) for each byte using a function and another mathematical function to position the bits in a binary tree and using its in-order tour, this cipher can be made protected. Using an in-order tour of binary tree can diffuse the eight bits (includes 7 bits produced by the function and 1 random bit) and eight bits of the plaintext. This can highly protect the cipher. However, if the key management processes are not secured the strongest ciphers can easily be broken.
10 citations
TL;DR: Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.
Abstract: (1978). COMPUTER METHODS FOR DECRYPTING RANDOM STREAM CIPHERS. Cryptologia: Vol. 2, No. 3, pp. 215-231.
10 citations
01 Jan 2008
TL;DR: A genetic algorithm for finding the secret key of a block permutation cipher that is a permutation of some first natural numbers and finds the exact key's length and the key with controlled accuracy.
Abstract: In this article we discuss a possibility to use genetic algorithms in cryptanalysis. We developed and described the genetic algorithm for finding the secret key of a block permutation cipher. In this case key is a permutation of some first natural numbers. Our algorithm finds the exact key's length and the key with controlled accuracy. Evaluation of conducted experiment's results shows that the almost automatic cryptanalysis is possible.
9 citations