Results 251 to 260 of about 1,639 (282)
Known-Key Distinguisher on Full PRESENT [PDF]
Lecture Notes in Computer Science, 2015 In this article, we analyse the known-key security of the standardized PRESENT lightweight block cipher. Namely, we propose a known-key distinguisher on the full PRESENT, both 80- and 128-bit key versions.
Thomas Peyrin +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the American Chemical Society, 2016
The energy change per electron in a chemical or physical transformation, ΔE/n, may be expressed as Δχ̅ + Δ(VNN + ω)/n, where Δχ̅ is the average electron binding energy, a generalized electronegativity, ΔVNN is the change in nuclear repulsions, and Δω is the change in multielectron interactions in the process considered. The last term can be obtained by
Martin, Rahm, Roald, Hoffmann
openaire +2 more sources
The energy change per electron in a chemical or physical transformation, ΔE/n, may be expressed as Δχ̅ + Δ(VNN + ω)/n, where Δχ̅ is the average electron binding energy, a generalized electronegativity, ΔVNN is the change in nuclear repulsions, and Δω is the change in multielectron interactions in the process considered. The last term can be obtained by
Martin, Rahm, Roald, Hoffmann
openaire +2 more sources
Distinguisher and Related-Key Attack on the Full AES-256 [PDF]
Lecture Notes in Computer Science, 2009 peer reviewedIn this paper we construct a chosen-key distinguisher and a related-key attack on the full 256-bit key AES. We define a notion of differential q -multicollision and show that for AES-256 q-multicollisions can be constructed in time q·267 ...
Ivica Nikolic +2 more
exaly +3 more sources
Canadian Journal of Mathematics, 1982
This paper introduces a class of domains which we hope to show merits some attention.Definition. The domain R is said to be a distinguished domain if for any 0 ≠ z ∈ K, the quotient field of R, (1 : z) does not consist entirely of zero divisors modulo (1 : z–l). (Note: Here we use the fact that a zero module has no zero divisors.
Heitmann, Raymond C., McAdam, Stephen
openaire +1 more source
This paper introduces a class of domains which we hope to show merits some attention.Definition. The domain R is said to be a distinguished domain if for any 0 ≠ z ∈ K, the quotient field of R, (1 : z) does not consist entirely of zero divisors modulo (1 : z–l). (Note: Here we use the fact that a zero module has no zero divisors.
Heitmann, Raymond C., McAdam, Stephen
openaire +1 more source
DISTINGUISHABILITY AND INVARIANCE
Statistics & Risk Modeling, 1984The authors give some sufficient conditions under which the weak topology and the Hellinger topology of a family of probability distributions coincide. The result relies on the existence of an invariant distance for the parameter space. It is shown that for a large class of homogeneous spaces an invariant metric can be defined by means of the Hellinger
Milbrodt, H., Strasser, H.
openaire +2 more sources
The bidual of a distinguished Fr�chet space need not be distinguished
Archiv der Mathematik, 1991A locally convex space E is called distinguished if its strong dual \((E',\beta (E',E))\) is barrelled. In 1954, A. Grothendieck posed the problem, whether the bidual of a distinguished Fréchet space is again distinguished. In this note we give a negative answer to that question.
Bonet, José +2 more
openaire +1 more source
Distinguishability Operations and Closures
Fundamenta Informaticae, 2016Given a language L, we study the language of words D(L), that distinguish between pairs of different left quotients of L. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. For the case of regular languages,
Cezar Câmpeanu +2 more
openaire +2 more sources
Fuzzy hamming distinguishability
2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), 2017Back in 1967 the Croat linguist Ž. Muljacic had used a fuzzy generalization of the Hamming distance between binary strings to classify Romance languages. In 1956 Cl. Shannon had introduced the notion of codeword distinguishability in zero-error information theory. Distance and distinguishability are subtly different notions, even if, with distances as
Laura Franzoi, Andrea Sgarro
openaire +2 more sources
Distinguishability in Abstract Argumentation
Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning, 2021In abstract argumentation, the admissible semantics can be said to distinguish the preferred semantics in the sense that argumentation frameworks with the same admissible extensions also have the same preferred extensions. In this paper we present an exhaustive study of such distinguishability relationships, including those between sets of semantics ...
Isabelle Kuhlmann +4 more
openaire +1 more source
Deep-Learning-Based Neural Distinguisher for Format-Preserving Encryption Schemes FF1 and FF3 [PDF]
Electronics (Switzerland)Distinguishing data that satisfy the differential characteristic from random data is called a distinguisher attack. At CRYPTO’19, Gohr presented the first deep-learning-based distinguisher for round-reduced SPECK.
Kyung Bae Jang +2 more
exaly +2 more sources