Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
D Micciancio, P Mol - Annual cryptology conference, 2011 - Springer
We study the pseudorandomness of bounded knapsack functions over arbitrary finite
abelian groups. Previous works consider only specific families of finite abelian groups and 0 …
abelian groups. Previous works consider only specific families of finite abelian groups and 0 …
Batch binary edwards
DJ Bernstein - Annual International Cryptology Conference, 2009 - Springer
This paper sets new software speed records for high-security Diffie-Hellman computations,
specifically 251-bit elliptic-curve variable-base-point scalar multiplication. In one second of …
specifically 251-bit elliptic-curve variable-base-point scalar multiplication. In one second of …
The hardness of LPN over any integer ring and field for PCG applications
Learning parity with noise (LPN) has been widely studied and used in cryptography. It was
recently brought to new prosperity since Boyle et al.(CCS'18), putting LPN to a central role in …
recently brought to new prosperity since Boyle et al.(CCS'18), putting LPN to a central role in …
FFT and sparse FFT techniques and applications
BN Mohapatra, RK Mohapatra - 2017 Fourteenth International …, 2017 - ieeexplore.ieee.org
Currently, the FFT is used in different areas, starting from identification of frequency on
mechanical vibration to image enhancement. Real-time computation by interpret the …
mechanical vibration to image enhancement. Real-time computation by interpret the …
Solving hidden number problem with one bit oracle and advice
A Akavia - Annual International Cryptology Conference, 2009 - Springer
Abstract In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when
given p, g and access to an oracle that on query a returns the k most significant bits of …
given p, g and access to an oracle that on query a returns the k most significant bits of …
Hardness of computing individual bits for one-way functions on elliptic curves
A Duc, D Jetchev - Advances in Cryptology–CRYPTO 2012: 32nd Annual …, 2012 - Springer
We prove that if one can predict any of the bits of the input to an elliptic curve based one-way
function over a finite field, then we can invert the function. In particular, our result implies that …
function over a finite field, then we can invert the function. In particular, our result implies that …
On Fourier analysis of sparse Boolean functions over certain Abelian groups
S Chakraborty, S Datta, P Dutta, A Ghosh… - arXiv preprint arXiv …, 2024 - arxiv.org
Given an Abelian group G, a Boolean-valued function f: G->{-1,+ 1}, is said to be s-sparse, if
it has at most s-many non-zero Fourier coefficients over the domain G. In a seminal paper …
it has at most s-many non-zero Fourier coefficients over the domain G. In a seminal paper …
The multivariate hidden number problem
SD Galbraith, B Shani - International Conference on Information Theoretic …, 2015 - Springer
This work extends the line of research on the hidden number problem. Motivated by studying
bit security in finite fields, we define the multivariate hidden number problem. Here, the …
bit security in finite fields, we define the multivariate hidden number problem. Here, the …
An automated image analysis framework for thermal barrier coating porosity measurement
Thermal barrier coating is a widely used advanced manufacturing technique. This paper
introduces an image analysis based automated thermal barrier coating porosity …
introduces an image analysis based automated thermal barrier coating porosity …
Hardness amplification within NP against deterministic algorithms
P Gopalan, V Guruswami - Journal of Computer and System Sciences, 2011 - Elsevier
We study the average-case hardness of the class NP against algorithms in P. We prove that
there exists some constant μ> 0 such that if there is some language in NP for which no …
there exists some constant μ> 0 such that if there is some language in NP for which no …