搜索结果: 1-15 共查到“军事学 codes”相关记录147条 . 查询时间(0.14 秒)
A Reaction Attack against Cryptosystems based on LRPC Codes
Rank-based cryptography Code-based cryptography LRPC cryptosystems
2019/7/22
Rank metric is a very promising research direction for code-based cryptography. In fact, thanks to the high complexity of generic decoding attacks against codes in this metric, it is possible to easil...
Polar Sampler: Discrete Gaussian Sampling over the Integers Using Polar Codes
Discrete Gaussian sampling Polar codes Integer lattice
2019/6/10
Cryptographic constructions based on hard lattice problems have emerged as a front runner for the standardization of post quantum public key cryptography. As the standardization process takes place, o...
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space
Non-Malleable Codes Proofs of Space Tamper-resilience
2019/5/24
Non-malleable codes are encoding schemes that provide protections against various classes of tampering attacks. Recently Faust et al. (CRYPTO 2017) initiated the study of space- bounded non-malleable ...
Cryptanalysis of a System Based on Twisted Reed–Solomon Codes
Code-based cryptography McEliece Cryptosystem Subfield Subcodes
2019/4/29
It was recently proved that twisted Reed--Solomon codes represent a family of codes which contain a large amount of MDS codes, non-equivalent to Reed--Solomon codes. As a consequence, they were propos...
Efficient Message Authentication Codes with Combinatorial Group Testing
Message authentication code Combinatorial group testing Data corruption
2019/4/23
Message authentication code, MAC for short, is a symmetric-key cryptographic function for authenticity. A standard MAC verification only tells whether the message is valid or invalid, and thus we can ...
Inception makes non-malleable codes shorter as well!
Non-malleable codes Randomness extraction
2019/4/22
Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs in ICS 2010, have emerged in the last few years as a fundamental object at the intersection of cryptography and coding theory. Non-ma...
Non-Malleable Codes for Decision Trees
non-malleable codes decision trees small-depth circuits
2019/4/16
We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by decision trees of depth d=n1/4−o(1)d=n1/4−o(1). In particular, each bit of...
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 ...
Rate-Optimizing Compilers for Continuously Non-Malleable Codes
non-malleable codes tamper-proof security
2019/1/26
For the case of split-state tampering, we establish the existence of rate-one continuously non-malleable codes with computational security, in the (non-programmable) random oracle model. We further ex...
Code-based Cryptosystem from Quasi-Cyclic Elliptic Codes
code-based cryptography post quantum cryptograp elliptic code
2018/12/6
With the fast development of quantum computation, code based cryptography arises public concern as a candidate of post quantum cryptography. However, the large key-size becomes a main drawback such th...
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More
non-malleable codes non-malleable extractors explicit constructions
2018/11/12
Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs (JACM 2018) as a generalization of standard error correcting codes to handle severe forms of tampering on codewords. This notion...
Expander Graphs are Non-Malleable Codes
Non-malleable code Split-state Explicit Constructions
2018/11/8
Any dd-regular graph on nn vertices with spectral expansion λλ satisfying n=Ω(d3log(d)/λ)n=Ω(d3log(d)/λ) yields a O(λ3/2d)O(λ3/2d)-non-malleable code in the split-state model.
Non-Malleable Codes Against Bounded Polynomial Time Tampering
non-malleable code non-malleable commitment derandomization
2018/11/2
We construct efficient non-malleable codes (NMC) that are (computationally) secure against tampering by functions computable in any fixed polynomial time. Our construction is in the plain (no-CRS) mod...
Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations
McEliece cryptosystem automorphism-incuded Goppa codes quasi-cyclic
2018/11/2
In this paper, we propose a new general construction to reduce the public key size of McEliece-based schemes based on Goppa codes. In particular, we generalize the ideas of automorphism-induced Goppa ...
Reproducible Codes and Cryptographic Applications
code-based cryptography structured codes
2018/7/16
In this paper we study structured linear block codes, starting from well known examples and generalizing them to a wide class of codes that we call reproducible codes. These codes have the property th...