Provable Security for New Block Cipher Structures against Differential Cryptanalysis and Linear Cryptanalysis
Jongsung Kim, 정기태, Seokhie Hong, Sangjin Lee
Abstract
Jongsung Kim, 정기태, Seokhie Hong, Sangjin Lee
Abstract
Differential cryptanalysis and linear cryptanalysis are the most powerful approaches known for attacking many block ciphers and used to evaluating the security of many block ciphers. So designers have designed secure block ciphers against these cryptanalyses. In this paper, we present new three block cipher structures. And for given r, we prove that differential(linear) probabilities for r-round blockcipher structures are upper bounded by if the maximum differential(linear) probability is p(q) and the round function is a bijective function.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Differential cryptanalysis and linear cryptanalysis are the most powerful approaches known for attacking many block ciphers and used to evaluating the security of many block ciphers. So designers have designed secure block ciphers against these cryptanalyses. In this paper, we present new three block cipher structures. And for given r, we prove that differential(linear) probabilities for r-round blockcipher structures are upper bounded by if the maximum differential(linear) probability is p(q) and the round function is a bijective function.
Key concepts: Linear cryptanalysis, Differential cryptanalysis, Higher-order differential cryptanalysis, Impossible differential cryptanalysis, Block cipher, Boomerang attack, Mathematics, Computer science