Quantum algorithms are raising concerns in the field of cryptography all over world. A growing number symmetric have been attacked quantum setting. Type-3 generalized Feistel scheme (GFS) and unbalanced with expanding functions (UFS-E) common schemes, which often used cryptographic analysis design. We propose distinguishing attacks on GFS UFS-E chosen plaintext attack The results key recovery b...

The most recent results and some of the open key questions on the evolution of early-type galaxies are reviewed in the general cosmological context of massive galaxy formation.

We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby and C. Rackoff have completely solved the cases m ¿ 2: the schemes are secure against all adaptive chosen plaintext attacks (CPA-2) when k ≥ 3 and against all adaptive chosen plaintext and chosen ciphertext attacks (...

4 A graph is said to be d-distinguishable if there exists a d-labeling of its vertices which is 5 only preserved by the identity map. The distinguishing number of a graph G is the smallest 6 number d for which G is d-distinguishable. We show that the distinguishing number of trees 7 and forests can be computed in linear time, improving the previously known O(n log n) time 8 algorithm. 9

In this paper, the security of Advanced Encryption Standard-based authenticated encryption schemes, including AEGIS family, Tiaoxin-346, and Rocca by mixed integer linear programming tools is examined. Specifically, for initialisation phase AEGIS, Rocca, against differential attacks integral evaluated estimating lower bounds number active S-boxes utilising division property, respectively. addit...

This paper introduces the related-key boomerang and the related-key rectangle attacks. These new attacks can expand the cryptanalytic toolbox, and can be applied to many block ciphers. The main advantage of these new attacks, is the ability to exploit the related-key model twice. Hence, even ciphers which were considered resistant to either boomerang or related-key differential attacks may be b...

Adaptive techniques based on machine learning and data mining are gaining relevance in selfmanagement and self-defense for networks and distributed systems. In this paper, we focus on early detection and stopping of distributed flooding attacks and network abuses. We extend the framework proposed by Zhang and Parashar (2006) to cooperatively detect and react to abnormal behaviors before the tar...

This work introduces a new concept of attack against traitor tracing schemes. We call attacks of this type Pirates 2.0 attacks as they result from traitors collaborating together in a public way. In other words, traitors do not secretly collude but display part of their secret keys in a public place; pirate decoders are then built from this public information. The distinguishing property of Pir...

Eighty treatment-seeking adults age 60 or over with panic disorder, generalized anxiety disorder, and mixed anxiety states (generalized anxiety with panic attacks, panic disorder with secondary generalized anxiety) completed a clinical assessment and battery of self report measures. Several hypotheses were tested from the domains of distinguishing symptoms, associated features, and rates of com...

RC4+ stream cipher was proposed by Maitra et. al. at Indocrypt 2008. It was claimed by the authors that this new stream cipher is designed to overcome all the weaknesses reported on the alleged RC4 stream cipher. In the design specifications of RC4+, the authors make use of an 8-bit design parameter called pad which is fixed to the value 0xAA. The first Distinguishing Attack on RC4+ based on th...