On nonabelian key addition groups and markovian block ciphers
نویسندگان
چکیده
منابع مشابه
Key classification attack on block ciphers
In this paper, security analysis of block ciphers with key length greater than block length is proposed. When key length is significantly greater than block length and the statistical distribution of cipher system is like a uniform distribution, there are more than one key which map fixed input to fixed output. If a block cipher designed sufficiently random, it is expected that the key space ca...
متن کاملThe Key-Dependent Attack on Block Ciphers
In this paper, we formalize an attack scheme using the key-dependent property, called key-dependent attack. In this attack, the intermediate value, whose distribution is key-dependent, is considered. The attack determines whether a key is right by conducting statistical hypothesis test of the intermediate value. The time and data complexity of the key-dependent attack is also discussed. We also...
متن کاملRound Addition Differential Fault Analysis on Lightweight Block Ciphers with On-the-Fly Key Scheduling
Round addition differential fault analysis using operation skipping for lightweight block ciphers with on-the-fly key scheduling is presented. For 64-bit KLEIN, it is shown that only a pair of correct and faulty ciphertexts can be used to derive the secret master key. For PRESENT, one correct ciphertext and two faulty ciphertexts are required to reconstruct the secret key. Furthermore, secret k...
متن کاملKey Generators Can Strengthen Block Ciphers
The notion of key generators is introduced to symmetric cryptography. Key generators help eliminate the dependence of a block cipher’s security on a single, static key. If one of the dynamic keys is leaked to the adversary, then this compromise does not reveal future keys and prior keys used by the block cipher to encrypt distinct blocks of plaintext. A practical, key generator updating algorit...
متن کاملPublic key encryption using block ciphers
A method for deriving a public key encryption system from any ‘conventional’ (secret key) block cipher is described. The method is related to, but improves upon, Merkle’s ’puzzle system’.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Prikladnaya diskretnaya matematika. Prilozhenie
سال: 2018
ISSN: 2226-308X
DOI: 10.17223/2226308x/11/25