搜索结果: 1-15 共查到“密码学 LPN”相关记录20条 . 查询时间(0.066 秒)
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
time-memory trade-off representations parallel collision search
2019/7/15
For enabling post-quantum cryptanalytic experiments on a meaningful scale, there is a strong need for low-memory algorithms. We show that the combination of techniques from representations, multiple c...
We show a new general approach for constructing maliciously secure two-round oblivious transfer (OT). Specifically, we provide a generic sequence of transformations to upgrade a very basic notion of t...
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
LPN Worst-Case to Average Case Reductions Collision-Resistant Hashing
2018/3/23
We present a worst case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter regime. Prior to this work, no worst case hardness re...
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 ...
Iterative collision search procedures play a key role in developing combinatorial algorithms for the subset sum and learning parity with noise (LPN) problems. In both scenarios, the single-list pair-w...
The intractability of solving the LPN problem serves as the security source of many lightweight/post-quantum cryptographic schemes proposed over the past decade. There are several algorithms available...
KDM-Secure Public-Key Encryption from Constant-Noise LPN
learning parity with noise key-dependent message security public-key encryption
2017/4/12
The Learning Parity with Noise (LPN) problem has found many applications in cryptography due to its conjectured post-quantum hardness and simple algebraic structure. Over the years, constructions of d...
We propose new algorithms with small memory consumption for the Learning Parity with Noise (LPN) problem, both classically and quantumly. Our goal is to predict the hardness of LPN depending on both p...
Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
Foundations Cryptography with Auxiliary Input Learning Parity with Noise
2016/5/30
Dodis, Kalai and Lovett (STOC 2009) initiated the study of the Learning Parity with
Noise (LPN) problem with (static) exponentially hard-to-invert auxiliary input. In particular,
they showed that un...
In this note we re-evaluate the Eurocrypt'16 paper by Zhang et al. in the area of LPN solving algorithms. We present the history of LPN solving algorithms and give the general description of the algor...
In this article we focus on constructing an algorithm that automatizes the generation of LPN solving algorithms from the considered parameters. When searching for an algorithm to solve an LPN instance...
Faster Algorithms for Solving LPN
LPN BKW Perfect code
2016/3/14
The LPN problem, lying at the core of many cryptographic
constructions for lightweight and post-quantum cryptography, receives
quite a lot attention recently. The best published algorithm for solvin...
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
Symmetric Cryptography Low-depth PRFs Learning Parity with Noise
2016/2/23
Pseudorandom functions (PRFs) play a central role in symmetric cryptography. While in principle
they can be built from any one-way functions by going through the generic HILL (SICOMP
1999) and GGM (...
Two-Round Man-in-the-Middle Security from LPN
Secret-key authentication Man-in-the-Middle security LPN
2016/1/27
Secret-key authentication protocols have recently received a
considerable amount of attention, and a long line of research has been
devoted to devising efficient protocols with security based on the...
Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
Low Noise LPN Key Dependent Message Security LPN Hardness Reduction
2016/1/5
Cryptographic schemes based on the Learning Parity with Noise (LPN) problem have several
very desirable aspects: Low computational overhead, simple implementation and conjectured
post-quantum hardne...