搜索结果: 1-15 共查到“军队指挥学 collisions”相关记录37条 . 查询时间(0.062 秒)
MiMC and GMiMC are families of MPC-friendly block ciphers and hash functions. In this note, we show that the block ciphers MiMC-2n/n2n/n (or Feistel-MiMC) and univariate GMiMC are vulnerable to an att...
Plaintext Recovery Attacks against XTS Beyond Collisions
XTS Storage encryption Mode of operation
2019/7/17
XTS is an encryption scheme for storage devices standardized by IEEE and NIST. It is based on Rogaway's XEX tweakable block cipher and is known to be secure up to the collisions between the blocks, th...
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
time-memory trade-off representations parallel collision search
2019/7/15
For enabling post-quantum cryptanalytic experiments on a meaningful scale, there is a strong need for low-memory algorithms. We show that the combination of techniques from representations, multiple c...
From Collisions to Chosen-Prefix Collisions - Application to Full SHA-1
hash function cryptanalysis chosen-prefix collision
2019/5/13
A chosen-prefix collision attack is a stronger variant of a collision attack, where an arbitrary pair of challenge prefixes are turned into a collision. Chosen-prefix collisions are usually significan...
A kk-collision for a compressing hash function HH is a set of kk distinct inputs that all map to the same output. In this work, we show that for any constant kk, Θ(N12(1−12k−1))Θ(N12(1W...
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness
post-quantum cryptography one-way permutation one-way trapdoor permutation
2018/11/12
Since the celebrated work of Impagliazzo and Rudich (STOC 1989), a number of black-box impossibility results have been established. However, these works only ruled out classical black-box reductions a...
Collisions and Semi-Free-Start Collisions for Round-Reduced RIPEMD-160
RIPEMD-160 semi-free-start collision collision
2017/8/29
In this paper, we propose an improved cryptanalysis of the double-branch hash function RIPEMD-160 standardized by ISO/IEC. Firstly, we show how to theoretically calculate the step differential probabi...
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
collision resistance multi collisions commitments
2017/6/1
A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a x1≠x2x1≠x2 s.t. h(x1)=h(x2)h(x1)=h(x2). Collision resistant hash functions are on...
In this paper we explore the intriguing factors involved in the non one-one nature of the RC4, and explore new techniques and present interesting findings regarding the same. The first part of this pa...
Finding collisions for MD4 hash algorithm using hybrid algorithm
Evolutionary algorithm hill climbing hash algorithm
2016/1/9
The modification of message that meets the sufficient conditions
for collision is found in the last step of differential attack proposed by
Wang et all. (2005) on MD4 hash algorithm. Here we show ho...
Improving Local Collisions: New Attacks on Reduced SHA-256
hash functions SHA-2 cryptanalysis
2015/12/31
In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and show how to turn them into collisions. We present a collision attack on 28 steps of the hash function with pr...
Finding State Collisions in the Authenticated Encryption Stream Cipher ACORN
CAESAR Authenticated encryption AEAD
2015/12/23
This paper analyzes the authenticated encryption algorithm
ACORN, a candidate in the CAESAR cryptographic competition. We
identify weaknesses in the state update function of ACORN which result
in c...
Multi-user collisions: Applications to Discrete Logs, Even-Mansour and Prince
Collision-based attacks discrete-log
2014/3/6
In this paper, we investigate the multi-user setting both in public-key and in secret-key cryptanalytic applications. In this setting, the adversary tries to recover keys of many users in parallel mor...
Limited-birthday Distinguishers for Hash Functions - Collisions Beyond the Birthday Bound can be Meaningful
hash function compression function distinguisher
2014/3/7
In this article, we investigate the use of limited-birthday distinguishers to the context of hash functions. We first provide a proper understanding of the limited-birthday problem and demonstrate its...
Time-memory Trade-offs for Near-collisions
secret-key cryptography Hash function near-collision
2013/2/21
In this work we consider generic algorithms to find near-collisions for a hash function. If we consider only hash computations, it is easy to compute a lower-bound for the complexity of near-collision...