搜索结果: 1-12 共查到“密码学 Weak-Keys”相关记录12条 . 查询时间(0.156 秒)
Weak Keys in the Rekeying Paradigm: Attacks on COMET-128 and mixFeed
weak keys authenticated encryption comet
2019/8/6
In this article, we analyze two of the NIST Round 1 Candidates for the Lightweight Cryptography Standardization Process: COMET and mixFeed. We show how AEAD modes that are based on rekeying can be mod...
A Uniform Class of Weak Keys for Universal Hash Functions
Universal hash function weak key Wegman-Carter scheme
2017/5/23
In this paper we investigate weak keys of universal hash functions (UHFs) from their combinatorial properties. We find that any UHF has a general class of keys, which makes the combinatorial propertie...
A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys
message authentication codes weak keys entropy
2015/12/31
In this note, we prove lower bounds on the amount of entropy of random sources necessary for
secure message authentication. We consider the problem of non-interactive c-time message authentication
u...
A Guess-and-Determine Attack on Reduced-Round Khudra and Weak Keys of Full Cipher
Cryptography lightweight block cipher
2015/12/18
Khudra is a lightweight block cipher designed for Field Programmable
Gate Array (FPGA) based platforms. The cipher has an
18-round generalized type-2 Feistel structure with 64-bit block size. The
k...
We describe some observed trivially weak keys for the stream cipher RC4.
Keys with repeating patterns are found to be key length invariant. The cause of the problem is the simplistic key dependent st...
On Weak Keys and Forgery Attacks against Polynomial-based MAC Schemes
Universal Hashing MAC Galois/Counter Mode Cycling Attacks Weak Keys
2013/4/18
Universal hash functions are commonly used primitives for fast and secure message authentication in the form of Message Authentication Codes (MACs) or Authenticated Encryption with Associated Data (AE...
A Family of Weak Keys in HFE(and the Corresponding Practical Key-Recovery)
Cryptanalysis multivariate cryptography HFE
2009/12/29
The HFE (Hidden Field Equations) cryptosystem is one of the most interesting
public-key multivariate scheme. It has been proposed more than 10 years ago by
Patarin and seems to withstand the attacks...
In this paper we revisit Wiener's method (IEEE-IT 1990) of continued fraction (CF) to
find new weaknesses in RSA. We consider RSA with N = pq, q < p < 2q, public encryption exponent
e and private de...
This paper presents an analysis of the PES cipher in a similar
setting as done by Daemen et al. at Crypto’93 for IDEA. The following
results were obtained for 8.5 round PES: a linear weak-key class ...
The public key cryptosystem MST1 has been introduced in [9]. Its
security relies on the hardness of factoring with respect to wild logarithmic
signatures. To identify ‘wild-like’ logarithmic signatu...
Weak keys of the Diffie Hellman key exchange II: Pairing based schemes on on elliptic curves
Diffie Hellman key Pairing based schemes elliptic curves
2009/1/14
This paper develops a cryptanalysis of the pairing based Diffie Hellman (DH) key
exchange schemes which have found important applications as in the tripartite exchange
scheme proposed in [1]. The an...
Weak keys of the Diffie-Hellman key exchange I
Discrete logarithms Diffie Hellman key exchange Finite fields
2009/1/14
This paper investigates the Diffie-Hellman key exchange scheme over the group F¤
pm of nonzero elements of finite fields and shows that there exist exponents k, l satisfying
certain conditions calle...
