Propositional encoding of direct and inverse round transformations in attacks on some block ciphers
نویسندگان
چکیده
منابع مشابه
SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers
This paper reports on variants of the Square attack applied to reduced-round versions of the PES and IDEA block ciphers. Attacks on 2.5 rounds of IDEA require 3·2 chosen-plaintexts and recover 77 key bits with a time complexity of 2. A new kind of attack, the related-key Square attack, is applied to 2.5 rounds of IDEA and recovers 32 key bits, with two chosen-plaintexts and 2 related keys with ...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
New Birthday Attacks on Some MACs Based on Block Ciphers
This paper develops several new techniques of cryptanalyzing MACs based on block ciphers, and is divided into two parts. The first part presents new distinguishers of the MAC construction Alred and its specific instance Alpha-MAC based on AES. For the Alred construction, we first describe a general distinguishing attack which leads to a forgery attack directly with the complexity of the birthda...
متن کاملCorrelation Attacks on Block Ciphers
This report presents a new statistical attack on iterative block ciphers called the correlation attack which is a natural generalization of linear cryptanalysis. The attack is based on nding complex-valued functions on the input and the output of a cipher which have a high correlation. Their mutual relation is then exploited to yield information about the nal round key. Introducing the notions ...
متن کاملOn the Interpolation Attacks on Block Ciphers
The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and/or on the number of terms in the polynomial approximation expression. In some situations, the round function or the S-boxes of the block cipher are expressed explicitly in terms of algebraic function, yet in many other occasions the S-boxes are expressed in terms of their Boolean f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Prikladnaya diskretnaya matematika. Prilozhenie
سال: 2018
ISSN: 2226-308X
DOI: 10.17223/2226308x/11/24