English
Related papers

Related papers: Ring-LWE Cryptography for the Number Theorist

200 papers

In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…

Number Theory · Mathematics 2022-11-09 Aarya Kumar , Siyu Peng , Vincent Tran

The theory of Engel groups plays an important role in group theory since these groups are closely related to the Burnside problems. In this survey we consider several classical and novel algorithmic problems for Engel groups and propose…

Group Theory · Mathematics 2020-02-03 Delaram Kahrobaei , Marialaura Noce

We study three problems that involve identifying homogeneous halfspaces under Gaussian distributions: agnostic learning, one-sided reliable learning, and fairness auditing. In each of these problems, we are given labeled examples…

Machine Learning · Computer Science 2026-04-30 Jizhou Huang , Brendan Juba

In this note devoted to some aspects of the inverse problem of representation theory the attention is concentrated on the interrelations between various algebraic structures (algebras with operators) unraveled by different solutions of the…

q-alg · Mathematics 2008-02-03 Denis V. Juriev

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,…

Cryptography and Security · Computer Science 2024-10-11 Emily Wenger , Eshika Saxena , Mohamed Malhou , Ellie Thieu , Kristin Lauter

The deployment of large language models (LLMs) on third-party devices requires new ways to protect model intellectual property. While Trusted Execution Environments (TEEs) offer a promising solution, their performance limits can lead to a…

Cryptography and Security · Computer Science 2026-02-12 Abhishek Saini , Haolin Jiang , Hang Liu

The Ring-Learning With Errors (RLWE) problem forms the backbone of highly efficient Fully Homomorphic Encryption (FHE) schemes. A significant component of the RLWE public key and ciphertext of the form $(b,a)$ is the uniformly random…

Cryptography and Security · Computer Science 2026-02-24 Ilan Rosenfeld , Noam Kleinburd , Hillel Chapman , Dror Reuven

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

Algebraic Geometry · Mathematics 2021-10-19 Marc Maliar

Extending results of Rais-Tauvel, Macedo-Savage, and Arakawa-Premet, we prove that under mild restrictions on the Lie algebra $\mathfrak q$ having the polynomial ring of symmetric invariants, the m-th Takiff algebra of $\mathfrak q$,…

Representation Theory · Mathematics 2017-10-10 Dmitri Panyushev , Oksana Yakimova

Let L be a restricted Lie algebra over a field of positive characteristic. We survey the known results about the Lie structure of the restricted enveloping algebra u(L) of L. Related results about the structure of the group of units and the…

Rings and Algebras · Mathematics 2015-11-02 Salvatore Siciliano , Hamid Usefi

The aim of the papers is to describe the left regular left quotient ring ${}'Q(R)$ and the right regular right quotient ring $Q'(R)$ for the following algebras $R$: $\mS_n=\mS_1^{\t n}$ is the algebra of one-sided inverses, where…

Rings and Algebras · Mathematics 2024-04-19 V. V. Bavula

Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…

Number Theory · Mathematics 2024-07-09 William Duke

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a…

Machine Learning · Computer Science 2020-02-25 Kevin Shi , Daniel Hsu , Allison Bishop

Discrete tomography is concerned with the reconstruction of images that are defined on a discrete set of lattice points from their projections in several directions. The range of values that can be assigned to each lattice point is…

Combinatorics · Mathematics 2009-07-30 Arjen Stolk , K. Joost Batenburg

Type-flaw attacks and multi-protocol attacks on security protocols have been frequently reported in the literature. Heather et al. and Guttman et al. have proven that these could be prevented by tagging encrypted components with distinct…

Cryptography and Security · Computer Science 2010-06-22 Sreekanth Malladi

Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) which is equivalent, under quantum polynomial-time reductions, to the Learning With Errors (LWE) problem. For limited number…

Quantum Physics · Physics 2021-05-28 Javad Doliskani

M.-P. Sch\"utzenberger asked to determine the support of the free Lie algebra ${\mathcal L}_{{\mathbb Z}_{m}}(A)$ on a finite alphabet $A$ over the ring ${\mathbb Z}_{m}$ of integers $\bmod m$ and all the corresponding pairs of twin and…

Combinatorics · Mathematics 2008-07-23 Ioannis Michos

We study the model theory of the ring of adeles of a number field. We obtain quantifier elimination results in the language of rings and some enrichments. We given consequences for definable subsets of the adeles, and their measures.

Logic · Mathematics 2016-04-01 Jamshid Derakhshan , Angus Macintyre

This paper studies information-theoretically secure quantum homomorphic encryption (QHE) schemes of classical data. Previous works on information-theoretically secure QHE schemes (like Childs'05, Liang'13, and others) are typically based on…

Quantum Physics · Physics 2023-02-14 Dor Bitan , Shlomi Dolev

Multi-protocol attacks due to protocol interaction has been a notorious problem for security. Gutman-Thayer proved that they can be prevented by ensuring that encrypted messages are distinguishable across protocols, under a free algebra. In…

Cryptography and Security · Computer Science 2010-05-11 Sreekanth Malladi
‹ Prev 1 3 4 5 6 7 10 Next ›