Topic
Classical cipher
About: Classical cipher is a research topic. Over the lifetime, 22 publications have been published within this topic receiving 203 citations.
Papers
Proceedings Article•
1 Oct 2012TL;DR: It is shown that the quantum version of the Even-Mansour cipher is insecure, that is, a key can be found in polynomial time in the key length, an example that the Quantum version of a secure classical cipher is not always secure.
Abstract: Quantum cryptography such as BB84 is a quantum protocol for sharing classical information, but is not a scheme for encrypting quantum information itself. This paper considers that quantum information is encrypted with the quantum circuit of the Even-Mansour cipher. It has been proved that breaking the Even-Mansour cipher requires exponential time in the key length using any classical algorithm. This paper shows that the quantum version of the Even-Mansour cipher is insecure, that is, a key can be found in polynomial time in the key length. This is an example that the quantum version of a secure classical cipher is not always secure.
192 citations
12 Jul 2003
TL;DR: The use of Ant Colony Optimisation (ACO) is described for the automatic recovery of the key, and hence the plaintext, from only the ciphertext.
Abstract: Transposition ciphers are a class of historical encryption algorithms based on rearranging units of plaintext according to some fixed permutation which acts as the secret key Transpositions form a building block of modern ciphers, and applications of metaheuristic optimisation techniques to classical ciphers have preceded successful results on modern-day cryptological problems In this paper we describe the use of Ant Colony Optimisation (ACO) for the automatic recovery of the key, and hence the plaintext, from only the ciphertext
16 citations
TL;DR: A variant of hill cipher having two key matrices to add extra security to health related data is proposed, which is computationally feasible in achieving confidentiality.
13 citations
TL;DR: In this paper, it was shown that Hill with d d key matrix over Z 26 can be broken with computational complexity of O(d 26 d ), for the English language.
10 citations
TL;DR: The comparison analysis shows that the proposed cipher, Adaptive Multidimensional Playfair Cipher (AMPC), is better than the existing variations in terms of memory utilization, security and applicability.
Abstract: Confidential information in today’s world exists in many forms such as text, image, audio, video, encoded, compressed etc. The important aim of this research is to develop such a cryptographic cipher which is very strong and can secure all types of information without any ambiguity. It is discovered from survey that the existing variations of Playfair cipher except one can support securing limited number of characters and most of them are ambiguous, have less confusion rate and avalanche effect which should be high in order to be strong. Exceptional variation is the one that supported securing all types of information without ambiguity. Unfortunately, this variation is not memory and bandwidth efficient like many other variants and it can have low or moderate avalanche effect with respect to one bit change in plain message. So, we propose a new variant called Adaptive Multidimensional Playfair Cipher (AMPC) which can secure all types of information unambiguously with high confusion rate and avalanche effect, and is memory and bandwidth efficient. The security analysis of the proposed cipher shows that it is strong against five major types of cryptanalytic attacks. The comparison analysis shows that the proposed cipher is better than the existing variations in terms of memory utilization, security and applicability.
6 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 3 |
| 2019 | 3 |
| 2018 | 3 |
| 2017 | 4 |
| 2016 | 1 |
| 2014 | 1 |