搜索结果: 1-15 共查到“军事学 Error”相关记录58条 . 查询时间(0.078 秒)
Timing attacks on Error Correcting Codes in Post-Quantum Secure Schemes
Post-Quantum Cryptography Decryption Failures Side-Channel Attacks
2019/3/20
While error correcting codes (ECC) have the potential to significantly reduce the failure probability of post-quantum schemes, they add an extra ECC decoding step to the algorithm. As this additional ...
Fault Attack Countermeasures for Error Samplers in Lattice-Based Cryptography
Lattice-based cryptography fault attacks countermeasures
2019/3/1
Lattice-based cryptography is one of the leading candidates for NIST's post-quantum standardisation effort, providing efficient key encapsulation and signature schemes. Most of these schemes base thei...
Constant-time BCH Error-Correcting Code
Lattice-based cryptography Decryption failures Error-correcting codes
2019/2/25
Decryption failure is a common phenomenon in most lattice-based public-key schemes. To reduce the rate of decryption failure, application of error correction code can be helpful. However, the literatu...
Sampling the Integers with Low Relative Error
Sampling Discrete Gaussians Lattice-based Cryptography
2019/1/26
Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more oft...
Error Amplification in Code-based Cryptography
post-quantum cryptography MDPC timing attack
2019/1/2
Code-based cryptography is one of the main techniques enabling cryptographic primitives in a post-quantum scenario. In particular, the MDPC scheme is a basic scheme from which many other schemes have ...
The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
Lattice cryptography Ring-LWE Error Correcting Codes
2018/12/3
Current estimation techniques for the probability of decryption failures in Ring/Mod-LWE/LWR based schemes assume independence of the failures in individual bits of the transmitted message to calculat...
Distinguishing Error of Nonlinear Invariant Attacks
correlation uniform random function uniform random permutation
2018/11/7
Linear cryptanalysis considers correlations between linear input and output combiners for block ciphers and stream ciphers. Daeman and Rijmen (2007) had obtained the distributions of the correlations ...
Keeping or Losing Tiny-Error Correctness of Cryptosystems Implemented by Secure Pseudorandom Generators
foundations implementation pseudo-randomness
2018/8/2
Randomness is essential but expensive resource for cryptography, and secure (and efficient) implementations of randomness using pseudorandom generators (PRGs) are much concerned in this area. On the o...
Error-Detecting in Monotone Span Programs with Application to Communication Efficient Multi-Party Computation
MPC cryptographic protocols
2018/5/22
Recent improvements in the state-of-the-art of MPC for non-full-threshold access structures introduced the idea of using a collision-resistant hash functions and redundancy in the secret-sharing schem...
Error Estimation of Practical Convolution Discrete Gaussian Sampling
Discrete Gaussian Sampling convolution theorem lattice
2018/4/4
Discrete Gaussian Sampling is a fundamental tool in lattice cryptography which has been used in digital signatures, identify-based encryption, attribute-based encryption, zero-knowledge proof and full...
Analysis of Error-Correcting Codes for Lattice-Based Key Exchange
post-quantum key exchange NewHope Simple error-correcting codes
2018/3/7
Lattice problems allow the construction of very efficient key exchange and public-key encryption schemes. When using the Learning with Errors (LWE) or Ring-LWE (RLWE) problem such schemes exhibit an i...
"HILA5 Pindakaas": On the CCA security of lattice-based encryption with error correction
Post-quantum cryptography KEM RLWE
2017/12/19
We show that HILA5 is not secure against chosen-ciphertext attacks. Specifically, we demonstrate a key-recovery attack on HILA5 using an active attack on reused keys. The attack works around the error...
Decoding Linear Codes with High Error Rate and its Impact for LPN Security
Decoding binary linear codes BJMM Nearest Neighbors
2017/11/28
Technically, our improvement comes from the heavy use of Nearest Neighbor techniques in all steps of the construction, whereas the BJMM-algorithm can only take advantage of Nearest Neighbor search in ...
Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs
Higher-Order Alphabet PUFs Error-Correcting Codes
2017/9/25
Device-specific physical characteristics provide the foundation for PUFs, a hardware primitive for secure storage of cryptographic keys. So far, they have been implemented by either directly evaluatin...
Near-Optimal Secret Sharing and Error Correcting Codes in AC0
secret sharing Near-Optimal Secret Sharing
2017/9/25
We study the question of minimizing the computational complexity of (robust) secret sharing schemes and error correcting codes. In standard instances of these objects, both encoding and decoding invol...