搜索结果: 1-13 共查到“军事学 generic attacks”相关记录13条 . 查询时间(0.174 秒)
Hash combiners are a practical way to make cryptographic hash functions more tolerant to future attacks and compatible with existing infrastructure. A combiner combines two or more hash functions in a...
Generic Attacks against Beyond-Birthday-Bound MACs
Modes of operation Cryptanalysis Message Authentication Codes
2018/6/5
In this work, we study the security of several recent MAC constructions with provable security beyond the birthday bound. We consider block-cipher based constructions with a double-block internal stat...
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions
Functional graph Hash-based MAC Hash combiner
2018/5/2
We look into attacks involving iteratively evaluating identical mappings many times. The functional graph of a random mapping also involves iteratively evaluating the mapping. These attacks essentiall...
In this paper we study the security of hash-based MAC algorithms (such as HMAC and NMAC) above the birthday bound. Up to the birthday bound, HMAC and NMAC are proven to be secure under reasonable assu...
The security of HMAC (and more general hash-based MACs) against state-recovery and universal forgery attacks was very recently shown to be suboptimal, following a series of surprising results by Leure...
This paper presents a efficient proposal for iterating hash function
to prevent the main of generic attacks such as Multicollisions Attack,Second
Preimage Attack and Herding Attack.Based on this pro...
This paper presents a efficient proposal for iterating hash function
to avert the generic attacks which mainly includes Multicollisions Application to
Cascaded Constructions ,Second Preimage Attacks...
Generic Attacks on Misty Schemes -5 rounds is not enough-
Misty permutations pseudo-random permutations generic attacks on encryption schemes
2009/8/25
Misty schemes are classic cryptographic schemes used to construct pseudo-random permu-
tations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to n bits. These d
permutatio...
Generic attacks on Alternating Unbalanced Feistel Schemes
Unbalanced Feistel permutations pseudo-random permutations generic attacks on encryption schemes
2009/6/23
Generic attacks against classical (balanced) Feistel schemes,
unbalanced Feistel schemes with contracting functions and unbalanced
Feistel schemes with expanding functions have been studied in [12],...
Generic Attacks on Feistel Schemes-Extended Version-
Feistel permutations pseudo-random permutations generic attacks on encryption schemes
2009/6/2
Therefore we recommend in Cryptography to use
Feistel schemes with at least 6 rounds in the design of pseudo-random permutations.
We will also show in this paper that it is possible to distinguish m...
Generic Attacks for the Xor of k Random Permutations
Pseudorandom functions pseudorandom permutations Luby-Rackoff backwards
2009/6/2
Xoring the output of k permutations, k 2 is a very simple way to construct pseudo-random
functions (PRF) from pseudo-random permutations (PRP). Moreover such construction has
many applications in ...
Short Signatures, Provable Security, Generic Attacks and Computational Security of Multivariate Polynomial Schemes such as HFE, Quartz and Sflash
Generic signature schemes short signatures provable security
2009/3/27
The object of this paper is the concrete security of recent
multivariate signature schemes. A major challenge is to reconcile some
”tricky” ad-hoc constructions that allow to make short signatures, ...
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
Unbalanced Feistel permutations pseudo-random permutations Block ciphers
2008/8/14
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bits. At each round...