Topic
Cipher
About: Cipher is a research topic. Over the lifetime, 9409 publications have been published within this topic receiving 110309 citations. The topic is also known as: cypher & cryptographic algorithm.
Papers published on a yearly basis
Papers
More filters
TL;DR: A new chaos based cryptosystem is proposed to transmit digital information signal by using the conventional synchronization approach with cascaded heterogeneous chaotic systems and the quality of the recovered signal is higher and the encoding is potentially secure.
27 citations
TL;DR: This article describes an innovative architecture that features a speed increase for both hardware and software implementations, compared to the state of the art for 3DES-CBC.
27 citations
Journal Article•
TL;DR: This paper presents the first known non-trivial relation that involves all the three operations of IDEA, and devise a linear attack on 5-round IDEA that uses 219 known plaintexts and has a time complexity of 2103 encryptions.
Abstract: IDEA is a 64-bit block cipher with 128-bit keys introduced by Lai and Massey in 1991. IDEA is one of the most widely used block ciphers, due to its inclusion in several cryptographic packages, such as PGP and SSH. The cryptographic strength of IDEA relies on a combination of three incompatible group operations - XOR, addition and modular multiplication. Since its introduction in 1991, IDEA has withstood extensive cryptanalytic effort, but no attack was found on the full variant of the cipher. In this paper we present the first known non-trivial relation that involves all the three operations of IDEA. Using this relation and other techniques, we devise a linear attack on 5-round IDEA that uses 2 19 known plaintexts and has a time complexity of 2 103 encryptions. By transforming the relation into a related-key one, a similar attack on 7.5-round IDEA can be applied with data complexity of 2 43,5 known plaintexts and a time complexity equivalent to 21 115 encryptions. Both of the attacks are by far the best known attacks on IDEA.
27 citations
Patent•
19 May 2000TL;DR: In this paper, the operating and other procedures of an optical disk application system of the type for which a network is used are simplified by using the IDs to release the soft ciphers, using the cipher keys and decoding keys when sending the cipshers, and using the decoding key when receiving the Ciphers.
Abstract: The operating and other procedures of an optical disk application system of the type for which a network is used are simplified. Optical disks have auxiliary data recording areas, where different IDs for individual disks, and/or cipher keys and/or decoding keys for ciphers are recorded in advance in a factory. By using the IDs to release the soft ciphers, using the cipher keys when sending the ciphers, and using the decoding keys when receiving the ciphers, user authorization procedures are simplified.
27 citations
TL;DR: In this correspondence, coding theorems are proved for the case that Yamamoto's coding problem is applied to MerHav-Arikan's security criterion or Merhav'sSecurity criterion.
Abstract: The security level of the Shannon cipher system is traditionally measured by equivocation, where is a secret plaintext with length and is its cryptogram. But, Merhav and Arikan have considered another security criterion, which is measured by the number of guesses needed for a wiretapper to uncover from . Merhav has also considered the third security criterion, which measured by the probability of correct guess of a wiretapper. On the other hand, in the case of the traditional security criterion, Yamamoto has treated a coding problem for correlated source outputs and such that only is secret against wiretappers and only must be transmitted to a legitimate receiver. In this correspondence, coding theorems are proved for the case that Yamamoto's coding problem is applied to Merhav-Arikan's security criterion or Merhav's security criterion.
27 citations