搜索结果: 1-15 共查到“密码学 Decoding”相关记录27条 . 查询时间(0.046 秒)
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
lattice Gaussian sampling Markov chain Monte Carlo bounded distance decoding
2019/6/5
Sampling from the lattice Gaussian distribution plays an important role in various research fields. In this paper, the Markov chain Monte Carlo (MCMC)-based sampling technique is advanced in several f...
Ternary Syndrome Decoding with Large Weight
public-key cryptography code-based cryptography Information set decoding
2019/3/21
The Syndrome Decoding problem is at the core of many code-based cryptosystems. In this paper, we study ternary Syndrome Decoding in large weight. This problem has been introduced in the Wave signature...
On the Decoding Failure Rate of QC-MDPC Bit-Flipping Decoders
code-based cryptography MDPC codes iterative decoding
2018/12/20
Quasi-cyclic moderate density parity check codes allow the design of McEliece-like public-key encryption schemes with compact keys and a security that provably reduces to hard decoding problems for qu...
We provide a new approach to the elliptic curve discrete logarithm problem (ECDLP). First, we construct Elliptic Codes (EC codes) from the ECDLP. Then we propose an algorithm of finding the minimum we...
Efficient MPC from Syndrome Decoding (or: Honey, I Shrunk the Keys)
multi-party computation oblivious transfer syndrome decoding
2018/3/5
We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. Motivated by the fact that within the dishonest majority setting ...
Polynomial Time Bounded Distance Decoding near Minkowski’s Bound in Discrete Logarithm Lattices
lattice techniques Bounded Distance Decoding Minkowski's bound
2018/2/9
We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice Bounded Distance Decoding (BDD) problem can be solved in deterministic polynomial time. This construction i...
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 ...
Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Scheme
Reed-Solomon Codes RLCE Encryption Scheme
2017/8/2
This paper compares the efficiency of various algorithms for implementing public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over f...
Quantum Information Set Decoding Algorithms
code-based cryptography quantum cryptanalysis decoding algorithm
2017/3/6
The security of code-based cryptosystems such as the McEliece cryptosystem relies primarily on the difficulty of decoding random linear codes. The best decoding algorithms are all improvements of an o...
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices
Lattices Bounded Distance Decoding Problem Unique Shortest Vector Problem
2016/12/12
We present a probabilistic polynomial-time reduction from the lattice Bounded Distance Decoding (BDD) problem with parameter 1/(2√⋅γ2⋅γ) to the unique Shortest Vector Problem (uSVP) with p...
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
CCA-security key-recovery attack post-quantum cryptography
2016/12/10
Algorithms for secure encryption in a post-quantum world are currently receiving a lot of attention in the research community, including several larger projects and a standardization effort from NIST....
Advancements in quantum computing have spurred the development of new asymmetric cryptographic primitives that are conjectured to be secure against quantum attackers. One promising class of these prim...
On Multi-Point Local Decoding of Reed-Muller Codes
Reed-Muller codes locally correctable codes
2016/4/13
Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one sing...
May-Ozerov Algorithm for Nearest-Neighbor Problem over $\mathbb{F}_{q}$ and Its Application to Information Set Decoding
code-based cryptography random linear code information set decoding
2016/3/4
May and Ozerov proposed an algorithm for the nearest-neighbor problem of vectors over the binary field at EUROCRYPT 2015. They applied their algorithm to the decoding problem of random linear codes ov...
Optimizing Information Set Decoding Algorithms to Attack Cyclosymmetric MDPC Codes
information set decoding code-based cryptography
2016/1/9
The most important drawback to code-based cryptography
has historically been its large key sizes. Recently, several promising approaches
have been proposed to reduce keysizes. In particular, signifi...