نتایج جستجو برای: distinguishing attacks

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

2017
Mehraj Ali E. Vinoth Kumar A. John Sanjeev Kumar M. K. Thakur V. Saxena J. P. Gupta T. Tokar T. Kanocz D. Levicky T. D. Hien Y. W. Chen Z. Nakao S. A. K. Mostafa A. S. Tolba F. M. Abdelkader H. M. Elhindy

With increasing use of internet and effortless copying, tempering and distribution of digital data, copyright protection for multimedia data has become an important issue. Digital watermarking emerged as a tool for protecting the multimedia data from copyright infringement. In digital watermarking an imperceptible signal "mark" is embedded into the host image, which uniquely identifie...

2009
Boštjan Kaluža Erik Dovgan Tea Tušar Matjaž Gams

Access control is an important security activity that prevents undesired persons from entering secure buildings or perimeters. The advanced risk analysis presented in this paper enables distinguishing between acceptable and undesired entries based on several entry sensors, such as fingerprint readers, and intelligent methods that learn behavior from previous entries. We have extended the intell...

Journal: :Journal of neurology, neurosurgery, and psychiatry 2004
A McGonigal A J C Russell A K Mallik M Oto R Duncan

BACKGROUND Distinguishing epileptic from psychogenic non-epileptic seizures (PNES) often requires video electroencephalography (EEG) recording. Inpatient recording is a limited resource; some evidence suggests that short term video EEG (SVEEG) is useful, but its role in practice has yet to be evaluated. OBJECTIVE To assess the usefulness of SVEEG in the diagnosis of attack disorders. METHOD...

2008
Simon Fischer Shahram Khazaei Willi Meier

A recent framework for chosen IV statistical distinguishing analysis of stream ciphers is exploited and formalized to provide new methods for key recovery attacks. As an application, a key recovery attack on simplified versions of two eSTREAM Phase 3 candidates is given: For Grain-128 with IV initialization reduced to up to 180 of its 256 iterations, and for Trivium with IV initialization reduc...

2011
Marine Minier María Naya-Plasencia Thomas Peyrin

In this article, we provide the first independent analysis of the (2-round tweaked) 256-bit version of the SHA-3 candidate SHAvite-3. By leveraging recently introduced cryptanalysis tools such as rebound attack or Super-Sbox cryptanalysis, we are able to derive chosen-related-salt distinguishing attacks on the compression function on up to 8 rounds (12 rounds in total) and free-start collisions...

2004
Frédéric Muller

In this paper, we analyze the security of the stream cipher Helix, recently proposed at FSE’03. Helix is a high-speed asynchronous stream cipher, with a built-in MAC functionality. We analyze the differential properties of its keystream generator and describe two new attacks. The first attack requires 2 basic operations and processes only 2 words of chosen plaintext in order to recover the secr...

2011
Christophe Clavier Benoit Feix Georges Gagnerot Mylène Roussellet Vincent Verneuil

Embedded exponentiation techniques have become a key concern for security and efficiency in hardware devices using public key cryptography. An exponentiation is basically a sequence of multiplications and squarings, but this sequence may reveal exponent bits to an attacker on an unprotected implementation. Although this subject has been covered for years, we present in this paper new exponentia...

2015
Benoit Cogliati Yannick Seurin

The iterated Even-Mansour cipher is a construction of a block cipher from r public permutations P1, . . . , Pr which abstracts in a generic way the structure of key-alternating ciphers. The indistinguishability of this construction from a truly random permutation by an adversary with oracle access to the inner permutations P1, . . . , Pr has been investigated in a series of recent papers. This ...

Journal: :Wireless Communications and Mobile Computing 2016
Le Wang Alexander M. Wyglinski

In a wireless network environment, all the users are able to access the wireless channel. Thus, if malicious users exploit this feature by mimicking the characteristics of a normal user or even the central wireless access point (AP), they can intercept almost all the information through the network. This scenario is referred as a Man-in-the-middle (MITM) attack. In the MITM attack, the attacker...

Journal: :transactions on combinatorics 0
fatemeh sadat mousavi university of zanjan massomeh noori university of zanjan

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...

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

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