Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields

DOI10.1007/S12095-024-00771-6MaRDI QIDQ6950864zbMATH OpenFDO

Authors Iván Blanco-Chacón, Alberto Pedrouzo-Ulloa, Rahinatou Y. Njah Nchiwo, Beatriz Barbero-Lucas

Publication date 30 July 2025

Published in Cryptography and Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S12095-024-00771-6

zbMATH Keywords

condition numbercyclotomic polynomialshomomorphic encryptionnumber theoretic transformspolynomial learning with errorsring learning with errors

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Data encryption (aspects in computer science) (68P25) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• A toolkit for ring-LWE cryptography
• Algorithms in HElib
• An improved RNS variant of the BFV homomorphic encryption scheme
• Bootstrapping for helib
• Efficient public key encryption based on ideal lattices (extended abstract)
• Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
• Fast Fourier transforms: A tutorial review and a state of the art
• Faster arithmetic for number-theoretic transforms
• Faster homomorphic linear transformations in HElib
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic SIMD operations
• Hardness of approximating the shortest vector problem in lattices
• Homomorphic evaluation of the AES circuit
• How (not) to instantiate ring-LWE
• scientific article; zbMATH DE number 4083758 (Why is no real title available?)
• scientific article; zbMATH DE number 2107000 (Why is no real title available?)
• scientific article; zbMATH DE number 967875 (Why is no real title available?)
• NFLlib: NTT-Based Fast Lattice Library
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• On the condition number of the Vandermonde matrix of the \(n\)th cyclotomic polynomial
• On the height of cyclotomic polynomials
• On the ring-LWE and polynomial-LWE problems
• On the RLWE/PLWE equivalence for cyclotomic number fields
• Pseudorandomness of ring-LWE for any ring and modulus
• Ring-LWE in polynomial rings
• RLWE/PLWE equivalence for the maximal totally real subextension of the \(2^rpq\)-th cyclotomic field
• RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices
• TFHE: fast fully homomorphic encryption over the torus
• The shortest vector in a lattice is hard to approximate to within some constant
• Worst-case to average-case reductions for module lattices

This page was built for publication: Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950864)