In this paper, we describe new techniques in meet-in-themiddle attacks. Our basic technique is called a linear key sieve since it exploits as filtering conditions linear dependencies between key bits that are guessed from both sides of the attack. This should be contrasted with related previous attacks, which only exploited a linear state sieve (i.e., linear dependencies between state bits that...

Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant. In this paper we apply the enhanced differential-linear cryptanalysis to Serpent. The resulting attack is the best known attack on 11-round Serpent. It r...

This short paper introduces a new project studying at the intersection of threat analysis using attack trees and interactive theorem proving using linear logic. The project proposes a new semantics of attack trees in dialectica spaces, a well-known model of intuitionistic linear logic, which offers two new branching operators to attack trees. Then by exploiting the Curry-Howard-Lambek correspon...

The six-degree equations of flight in their classic form do not provide a proper physical perception due to a number of interferences. Nor do they render visible the important role of attack angles. In this study, attempts have been made to develop a complete set of 3D acceleration equations from the equations of normal and tangential acceleration αN=vωv, αt=v ̇. For this purpose, a coordinate s...

The six-degree equations of flight in their classic form do not provide a proper physical perception due to a number of interferences. Nor do they render visible the important role of attack angles. In this study, attempts have been made to develop a complete set of 3D acceleration equations from the equations of normal and tangential acceleration αN=vωv, αt=v ̇. For this purpose, a coordinate s...

Attack trees profile the sub-goals of the proponent of an attack. Attack trees have a variety of semantics depending on the kind of question posed about the attack, where questions are captured by an attribute domain. We observe that one of the most general semantics for attack trees, the multiset semantics, coincides with a semantics expressed using linear logic propositions. The semantics can...

As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Linear HB(NLHB) protocol. In contrast to HB, NLHB relies on the complexity of decoding a class of non-linear codes to render the passive attacks proposed against HB ineffective. Based on the fact that there has been no pa...