The application of the concept of linear cryptanalysis to the domain of key-less primitives is largely an open problem. In this paper we, for the first time, propose a model in which its application is meaningful for distinguishing block ciphers. Combining our model with ideas from message modification and reboundlike approaches, we initiate a study of cryptographic primitives with respect to t...

Machine learning has recently started to gain the attention of cryptographic researchers, notably in block cipher cryptanalysis. Most these machine learning-based approaches are black box attacks that cipher-specific. Thus, more research is required understand capabilities and limitations when being used evaluate security. We contribute this body knowledge by investigating capability linear non...

Recently, the U.S National Security Agency has published the specifications of two families of lightweight block ciphers, SIMON and SPECK, on ePrint [2]. The ciphers are developed with optimization towards both hardware and software in mind. While the specification paper discusses design requirements and performance of the presented lightweight ciphers thoroughly, no security assessment is give...

Lightweight cryptography is equipped as security component, to secure those pervasive devices that are security and privacy sensitive. It has been conclusively proven that unprotected cryptographic implementations are vulnerable to side-channel attacks. In practice, area resource smaller than 3,000GE (5,000GE sometimes) may be available for security components in pervasive devices. This paper p...

Abstract. Zorro is an AES-like lightweight block cipher proposed in CHES 2013, which only uses 4 S-boxes per round. The designers showed the resistance of the cipher against various attacks and concluded the cipher has a large security margin. Recently, Guo et. al [1] have given a key recovery attack on full-round Zorro by using the internal differential characteristics. However, the attack onl...

Grover search algorithm is the most representative quantum attack method that threatens security of symmetric key cryptography. If applied to cryptography, level target cryptography can be lowered from n-bit n2-bit. When applying Grover’s block cipher potential attacks, must implemented as circuits. Starting with AES cipher, a number works have been conducted optimize and implement ciphers into...

A quantum computer capable of running the Grover search algorithm, which reduces complexity brute-force attacks by a square root, has potential to undermine security strength symmetric-key cryptography and hash functions. Recently, studies on approaches have proposed analyzing using algorithm in conjunction with optimized circuit implementations for Analyzing cipher (i.e., cryptanalysis) estima...