搜索结果: 1-15 共查到“知识库 军事学 Explicit”相关记录23条 . 查询时间(0.14 秒)
Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model
quantum random oracle model key encapsulation mechanism explicit rejection
2019/1/26
The recent post-quantum cryptography standardization project launched by NIST increased the interest in generic key encapsulation mechanism (KEM) constructions in the quantum random oracle (QROM). Bas...
Four-state Non-malleable Codes with Explicit Constant Rate
information theoretic cryptography non-malleability
2017/9/26
Non-malleable codes (NMCs), introduced by Dziembowski, Pietrzak and Wichs (ITCS 2010), generalize the classical notion of error correcting codes by providing a powerful guarantee even in scenarios whe...
Explicit Non-Malleable Codes Resistant to Permutations
Non-malleable Codes Explicit Construction Information Theoretic
2016/1/23
The notion of non-malleable codes was introduced as a relaxation of standard error-correction and error-detection. Informally, a code is non-malleable if the message contained in a modified codeword...
Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal
hash chains pebbling in-place algorithms
2016/1/23
We present explicit optimal binary pebbling algorithms for reversing one-way hash chains. For a hash chain of length 2k , the number of hashes performed in each output round does not exceed dk/2e, ...
Explicit endomorphism of the Jacobian of a hyperelliptic function field of genus 2 using base field operations
public-key cryptography hyperelliptic curves
2016/1/9
We present an efficient endomorphism for the Jacobian of a curve C of genus 2 for divisors having a Non
disjoint support. This extends the work of Costello in [12] who calculated explicit formul?for ...
Explicit Non-malleable Codes Resistant to Permutations and Perturbations
Non-malleable Codes Explicit Construction Information Theoretic
2016/1/6
A non-malleable code protects messages against various classes of tampering. Informally, a
code is non-malleable if the message contained in a tampered codeword is either the original
message, or a ...
A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two
Modular addition modulo a power of two Linear probability Symmetric cipher
2016/1/5
Linear approximations of modular addition modulo a power of two was studied by Wallen in 2003. He presented an efficient algorithm for computing linear probabilities of modular addition. In 2013 Scult...
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
public-key cryptography / Hyperelliptic Curves Genus 2 Order Computation
2012/6/14
The use of (hyper)elliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test wheth...
Generic Side-channel Distinguisher Based on Kolmogorov-Smirnov Test: Explicit Construction and Practical Evaluation
Side-Channel Cryptanalysis Power Analysis Attack Distinguisher
2012/6/14
Construction and evaluation of efficient distinguishers with broad generality is one fundamental problem in the area of side-channel cryptanalysis. Due to their capabilities to deal with general corre...
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
public-key cryptography / Hyperelliptic Curves Genus 2 Order Computation Ordinary Curves Pairing-Friendly Constructions Cocks-Pinch Method Brezing-Weng Method.
2012/3/22
The use of (hyper)elliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test wheth...
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
public-key cryptography / Hyperelliptic Curves Genus 2 Order Computation Ordinary Curves Pairing-Friendly Constructions Cocks-Pinch Method Brezing-Weng Method.
2012/3/21
The use of (hyper)elliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test wheth...
Generic Side-channel Distinguisher Based on Kolmogorov-Smirnov Test: Explicit Construction and Practical Evaluation
Side-Channel Cryptanalysis Power Analysis Attack Distinguisher
2012/8/28
Construction and evaluation of efficient distinguishers with broad generality is one fundamental problem in the area of side-channel cryptanalysis. Due to their capabilities to deal with general corre...
OBSERVATION: An explicit form for a class of second preimages for any message M for the SHA-3 candidate Keccak
hash functions keccak sha-3
2012/3/28
In this short note we give an observation about the SHA- 3 candidate Keccak[r,c,d], where the parameters r,c and d receive values from the formal proposal for the Keccak hash function (with the hash o...
OBSERVATION: An explicit form for a class of second preimages for any message M for the SHA-3 candidate Keccak
hash functions keccak sha-3
2011/6/9
In this short note we give an observation about the SHA- 3 candidate Keccak[r,c,d], where the parameters r,c and d receive values from the formal proposal for the Keccak hash function (with the hash o...
Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation
Explicit Formulas Real Hyperelliptic Curves Affine Representation
2011/3/11
We present a complete set of efficient explicit formulas for arithmetic
in the degree 0 divisor class group of a genus two real hyperelliptic curve
givenin affine coordinates. In addition to formula...