On the public citation graph
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem
0 signed · 142 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45708-9_19openalex-snapshot
A Generalized Birthday Problem
inferredcites →https://doi.org/10.1007/978-3-030-26951-7openalex-snapshot
Advances in Cryptology – CRYPTO 2019
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_25openalex-snapshot
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
inferredcites →https://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferredcites →https://doi.org/10.1007/s001459900012openalex-snapshot
Efficient Cryptographic Schemes Provably as Secure as Subset Sum
inferredcites →https://doi.org/10.1017/cbo9780511814549openalex-snapshot
A Computational Introduction to Number Theory and Algebra
inferredcites →https://doi.org/10.1017/cbo9781139165464openalex-snapshot
A Computational Introduction to Number Theory and Algebra
inferredcites →https://doi.org/10.1109/focs.2004.72openalex-snapshot
Worst-Case to Average-Case Reductions Based on Gaussian Measures
inferredcites →https://doi.org/10.1137/0210033openalex-snapshot
A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
inferredcites →https://doi.org/10.1137/0215038openalex-snapshot
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
inferredcites →https://doi.org/10.1145/237814.237838openalex-snapshot
Generating hard instances of lattice problems (extended abstract)
inferredcites →https://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/792538.792543openalex-snapshot
Noise-tolerant learning, the parity problem, and the statistical query model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-01446-9_6openalex-snapshot
On the Hardness of Learning Parity with Noise over Rings
inferred← citeshttps://doi.org/10.1007/978-3-030-01950-1_46openalex-snapshot
Simpler CCA Secure PKE from LPN Problem Without Double-Trapdoor
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_1openalex-snapshot
Collision Resistant Hashing from Sub-exponential Learning Parity with Noise
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_22openalex-snapshot
Improved Classical and Quantum Algorithms for Subset-Sum
inferred← citeshttps://doi.org/10.1007/978-3-030-77886-6_29openalex-snapshot
Breaking the Circuit Size Barrier for Secure Computation Under Quasi-Polynomial LPN
inferred← citeshttps://doi.org/10.1007/978-3-030-78375-4_9openalex-snapshot
Towards Efficient LPN-Based Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_16openalex-snapshot
Smoothing Out Binary Linear Codes and Worst-Case Sub-exponential Hardness for LPN
inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_17openalex-snapshot
Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_23openalex-snapshot
BKW Meets Fourier New Algorithms for LPN with Sparse Parities
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_21openalex-snapshot
Correlated Pseudorandomness from Expand-Accumulate Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-22969-5_25openalex-snapshot
A Non-heuristic Approach to Time-Space Tradeoffs and Optimizations for BKW
inferred← citeshttps://doi.org/10.1007/978-3-031-31371-4_8openalex-snapshot
Pseudorandom Correlation Functions from Variable-Density LPN, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-33488-7_26openalex-snapshot
Spherical Gaussian Leftover Hash Lemma via the Rényi Divergence
inferred← citeshttps://doi.org/10.1007/978-3-031-38551-3_18openalex-snapshot
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding
inferred← citeshttps://doi.org/10.1007/978-3-031-38551-3_19openalex-snapshot
Expand-Convolute Codes for Pseudorandom Correlation Generators from LPN
inferred← citeshttps://doi.org/10.1007/978-3-031-68382-4_7openalex-snapshot
A Systematic Study of Sparse LWE
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_10openalex-snapshot
Stationary Syndrome Decoding for Improved PCGs
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_12openalex-snapshot
Wagner’s Algorithm Provably Runs in Subexponential Time for $$\textrm{SIS}^\infty $$
inferred← citeshttps://doi.org/10.1007/978-3-032-07089-0_3openalex-snapshot
Silent Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-12287-2_10openalex-snapshot
Slightly Sublinear Trapdoor Hash Functions and PIR from Low-Noise LPN
inferred← citeshttps://doi.org/10.1007/978-3-032-25333-0_1openalex-snapshot
Attacks on Goldreich’s Pseudorandom Generators by Grouping and Solving
inferred← citeshttps://doi.org/10.1007/978-3-032-35398-6_6openalex-snapshot
Post-quantum Cryptography from Quantum Stabilizer Decoding
inferred← citeshttps://doi.org/10.1007/978-3-319-50011-9_8openalex-snapshot
On the Robustness of Learning Parity with Noise
inferred← citeshttps://doi.org/10.1007/978-3-319-57048-8_2openalex-snapshot
The Complexity of Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-57048-8_3openalex-snapshot
Pseudorandom Functions: Three Decades Later
inferred← citeshttps://doi.org/10.1007/978-3-319-60055-0_3openalex-snapshot
KDM-Secure Public-Key Encryption from Constant-Noise LPN
inferred← citeshttps://doi.org/10.1007/978-3-319-68637-0_16openalex-snapshot
On the Hardness of Sparsely Learning Parity with Noise
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_24openalex-snapshot
On Iterative Collision Search for LPN and Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-540-68914-0_21openalex-snapshot
PUF-HB: A Tamper-Resilient HB Based Authentication Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-71039-4_4openalex-snapshot
SWIFFT: A Modest Proposal for FFT Hashing
inferred← citeshttps://doi.org/10.1007/978-3-540-79456-1_28openalex-snapshot
An Improved Multi-set Algorithm for the Dense Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-88625-9_3openalex-snapshot
Unclonable Lightweight Authentication Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-04159-4_12openalex-snapshot
Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers
inferred← citeshttps://doi.org/10.1007/978-3-642-10628-6_21openalex-snapshot
Two Attacks against the F f RFID Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_23openalex-snapshot
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_26openalex-snapshot
Some Recent Results on Local Testing of Sparse Linear Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-17367-7openalex-snapshot
Cryptography in Constant Parallel Time
inferred← citeshttps://doi.org/10.1007/978-3-642-17367-7_8openalex-snapshot
Cryptography with Constant Input Locality
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_11openalex-snapshot
Semi-homomorphic Encryption and Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-21040-2_17openalex-snapshot
Practical Attacks on HB and HB+ Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_32openalex-snapshot
On Noise-Tolerant Learning of Sparse Parities and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_9openalex-snapshot
Cryptography from Learning Parity with Noise
inferred← citeshttps://doi.org/10.1007/978-3-642-34047-5_20openalex-snapshot
Lapin: An Efficient Authentication Protocol Based on Ring-LPN
inferred← citeshttps://doi.org/10.1007/978-3-642-36140-1_4openalex-snapshot
Hidden Bits Approach for Authentication in RFID Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38553-7_6openalex-snapshot
HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_48openalex-snapshot
Outsourced Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-662-45608-8_17openalex-snapshot
Side-Channel Analysis of Multiplications in GF(2128)
inferred← citeshttps://doi.org/10.1007/978-3-662-45611-8_1openalex-snapshot
Solving LPN Using Covering Codes
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_27openalex-snapshot
Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_8openalex-snapshot
Better Algorithms for LWE and LWR
inferred← citeshttps://doi.org/10.1007/978-3-662-48324-4_20openalex-snapshot
Improved Side-Channel Analysis of Finite-Field Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-662-48800-3_29openalex-snapshot
How to Sequentialize Independent Parallel Attacks?
inferred← citeshttps://doi.org/10.1007/978-3-662-49384-7_2openalex-snapshot
Chosen-Ciphertext Security from Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_16openalex-snapshot
On Public Key Encryption from Noisy Codewords
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_6openalex-snapshot
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
inferred← citeshttps://doi.org/10.1007/978-3-662-53018-4_9openalex-snapshot
Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
inferred← citeshttps://doi.org/10.1007/978-3-662-53887-6_26openalex-snapshot
Optimization of $$\mathsf {LPN}$$ Solving Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-54365-8_2openalex-snapshot
Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
inferred← citeshttps://doi.org/10.1007/978-981-95-5018-0_16openalex-snapshot
On Wagner’s k-Tree Algorithm Over Integers
inferred← citeshttps://doi.org/10.1007/s00037-007-0234-9openalex-snapshot
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
inferred← citeshttps://doi.org/10.1007/s00145-009-9039-0openalex-snapshot
Cryptography with Constant Input Locality
inferred← citeshttps://doi.org/10.1007/s00145-010-9061-2openalex-snapshot
Parallel and Concurrent Security of the HB and HB+ Protocols
inferred← citeshttps://doi.org/10.1007/s00145-011-9097-yopenalex-snapshot
The Extended k-tree Algorithm
inferred← citeshttps://doi.org/10.1007/s00145-017-9270-zopenalex-snapshot
Asymptotically Efficient Lattice-Based Digital Signatures
inferred← citeshttps://doi.org/10.1007/s00145-019-09338-8openalex-snapshot
Solving LPN Using Covering Codes
inferred← citeshttps://doi.org/10.1007/s10207-017-0374-0openalex-snapshot
Outsourced pattern matching
inferred← citeshttps://doi.org/10.1007/s10623-016-0326-0openalex-snapshot
On the asymptotic complexity of solving LWE
inferred← citeshttps://doi.org/10.1007/s10623-025-01617-9openalex-snapshot
Limitations of the decoding-to-LPN reduction via code smoothing
inferred← citeshttps://doi.org/10.1007/s11128-020-02661-1openalex-snapshot
Quantum learning Boolean linear functions w.r.t. product distributions
inferred← citeshttps://doi.org/10.1007/s12095-015-0149-2openalex-snapshot
On solving L P N using B K W and variants
inferred← citeshttps://doi.org/10.1007/s42484-020-00019-5openalex-snapshot
Quantum-classical reinforcement learning for decoding noisy classical parity information
inferred← citeshttps://doi.org/10.1016/j.future.2016.05.018openalex-snapshot
Secure and anonymous decentralized Bitcoin mixing
inferred← citeshttps://doi.org/10.1016/j.parco.2014.04.002openalex-snapshot
MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.026openalex-snapshot
An improved algorithm for learning sparse parities in the presence of noise
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.025openalex-snapshot
CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
inferred← citeshttps://doi.org/10.1038/s41534-017-0017-3openalex-snapshot
Demonstration of quantum advantage in machine learning
inferred← citeshttps://doi.org/10.1049/iet-ifs.2015.0495openalex-snapshot
Low Noise LPN: Key dependent message secure public key encryption an sample amplification
inferred← citeshttps://doi.org/10.1049/iet-ifs.2018.5448openalex-snapshot
Specifications and improvements of LPN solving algorithms
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02737-8openalex-snapshot
Constructing Carmichael numbers through improved subset-product algorithms
inferred← citeshttps://doi.org/10.1098/rspa.2017.0551openalex-snapshot
Quantum machine learning: a classical perspective
inferred← citeshttps://doi.org/10.1103/physreva.92.012327openalex-snapshot
Quantum learning robust against noise
inferred← citeshttps://doi.org/10.1103/physreva.97.032327openalex-snapshot
Noise-tolerant parity learning with one quantum bit
inferred← citeshttps://doi.org/10.1103/physreva.99.032314openalex-snapshot
Learning-with-errors problem is easy with quantum samples
inferred← citeshttps://doi.org/10.1109/access.2018.2840119openalex-snapshot
A Practical Public Key Encryption Scheme Based on Learning Parity With Noise
inferred← citeshttps://doi.org/10.1109/access.2021.3051047openalex-snapshot
Chosen-Ciphertext Secure Key Encapsulation Mechanism in the Standard Model
inferred← citeshttps://doi.org/10.1109/ccc.2010.26openalex-snapshot
The Learning with Errors Problem (Invited Survey)
inferred← citeshttps://doi.org/10.1109/focs.2012.27openalex-snapshot
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00103openalex-snapshot
Correlated Pseudorandom Functions from Variable-Density LPN
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00017openalex-snapshot
Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
inferred← citeshttps://doi.org/10.1109/srds60354.2023.00016openalex-snapshot
Range-Based Set Reconciliation
inferred← citeshttps://doi.org/10.1109/tcad.2022.3197529openalex-snapshot
Enhancing Reliability and Security: A Configurable Poisoning PUF Against Modeling Attacks
inferred← citeshttps://doi.org/10.1109/tdsc.2016.2536609openalex-snapshot
Trapdoor computational fuzzy extractors and stateless cryptographically-secure physical unclonable functions
inferred← citeshttps://doi.org/10.1109/tifs.2016.2537262openalex-snapshot
Secretly Pruned Convolutional Codes: Security Analysis and Performance Results
inferred← citeshttps://doi.org/10.1109/tit.2015.2475738openalex-snapshot
A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
inferred← citeshttps://doi.org/10.1112/s1461157016000218openalex-snapshot
Algorithms for the approximate common divisor problem
inferred← citeshttps://doi.org/10.1137/100811945openalex-snapshot
Local List-Decoding and Testing of Random Linear Codes from High Error
inferred← citeshttps://doi.org/10.1145/1374376.1374438openalex-snapshot
Cryptography with constant computational overhead
inferred← citeshttps://doi.org/10.1145/1374376.1374466openalex-snapshot
On agnostic boosting and parity learning
inferred← citeshttps://doi.org/10.1145/2554797.2554815openalex-snapshot
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
inferred← citeshttps://doi.org/10.1145/2728167openalex-snapshot
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem
inferred← citeshttps://doi.org/10.1145/2898420.2898422openalex-snapshot
Creating Cryptographic Challenges Using Multi-Party Computation
inferred← citeshttps://doi.org/10.1145/3174804openalex-snapshot
A Faster Subquadratic Algorithm for Finding Outlier Correlations
inferred← citeshttps://doi.org/10.1145/3319535.3354255openalex-snapshot
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation
inferred← citeshttps://doi.org/10.1145/3653014openalex-snapshot
Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k -SUM and k -XOR
inferred← citeshttps://doi.org/10.1186/s42400-024-00316-7openalex-snapshot
Quantum commitments from structured one-way quantum state generators, and more
inferred← citeshttps://doi.org/10.1186/s42400-024-00339-0openalex-snapshot
An improved BKW algorithm on the learning with rounding problem
inferred← citeshttps://doi.org/10.1515/dma-2018-0001openalex-snapshot
Solving systems of linear Boolean equations with noisy right-hand sides over the reals
inferred← citeshttps://doi.org/10.1587/transfun.2019cip0022openalex-snapshot
On the Complexity of the LWR-Solving BKW Algorithm
inferred← citeshttps://doi.org/10.20944/preprints202306.0712.v1openalex-snapshot
Alogrithms for the ACD Problem and Cryptanalysis of ACD-based FHE schemes, Revisited
inferred← citeshttps://doi.org/10.20944/preprints202306.0712.v2openalex-snapshot
Alogrithms for the ACD Problem and Cryptanalysis of ACD-based FHE schemes, Revisited
inferred← citeshttps://doi.org/10.2478/v10065-011-0015-6openalex-snapshot
Security problems of systems of extremely weak devices
inferred← citeshttps://doi.org/10.26421/qic19.15-16-1openalex-snapshot
Learning DNFs under product distributions via mu--biased quantum Fourier sampling
inferred← citeshttps://doi.org/10.3390/cryptography1030023openalex-snapshot
FPGA Implementation of a Cryptographically-Secure PUF Based on Learning Parity with Noise
inferred← citeshttps://doi.org/10.4213/dm1401openalex-snapshot
Решение систем линейных уравнений булева типа с искаженной правой частью над полем действительных чисел
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2739openalex-snapshot
Division algorithms for the fixed weight subset sum problem
inferred← citeshttps://doi.org/10.48550/arxiv.1710.08256openalex-snapshot
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
inferred← citeshttps://doi.org/10.48550/arxiv.1902.01086openalex-snapshot
Computational Limitations in Robust Classification and Win-Win Results
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04295openalex-snapshot
Better Sample -- Random Subset Sum in $2^{0.255n}$ and its Impact on Decoding Random Linear Codes
inferred← citeshttps://doi.org/10.5075/epfl-thesis-6807openalex-snapshot
Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography
inferred← citeshttps://doi.org/10.5555/1496770.1496835openalex-snapshot
The extended k-tree algorithm
inferred← citeshttps://doi.org/10.70675/0edc9e27z5a66z4c28zbdfaz4cdd245bfa32openalex-snapshot
Security of cryptosystems against power-analysis attacks
inferred← citeshttps://doi.org/10.70675/c36a63dbz469ez406azba4fza2fd2c7ca09bopenalex-snapshot
Classical and quantum cryptanalysis for Euclidean lattices and subset sums
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.