搜索结果: 1-11 共查到“军事学 ideal cipher”相关记录11条 . 查询时间(0.046 秒)
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
Secret-Key Cryptography Generic Group Model Non-Uniformity
2018/3/5
The random-permutation model (RPM) and the ideal-cipher model (ICM) are idealized models that offer a simple and intuitive way to assess the conjectured standard-model security of many important symme...
We revisit the question of constructing an ideal cipher from a random oracle. Coron et
al. (Journal of Cryptology, 2014) proved that a 14-round Feistel network using random, independent,
keyed round...
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
Hash function Blockcipher
2014/3/12
Preneel et al.~(Crypto 1993) assessed 64 possible ways to construct a compression function out of a blockcipher. They conjectured that 12 out of these 64 so-called PGV constructions achieve optimal se...
How to Construct an Ideal Cipher from a Small Set of Public Permutations
ideal cipher iterated Even-Mansour cipher
2014/3/13
We show how to construct an ideal cipher with $n$-bit blocks and $n$-bit keys (\emph{i.e.} a set of $2^n$ public $n$-bit permutations) from a small constant number of $n$-bit random public permutation...
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model
secret-key cryptography / Related-key attack Ideal-cipher model Blockcipher
2012/3/28
Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictability and collision-resistance) on ...
A Domain Extender for the Ideal Cipher
ideal cipher model indifferentiability tweakable block-cipher
2009/7/22
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is
indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construction is based on a 3-...
The Security of Abreast-DM in the Ideal Cipher Model
hash function provable security collision resistance
2009/6/15
In this paper, we give a security proof for Abreast-DM in
terms of collision resistance, preimage resistance and adaptive preimage
resistance. As old as Tandem-DM, the compression function Abreast-
...
The Random Oracle Model and the Ideal Cipher Model are Equivalent
Random Oracle Model Ideal Cipher Model Equivalent
2009/6/5
The Random Oracle Model and the Ideal Cipher Model are two well known idealised
models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al.
showed that security in ...
The Ideal-Cipher Model, Revisited:An Uninstantiable Blockcipher-Based Hash Function
Ideal-Cipher Model Information-Theoretic Cryptography Random-Oracle Model
2009/2/17
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model
dating back to Shannon [24] and has seen frequent use in proving the security of various
cryptographic objects and proto...
A Practical Limit of Security Proof in the Ideal Cipher Model : Possibility of Using the Constant As a Trapdoor In Several Double Block Length Hash Functions
Hash Function Collision Attack Block Cipher
2009/1/9
Recently, Shoichi Hirose [2] proposed several double block
length (DBL) hash functions. Each DBL hash function uses a constant
which has a role to make the DBL hash function collision-resistant in
...
The Collision Intractability of MDC-2 in the Ideal Cipher Model
Collision Intractability MDC-2 Ideal Cipher Model
2008/12/16
The Collision Intractability of MDC-2 in the Ideal Cipher Model.