搜索结果: 1-8 共查到“weak key”相关记录8条 . 查询时间(0.091 秒)
Invariant subspaces (Crypto'11) and subspace trails (FSE'17) are two related recent cryptanalytic approaches that led to new results on, e. g. PRINTCipher and AES. We extend the invariant subspace app...
Correlation Cube Attacks: From Weak-Key Distinguisher to Key Recovery
cryptanalysis cube attack stream cipher
2018/3/7
In this paper, we describe a new variant of cube attacks called correlation cube attack. The new attack recovers the secret key of a cryptosystem by exploiting conditional correlation properties betwe...
Ubiquitous Weak-key Classes of BRW-polynomial Function
weak key polynomial evaluation hash BRW-polynomial
2018/1/12
BRW-polynomial function is suggested as a preferred alternative of polynomial function, owing to its high efficiency and seemingly non-existent weak keys. In this paper we investigate the weak-key iss...
Armknecht and Mikhalev proposed a new stream cipher ‘Sprout’ based on the design
specification of the stream cipher, Grain-128a. Sprout has shorter state size than Grain family with
a round key func...
Weak-Key Leakage Resilient Cryptography
weak key-leakage attacks public-key encryption scheme chosen-ciphertext security
2016/1/25
In traditional cryptography, the standard way of examining the security of a scheme is to
analyze it in a black-box manner, capturing no side channel attacks which exploit various forms
of unintende...
We evaluate the security of the recently proposed authenticated encryption scheme POET with regard to weak keys when its universal hash functions are instantiated with finite field multiplications. ...
Secure Authentication from a Weak Key, Without Leaking Information
secret-key cryptography / authentication privacy amplification weak key password-based identification quantum cryptography
2012/3/30
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. This problem has rec...
Secure Authentication from a Weak Key, Without Leaking Information
authentication privacy amplification weak key password-based identification quantum cryptography
2011/1/21
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. This problem has rec...