How to Strengthen DES-like Cryptosystems against Differential Cryptanalysis (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
We propose a new randomized version of DES in which a key-dependent swapping is used to strengthen DES and DES-like cryptosystems against differential cryptanalysis. This new scheme, called RDES, decreases the probability of success in differential attack by decreasing the characteristic probability. The characteristic is the effect of particular differences in plaintext pairs on the differences in the resultant ciphertext pairs. The characteristic probability for the n-round RDES is 2^<-n+1> times that for the n-round DES. As for the differential cryptanalysis based on characteristics, the 16-round RDES is as strong as the about 20-round DES. Encryption / decryption speed of n-round RDES is almost the same as that of the n-round DES.
- 一般社団法人電子情報通信学会の論文
- 1993-01-25
著者
-
KOYAMA Kenji
NTT Communication Science Laboratories
-
Terada Routo
The Dept. Of Computer Science University Of Sao Paulo
関連論文
- The Security of an RDES Cryptosystem against Linear Cryptanalysis (Special Section on Cryptography and Information Security)
- Special Section on Cryptography and Information Security
- Demonstrating Possession without Revealing Factors (Special Section on Cryptography and Information Security)
- Two Discrete Log Algorithms for Super-Anomalous Elliptic Curves and Their Applications(Special Section on Cryptography and Information Security)
- Efficient Cryptosystems over Elliptic Curves Based on a Product of Form-Free Primes (Special Section on Information Theory and Its Applications)
- A New RSA-Type Scheme Based on Singular Cubic Curves y^2≡x^3+bx^2 (mod n)
- Dynamic Swapping Schemes and Differential Cryptanalysis (Special Section on Information Theory and Its Applications)
- A New Version of FEAL, Stronger against Differential Cryptanalysis (Special Section on Cryptography and Information Security)
- A New RSA-Type Scheme Based on Singular Cubic Curves (y-αx)(y-βx )≡x^3 (mod n) (Special Section on Cryptography and Information Security)
- Fast Exponentiation Algorithms Based on Batch-Processing and Precomputation (Special Section on Cryptography and Information Security)
- A Signed Binary Window Method for Fast Computing over Elliptic Curves (Special Section on Cryptography and Information Security)
- Elliptic Curve Cryptosystems and Their Applications
- On the Solutions of the Diophantine Equation x^3+y^3+z^3=n
- How to Strengthen DES-like Cryptosystems against Differential Cryptanalysis (Special Section on Cryptography and Information Security)
- Improved Elliptic Curve Methods for Factoring and Their Performance (Special Section on Cryptography and Information Security)