On the integer polynomial learning with errors problem
type: Item
instance of: scholarly article
title: On the integer polynomial learning with errors problem
zbMATH Open document ID: 1479.94155
DOI: 10.1007/978-3-030-75245-3_8
author: Julien Devevey
author: Amin Sakzad
author: Damien Stehlé
author: Ron Steinfeld
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 62M10
zbMATH DE Number: 7450180
zbMATH Keywords: Rényi divergence analysis techniques
MaRDI profile type: Publication
full work available at URL: 978-3-030-75245-3 8
OpenAlex ID: W3164095070
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: Q1683009
cites work: A new public-key cryptosystem via Mersenne numbers
cites work: A framework for cryptographic problems from linear algebra
cites work: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Tighter proofs of CCA security in the quantum random oracle model
cites work: Classical hardness of learning with errors
cites work: Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
cites work: Pseudorandom Functions and Lattices
cites work: Q2778849
cites work: Integer Version of Ring-LWE and Its Applications
cites work: A modular analysis of the Fujisaki-Okamoto transformation
cites work: Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Worst-case to average-case reductions for module lattices
cites work: GGHLite: More Efficient Multilinear Maps from Ideal Lattices
cites work: Pseudorandomness of ring-LWE for any ring and modulus
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: On the ring-LWE and polynomial-LWE problems
cites work: Efficient Public Key Encryption Based on Ideal Lattices
cites work: Tightly-secure key-encapsulation mechanism in the quantum random oracle model
description: scientific article; zbMATH DE number 7450180