scispace - formally typeset
Search or ask a question

Showing papers on "Block cipher published in 1990"


Journal ArticleDOI
11 Aug 1990
TL;DR: A new type of cryptanalytic attack is developed which can break the reduced variant of DES with eight rounds in a few minutes on a personal computer and can break any reduced variantof DES (with up to 15 rounds) using less than 256 operations and chosen plaintexts.
Abstract: The Data Encryption Standard (DES) is the best known and most widely used cryptosystem for civilian applications. It was developed at IBM and adopted by the National Bureau of Standards in the mid 1970s, and has successfully withstood all the attacks published so far in the open literature. In this paper we develop a new type of cryptanalytic attack which can break the reduced variant of DES with eight rounds in a few minutes on a personal computer and can break any reduced variant of DES (with up to 15 rounds) using less than 256 operations and chosen plaintexts. The new attack can be applied to a variety of DES-like substitution/permutation cryptosystems, and demonstrates the crucial role of the (unpublished) design rules.

2,494 citations


Book ChapterDOI
01 Nov 1990
TL;DR: Another multiple key cipher also based on a well known cryptographic function, exponentiation in a prime field is considered, the important difference from multiple key RSA is that this function does not possess the trapdoor property.
Abstract: At Eurocrypt 88 [1] we introduced the notion of a multiple key cipher and illustrated it with an example based on RSA which we called “multiple key RSA”. In this paper we consider another multiple key cipher also based on a well known cryptographic function, exponentiation in a prime field. The important difference from multiple key RSA is that this function does not possess the trapdoor property. At the end of [1] we speculated that such functions may have useful applications and here we give as one illustration a new voting scheme.

64 citations


Journal ArticleDOI
Sean Murphy1
TL;DR: An algebraic method is given for a chosen plaintext cryptanalysis of the Nippon Telegraph and Telephone Corporation's FEAL-4 block cipher.
Abstract: An algebraic method is given for a chosen plaintext cryptanalysis of the Nippon Telegraph and Telephone Corporation's FEAL-4 block cipher. The method given uses 20 chosen plaintexts, but can be adapted to use as few as four chosen plaintexts.

29 citations


Journal Article
TL;DR: In this paper, the authors proposed a zero-knowledge proof for cryptosystems, which can be argued in perfect zero knowledge in a bounded number of rounds in the presence of a fixed number of signatures.
Abstract: Public-key cryptosystems.- The Adolescence of Public-Key Cryptography.- A Secure Public-Key Authentication Scheme.- How to improve signature schemes.- A Generalization of El Gamal's Public Key Cryptosystem.- An Identity-Based Key-Exchange Protocol.- How to Keep Authenticity Alive in a Computer Network.- The Use of Fractions in Public-Key Cryptosystems.- A Practical Protocol for Large Group Oriented Networks.- Theory.- Counting Functions Satisfying a Higher Order Strict Avalanche Criterion.- A Key Distribution System Based On Any One-Way Function.- Non-linearity of Exponent Permutations.- Informational Divergence Bounds for Authentication Codes.- 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms.- A Simple Technique for Diffusing Cryptoperiods.- Zero-knowledge protocols.- A General Zero-Knowledge Scheme.- Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility.- Verifiable Disclosure of Secrets and Applications (Abstract).- Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.- An alternative to the Fiat-Shamir protocol.- Sorting out zero-knowledge.- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds.- Zero-Knowledge Proofs of Computational Power.- More Efficient Match-Making and Satisfiability The Five Card Trick.- Applications.- A Single Chip 1024 Bits RSA Processor.- Cryptel - The Practical Protection of an Existing Electronic Mail System.- Technical Security: The Starting Point.- Security in Open Distributed Processing.- A European Call for Cryptographic Algorithms: Ripe Race Integrity Primitives Evaluation.- Signature and untraceability.- Legal Requirements Facing New Signature Technology.- Online Cash Checks.- Efficient Offline Electronic Checks.- Unconditional Sender and Recipient Untraceability in Spite of Active Attacks.- Detection of Disrupters in the DC Protocol.- Cryptanalysis.- Random Mapping Statistics.- Factoring by electronic mail.- Cryptanalysis of Short RSA Secret Exponents.- How to Break the Direct RSA-Implementation of Mixes.- An Information-Theoretic Treatment of Homophonic Substitution.- Cryptanalysis of a Modified Rotor Machine.- Cryptanalysis of Video Encryption Based on Space-Filling Curves.- Impossibility and Optimality Results on Constructing Pseudorandom Permutations.- On the Security of Schnorr's Pseudo Random Generator.- How easy is collision search? Application to DES.- Sharing and authentication schemes.- Prepositioned Shared Secret and/or Shared Control Schemes.- Some Ideal Secret Sharing Schemes.- Cartesian Authentication Schemes.- How to Say "No".- Key Minimal Authentication Systems for Unconditional Secrecy.- Sequences.- Parallel Generation of Recurring Sequences.- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point.- On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can't be Random.- Feedforward Functions Defined by de Bruijn Sequences.- Nonlinearity Criteria for Cryptographic Functions.- On the Linear Complexity of Feedback Registers.- Linear Complexity Profiles and Continued Fractions.- A Fast Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences.- Algorithms.- On the Complexity and Efficiency of a New Key Exchange System.- A New Multiple Key Cipher and an Improved Voting Scheme.- Atkin's Test: News from the Front.- Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity.- Old problems.- Deciphering Bronze Age Scripts of Crete The Case of Linear A.- Rump Session (impromptu talks).- Faster Primality Testing.- Private-Key Algebraic-Code Cryptosystems with High Information Rates.- Zero-knowledge procedures for confidential access to medical records.- Full Secure Key Exchange and Authentication with no Previously Shared Secrets.- Varying Feedback Shift Registers.- A Cryptanalysis of Stepk,m-Cascades.- Efficient Identification and Signatures for Smart Cards.- The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability.- Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences.- On the Design of Permutation P in des Type Cryptosystems.- A Fast Elliptic Curve Cryptosystem.

12 citations


Patent
02 Nov 1990
TL;DR: In 1992, JPO and Japio as discussed by the authors proposed to intensify cryptographic strength by dividing a process into two steps for determining encipherment/decipherment functions and a process for performing encryption/decryption of a data based on an algorithm determining key and data key.
Abstract: PURPOSE: To intensify cryptographic strength by dividing a process into two steps of a process for determining encipherment/decipherment functions and a process for performing encipherment/decipherment of a data based on an algorithm determining key and a data key. CONSTITUTION: In a cipher program creating function 104, a cipher program B103 is created based on an algorithm determining key B107 of 64 bit length. This cipher program B103 is input to a 32 bit processor 106. Next in the 32 bit processor 106, an ordinary sentence 109 is enciphered with a data key 108 and a system key B112 serving as a parameter under control by the cipher program B103, and a cryptographic sentence 110, obtained as a result of the encipherment, is output. In this way, a huge number of algorithm conversion forms by a product of the total number of permutation and combination of a partial change number of a function and its execution order are generated to make cipher breaking drastically difficult. COPYRIGHT: (C)1992,JPO&Japio

9 citations


Journal ArticleDOI
TL;DR: A general principle given by Damgard for constructing hash functions is modified and used to show how the security of block cipher hashing can be improved.
Abstract: A general principle given by Damgard for constructing hash functions is modified and used to show how the security of block cipher hashing can be improved. A small correction to Damgard's work is made.

9 citations


Book ChapterDOI
11 Aug 1990
TL;DR: This work investigates the computational power of block ciphers on n-bit strings that can be expressed as polynomial-length compositions of invertible transformations that have a form similar to those of D.E.S.S., and presents some sufficient conditions for cipher of this type to be "pseudorandom function generators" and to yield private key cryptosystems that are secure against adaptive chosen plaintext attacks.
Abstract: The D.E.S. cipher is naturally viewed as a composition of sixteen invertible transformations on 64-bit strings (where the transformations depend of the value of a 56-bit key). Each of the transformations has a special form and satisfies the particular property that each of its output bits is determined by a "small" number of its input bits. We investigate the computational power of block ciphers on n-bit strings that can be expressed as polynomial-length (with respect to n) compositions of invertible transformations that have a form similar to those of D.E.S. In particular, we require that the basic transformations have the property that each of their output bits depends on the value of a small number of their input bits (where "small" is somewhere in the range between O(1) and O(log n)). We present some sufficient conditions for ciphers of this type to be "pseudorandom function generators" and, thus, to yield private key cryptosystems that are secure against adaptive chosen plaintext attacks.

4 citations


Book ChapterDOI
11 Aug 1990
TL;DR: These parity circuits are proven to satisfy some of the properties required in cryptography; involution, nonlinearity, the probability of bit complementation, avalanche effect, equivalent keys and computational efficiency.
Abstract: This paper proposes a new family of nonlinear cryptographic functions called parity circuits. These parity circuits compute a one-to-one Boolean function, and they can be applied to symmetric block ciphers. In this paper, parity circuits are first defined. Next, these circuits are proven to satisfy some of the properties required in cryptography; involution, nonlinearity, the probability of bit complementation, avalanche effect, equivalent keys and computational efficiency. Finally, the speed of parity circuits implemented using the current hardware technology is estimated to show they can achieve 160 Mbps with a 64-bit block size, 8 rounds, and 3.2 K gates.

3 citations


Journal ArticleDOI
TL;DR: Tests suggest either of the ciphers described can provide stronger protection than the Data Encryption Standard (DES), and CRYPTO-MECCANO has been submitted to the European RIPE/RACE Consortium as a candidate algorithm to replace DES as a cryptographic primitive for integrity assurance.

2 citations


Journal ArticleDOI
I.J. Kumar1, Meena Kumari1
TL;DR: It has been brought out that with the increase in the complexity of the Cryptosystems it is necessary to apply some statistical and classification techniques for the purpose of identifying a cryptosystem as also for classification of the total key set into smaller classes.
Abstract: In this paper some new mathematical technique used in the design and analysis of cipher systems have been reviewed. Firstly, some modern cryptosystems like stream ciphers, permutation-based systems and public key encryption systems are described and the mathematical tools used in their design have been outlined. Special emphasis has been laid on the problems related to application of computational complexity to cryptosystems. Recent work on the design of the systems based on a combined encryption and coding for error correction has also been reviewed. Some recent system-oriented techniques of cryptanalysis have been discussed. It has been brought out that with the increase in the complexity of the cryptosystems it is necessary to apply some statistical and classification techniques for the purpose of identifying a cryptosystem as also for classification of the total key set into smaller classes. Finally, some very recent work on the application of artificial intelligence technique in cryptography and cryptanalysis has been mentioned.

1 citations