Search Results for author:
Found 9 papers, 3 papers with code
Machine learning for modular multiplication
Motivated by cryptographic applications, we investigate two machine learning approaches to modular multiplication: namely circular regression and a sequence-to-sequence transformer model.
Salsa Fresca: Angular Embeddings and Pre-Training for ML Attacks on Learning With Errors
Our architecture improvements enable scaling to larger-dimension LWE problems: this work is the first instance of ML attacks recovering sparse binary secrets in dimension $n=1024$, the smallest dimension used in practice for homomorphic encryption applications of LWE where sparse binary secrets are proposed.
SALSA PICANTE: a machine learning attack on LWE with binary secrets
However, this attack assumes access to millions of eavesdropped LWE samples and fails at higher Hamming weights or dimensions.
SALSA: Attacking Lattice Cryptography with Transformers
Currently deployed public-key cryptosystems will be vulnerable to attacks by full-scale quantum computers.
Transparency Tools for Fairness in AI (Luskin)
The three tools are: - A new definition of fairness called "controlled fairness" with respect to choices of protected features and filters.
CHET: Compiler and Runtime for Homomorphic Evaluation of Tensor Programs
Just as the hardware ISA interface enabled hardware advances to proceed independent of software advances in the compiler and language runtimes, HISA decouples compiler optimizations and runtimes for supporting FHE applications from advancements in the underlying FHE schemes.
Crypto-Nets: Neural Networks over Encrypted Data
To achieve the privacy requirements, we use homomorphic encryption in the following protocol: the data owner encrypts the data and sends the ciphertexts to the third party to obtain a prediction from a trained model.
Abelian surfaces admitting an (l,l)-endomorphism
We make the classification explicit in the simplest case $l=2$.
Algebraic Geometry Number Theory 14J10
Igusa class polynomials, embeddings of quartic CM fields, and arithmetic intersection theory
Bruinier and Yang conjectured a formula for an intersection number on the arithmetic Hilbert modular surface, CM(K). T_m, where CM(K) is the zero-cycle of points corresponding to abelian surfaces with CM by a primitive quartic CM field K, and T_m is the Hirzebruch-Zagier divisors parameterizing products of elliptic curves with an m-isogeny between them.
Number Theory Algebraic Geometry 11G15, 14G40, 11G20, 14K15, 14K22
