On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption

DOI10.1007/978-3-031-30620-4_9zbMath1528.94051OpenAlexW4365807255MaRDI QIDQ6063521

Jiayi Kang, Ilia Iliashenko, Frederik Vercauteren, Robin Geelen

Publication date: 12 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_9

zbMATH Keywords

bootstrappinghomomorphic encryptionpolyfunctions

Mathematics Subject Classification ID

Cryptography (94A60) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials over finite fields (11T06) Special sequences and polynomials (11B83) Polynomials and finite commutative rings (13M10)

Related Items (1)

Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}

Cites Work

• On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
• Homomorphic lower digits removal and improved FHE bootstrapping
• On polynomial functions (mod m)
• An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
• Fully homomorphic SIMD operations
• Counting polynomial functions \(\pmod{p^ n}\)
• Bootstrapping for helib
• (Leveled) fully homomorphic encryption without bootstrapping
• Practical Bootstrapping in Quasilinear Time
• Better Bootstrapping in Fully Homomorphic Encryption
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
• Fully homomorphic encryption using ideal lattices
• Functions and polynomials ($mod p^n$)
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• The ring of polyfunctions over Z/nZ

This page was built for publication: On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption