搜索结果: 1-15 共查到“军队指挥学 Equivalent”相关记录20条 . 查询时间(0.062 秒)
Linearly equivalent S-boxes and the Division Property
Cryptanalysis Division Property RECTANGLE
2019/2/27
Division property is a new cryptanalysis method introduced by Todo at Eurocrypt'15 that proves to be very efficient on block ciphers and stream ciphers. It can be viewed as a generalization or a more ...
Invisible Sanitizable Signatures and Public-Key Encryption are Equivalent
Sanitizable signatures Invisibility Public-key encryption
2018/4/12
Sanitizable signature schemes are signature schemes which support the delegation of modification rights. The signer can allow a sanitizer to perform a set of admissible operations on the original mess...
An Equivalent Condition on the Switching Construction of Differentially 4-uniform Permutations on $\gf_{2^{2k}}$ from the Inverse Function
Differentially 4-uniform function Substitution box 4-Uniform BFI
2016/1/7
Differentially 4-uniform permutations on \gf22k with high nonlinearity are often chosen as Substitution boxes in block ciphers. Recently, Qu et al. used the powerful switching method to construct such...
Equivalent Key Recovery Attacks against HMAC and NMAC with Whirlpool Reduced to 7 Rounds
HMAC NMAC Whirlpool universal forgery
2016/1/4
A main contribution of this paper is an improved analysis against HMAC instantiating with reduced Whirlpool. It recovers equivalent keys, which are often denoted as Kin and Kout, of HMAC with 7-round ...
On the behaviors of affine equivalent Sboxes regarding differential and linear attacks
Sboxes affine equivalence differential cryptanalysis
2016/1/4
This paper investigates the effect of affine transformations of the Sbox on the maximal expected differential probability MEDP and linear potential MELP over two rounds of a substitution-permutation n...
On permutation polynomials EA-equivalent to the inverse function over GF(2^n)
Inverse function EA-equivalence Permutation polynomial S-box Kloosterman sums
2010/11/16
It is proved that there does not exist a linearized polynomial L(x) 2 F2n[x] such that x−1+L(x) is a permutation on F2n when n≥ 5, which is proposed as a conjecture in [15]. As a consequence, a ...
We show that a generic ring algorithm for breaking RSA in
ZN can be converted into an algorithm for factoring the corresponding
RSA-modulus N. Our results imply that any attempt at breaking RSA
wit...
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 ...
Understanding Phase Shifting Equivalent Keys and Exhaustive Search
Phase Shifting Equivalent Keys Exhaustive Search specific ciphers
2009/6/3
Recent articles [6, 3, 5, 7] introduce the concept of phase shifting
equivalent keys in stream ciphers, and exploit this concept in order to
mount attacks on some speci c ciphers. The idea behind ph...
A Chosen IV Attack Using Phase Shifting Equivalent Keys against DECIM v2
cryptanalysis equivalent keys stream cipher DECIM v2
2009/6/3
DECIM v2 is a stream cipher submitted to the ECRYPT
stream cipher project (eSTREAM) and ISO/IEC 18033-4. No attack
against DECIM v2 has been proposed yet. In this paper, we propose a
chosen IV atta...
The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences
elliptic curve discrete logarithm problem equivalent hard problems elliptic divisibility sequences
2009/6/3
We define three hard problems in the theory of elliptic divisibility
sequences (EDS Association, EDS Residue and EDS Discrete
Log), each of which is solvable in sub-exponential time if and only if t...
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
cryptography computational complexity noninteractive zero-knowledge proofs
2009/6/2
We show that interactive and noninteractive zero-knowledge are equivalent in the `help
model' of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference
string is generated b...
New Zero-knowledge Undeniable Signatures -Forgery of Signature Equivalent to Factorisation
Undeniable signatures Efficient zero-knowledge protocols
2009/4/16
We propose a new zero-knowledge undeniable signature scheme which is based
on the intractability of computing high-order even powers modulo a composite.
The new scheme has a number of desirable prop...
Equivalent Keys in HFE, C*,and variations
Multivariate Quadratic Equations Public Key signature Hidden Field Equations
2009/4/3
In this article, we investigate the question of equivalent keys for two Multivariate Quadratic
public key schemes HFE and C*¡¡ and improve over a previously known result, to appear at
PK...
Equivalent Keys in Multivariate Quadratic Public Key Systems
Public Key signature Hidden Field Equations Stepwise Triangular Systems
2009/3/19
Multivariate Quadratic public key schemes have been suggested back in 1985 by Matsumoto
and Imai as an alternative for the RSA scheme. Since then, several other schemes have
been proposed, for examp...