Zobrazeno 1 - 10
of 295
pro vyhledávání: '"Lauter, Kristin"'
Modular addition is, on its face, a simple operation: given $N$ elements in $\mathbb{Z}_q$, compute their sum modulo $q$. Yet, scalable machine learning solutions to this problem remain elusive: prior work trains ML models that sum $N \le 6$ elements
Externí odkaz:
http://arxiv.org/abs/2410.03569
Lattice cryptography schemes based on the learning with errors (LWE) hardness assumption have been standardized by NIST for use as post-quantum cryptosystems, and by HomomorphicEncryption.org for encrypted compute on sensitive data. Thus, understandi
Externí odkaz:
http://arxiv.org/abs/2408.00882
Autor:
Nolte, Niklas, Malhou, Mohamed, Wenger, Emily, Stevens, Samuel, Li, Cathy, Charton, François, Lauter, Kristin
Sparse binary LWE secrets are under consideration for standardization for Homomorphic Encryption and its applications to private computation. Known attacks on sparse binary LWE secrets include the sparse dual attack and the hybrid sparse dual-meet in
Externí odkaz:
http://arxiv.org/abs/2403.10328
Motivated by cryptographic applications, we investigate two machine learning approaches to modular multiplication: namely circular regression and a sequence-to-sequence transformer model. The limited success of both methods demonstrated in our result
Externí odkaz:
http://arxiv.org/abs/2402.19254
Autor:
Stevens, Samuel, Wenger, Emily, Li, Cathy, Nolte, Niklas, Saxena, Eshika, Charton, François, Lauter, Kristin
Learning with Errors (LWE) is a hard math problem underlying recently standardized post-quantum cryptography (PQC) systems for key exchange and digital signatures. Prior work proposed new machine learning (ML)-based attacks on LWE problems with small
Externí odkaz:
http://arxiv.org/abs/2402.01082
Learning with Errors (LWE) is a hard math problem used in post-quantum cryptography. Homomorphic Encryption (HE) schemes rely on the hardness of the LWE problem for their security, and two LWE-based cryptosystems were recently standardized by NIST fo
Externí odkaz:
http://arxiv.org/abs/2306.11641
Autor:
Li, Cathy, Sotáková, Jana, Wenger, Emily, Malhou, Mohamed, Garcelon, Evrard, Charton, Francois, Lauter, Kristin
Learning with Errors (LWE) is a hard math problem underpinning many proposed post-quantum cryptographic (PQC) systems. The only PQC Key Exchange Mechanism (KEM) standardized by NIST is based on module~LWE, and current publicly available PQ Homomorphi
Externí odkaz:
http://arxiv.org/abs/2303.04178
Publikováno v:
SIAM Journal on Matrix Analysis and Applications, 45 (1): 353-367, 2024
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the problem of fin
Externí odkaz:
http://arxiv.org/abs/2303.02226