Finding the longest impossible differentials is an essential assignment in proceeding impossible differential cryptanalysis. In this paper, we introduce a novel tool to search the longest truncated impossible differentials for word-oriented block ciphers with bijective S-boxes. It costs polynomial time to return a flag indicating whether a truncated differential is impossible under several filt...

Differential and Linear Cryptanalysis are two most popular techniques that have been widely used to attacks block ciphers to reveal its weakness in substitution and permutation network. Most of the block ciphers which are resistant against Differential and Linear Cryptanalysis may not be immune to their latest extensions such as Impossible Differential Cryptanalysis (IDC) and Zero Correlation L...

In the field of symmetric key cryptography, security against distinguishing attacks is one crucial requirements. With advancements in computing capabilities and cryptanalysis techniques recent years, more efficient methods have been proposed for exploring distinguishers using Mixed-Integer Linear Programing (MILP) or satisfiability problem (SAT), thereby updating bounds various ciphers. Piccolo...

In this letter, we show that Fan-Chen-Yeh’s blind signature scheme and Chien-Jan-Tseng’s partially blind signature scheme are vulnerable to the chosen–plaintext attack. We also show that both schemes can be modified so that the chosen– plaintext attack is impossible. But, still Chien-Jan-Tseng’s partially blind signature scheme is vulnerable. It fails to satisfy the partial blindness property. ...

LEA is a symmetric block cipher proposed in 2014. It uses ARX design and its main advantage is the possibility of a fast software implementation on common computing platforms. In this paper we propose a Differential Fault Analysis attack on LEA. By injecting random bit faults in the last round and in the penultimate round, we were able to recover the secret key by using 258 faulty encryptions i...

LAC is one of the candidates to the CAESAR competition. In this paper we present a differential forgery attack on LAC. We study the collection of characteristics following a fixed truncated characteristic, in order to obtain a lower bound on the probability of a differential. We show that some differentials have a probability higher than 2−64, which allows a forgery attack on the full LAC. This...

Camellia is one of the widely used block ciphers, which has been selected as an international standard by ISO/IEC. In this paper, by exploiting some interesting properties of the key-dependent layer, we improve previous results on impossible differential cryptanalysis of reduced-round Camellia and gain some new observations. First, we introduce some new 7-round impossible differentials of Camel...

LBlock is a 64-bit lightweight block cipher which can be implemented in both constrained hardware environments, such as wireless sensor network, and software platforms. In this paper, we study the security of LBlock against a differential fault analysis. Based on a random nibble fault model, we propose two versions of the attack on LBlock. In the first attack, we inject random nibble faults to ...

A well-recognized open conceptual problem in relativistic quantum field theory concerns the relation between measurement and causality. Naive generalizations of rules can allow for superluminal signaling (``impossible measurements''). This raises delineating physically allowed measurements operations. We analyze this issue a recently proposed framework which local (in possibly curved spacetime)...