نتایج جستجو برای: linear attack

تعداد نتایج: 559859  

Journal: :journal of research in medical sciences 0
ozge basaran nermin uncu banu acar celikel fatma ayd?n nilgun cakar

background: blood neutrophil to lymphocyte ratio (nlr) and mean platelet volume (mpv) both have been used as a simple marker of inflammation in many disorders. here, we aimed to investigate the relationship between nlr, mpv, and familial mediterranean fever (fmf). materials and methods: in this retrospective study, the fi les of fmf patients in pediatric rheumatology outpatient clinic were revi...

Journal: :IACR Trans. Symmetric Cryptol. 2016
Céline Blondeau Kaisa Nyberg

Statistical attacks form an important class of attacks against block ciphers. By analyzing the distribution of the statistics involved in the attack, cryptanalysts aim at providing a good estimate of the data complexity of the attack. Recently multiple papers have drawn attention to how to improve the accuracy of the estimated success probability of linear key-recovery attacks. In particular, t...

Journal: :IACR Cryptology ePrint Archive 2004
Nicolas Courtois

In this paper we introduce the method of bi-linear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased characteristics that combine for an arbitrary number of rounds. In particular, we present a practical attack on DES based on a 1-round invariant, the fastest known based on such invariant, and about as fast as the best Matsui’s attack. F...

2002
Piotr ARABAS Krzysztof MALINOWSKI P. Arabas K. Malinowski

The subject of this work is the defence planning of a point target against an air attack. The defence system is decomposed into a number of sectors. A direct method of coordination is used at the upper level, while the sectors use a discretetime event-based model and the description of uncertainty by multiple scenarios of an attack. The resulting problems are solved using linear programming. A ...

Journal: :IACR Cryptology ePrint Archive 2014
Shazia Afreen

Achterbahn stream cipher is proposed as a candidate for ECRYPT eSTREAM project which deals with key of length 80-bit. The linear distinguishing attack,which aims at distinguishing the keystream from purely random keystream,is employed to Achterbahn stream cipher. A linear distinguishing attack is based on linear sequential circuit approximation technique which distinguishes statistical bias in ...

2006
Joo Yeon Cho Josef Pieprzyk

We present a distinguishing attack against SOBER-128 with linear masking. We found a linear approximation which has a bias of 2−8.8 for the non-linear filter. The attack applies the observation made by Ekdahl and Johansson that there is a sequence of clocks for which the linear combination of some states vanishes. This linear dependency allows that the linear masking method can be applied. We a...

2003
Nicolas Courtois Willi Meier

A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f . Their security is usually studied in terms of correlation attacks, that can be seen as solving a system of multivariate linear equations, true with some probability. At ICISC’02 this approach is extended to systems of higher-degree multivariate equations, and gives an attack in 2 ...

Journal: :Australian Computer Journal 1999
Jovan Dj. Golic Andrew J. Clark Ed Dawson

The generalized inversion attack on nonlinear filter generators is developed and analyzed by the theory of critical branching processes. Unlike the inversion attack which requires that the filter function be linear in the first or the last input variable, this attack can be applied for any filter function. Both theory and systematic experiments conducted show that its time complexity remains cl...

2007
Daniel J. Bernstein

Fix i and k with k = 2i−1. This paper presents a generalizedbirthday attack that uses a machine of size 2 for time 2 to find (m1, . . . , mk) such that f1(m1) + · · ·+ fk(mk) mod 2 = 0. The exponents 2/(2i + 1) and 1/(2i + 1) are smaller than the exponents for Wagner’s original generalized-birthday attack. The improved attack also allows a linear tradeoff between time and success probability, a...

Journal: :IACR Cryptology ePrint Archive 2008
Zhengjun Cao

We present a birthday attack against DES. It is entirely based on the relationship Li+1 = Ri and the simple key schedule in DES. It requires about 2 ciphertexts of the same R16, encrypted by the same key K. We conjecture it has a computational complexity of 2. Since the requirement for the birthday attack is more accessible than that for Differential cryptanalysis, Linear cryptanalysis or Davie...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید