搜索结果: 1-15 共查到“密码学 XOR”相关记录24条 . 查询时间(0.065 秒)
Low-Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem
Even-Mansour Cryptanalysis 3-XOR
2019/8/19
The iterated Even-Mansour construction is an elegant construction that idealizes block cipher designs such as the AES. In this work we focus on the simplest variant, the 2-round Even-Mansour construct...
In this short report we present a short linear program for AES MixColumn with 94 XOR gates.
Let σσ be some positive integer and C⊆{(i,j):1≤iory behind finding a lower bound on the number of distinct blocks P1,…,Pσ∈{0,1}nP1,…,Pσ∈{0,1}n satisfying a s...
Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the χ2 Method
random permutation indifferentiable security χ2 method
2018/3/6
The construction XORPXORP (bitwise-xor of outputs of two independent nn-bit random permutations) has gained broad attention over the last two decades due to its high security.
Linear Regression Side Channel Attack Applied on Constant XOR
linear regression side channel attack constant XOR
2017/12/20
Linear regression side channel attack (LRA) used to be known as a robust attacking method as it makes use of independent bits leakage. This leakage assumption is more general than Hamming weight/ Hamm...
Lightweight MDS Serial-type Matrices with Minimal Fixed XOR Count
MDS matrix Serial matrix lightweight cryptography
2017/11/13
Many block ciphers and hash functions require the diffusion property of Maximum Distance Separable (MDS) matrices. Serial matrices with the MDS property obtain a trade-off between area requirement and...
Rotational-XOR Cryptanalysis of Reduced-round SPECK
Rotational-XOR cryptanalysis ARX Weak keys
2017/10/30
In this paper we formulate a SAT/SMT model for Rotational-XOR (RX) cryptanalysis in ARX primitives for the first time. The model is successfully applied to the block cipher family Speck, and distingui...
Why Attackers Lose: Design and Security Analysis of Arbitrarily Large XOR Arbiter PUFs
secret-key cryptography XOR
2017/9/26
In a novel analysis, we formally prove that arbitrarily many Arbiter PUFs can be combined into a stable XOR Arbiter PUF. To the best of our knowledge, this design cannot be modeled by any known oracle...
Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps
Pseudorandom functions related-key security multilinear maps
2017/6/2
Due to the vast number of successful related-key attacks against existing block-ciphers, related-key security has become a common design goal for such primitives. In these attacks, the adversary is no...
Next, we perform a quantum security analysis of the construction, and prove that it achieves security up to min{|K|1/2/r,|X|}min{|K|1/2/r,|X|} queries. The analysis relies on a generic characterizatio...
Direct Construction of Lightweight Rotational-XOR MDS Diffusion Layers
Lightweight Cryptography MDS Diffusion Layers Bit-wise Circulant Matrices
2016/12/7
As a core component of Substitution-Permutation Networks, diffusion layer is mainly introduced by matrices from maximum distance separable (MDS) codes. Surprisingly, up to now, most constructions of M...
A deeper understanding of the XOR count distribution in the context of lightweight cryptography
lightweight cryptography finite field multiplication basis of finite field
2016/5/3
In this paper, we study the behavior of the XOR count distributions under different bases of finite field. XOR count of a field element is a simplified metric to estimate the hardware implementation c...
New Attacks on the Concatenation and XOR Hash Combiners
Hash function cryptanalysis concatenation combiner
2016/2/23
We study the security of the concatenation combiner H1(M)kH2(M)
for two independent iterated hash functions with n-bit outputs that are
built using the Merkle-Damgⅹard construction. In 2004 Joux sho...
FleXOR: Flexible garbling for XOR gates that beats free-XOR
cryptographic protocols garbled circuits
2016/1/9
Most implementations of Yao’s garbled circuit approach for 2-party secure computation
use the free-XOR optimization of Kolesnikov & Schneider (ICALP 2008). We introduce an
alternative technique call...
Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
Block ciphers Pseudorandomness
2016/1/3
This paper discusses provable security of two types of cascade encryptions. The first construction \CEl, called l-cascade encryption, is obtained by sequentially composing l blockcipher calls with ind...