Trace-based cryptanalysis of cyclotomic R_q, 0 R_q-PLWE for the non-split case

DOI10.46298/CM.11153zbMATH Open1546.94053MaRDI QIDQ6594641FDOQ6594641

Raúl Durán Díaz, Beatriz Barbero-Lucas, Iván Blanco-Chacón, Rahinatou Yuh Njah Nchiwo

Publication date: 28 August 2024

Published in: Communications in Mathematics (Search for Journal in Brave)

zbMATH Keywords

lattice-based cryptographyring learning with errorspolynomial learning with errors

Mathematics Subject Classification ID

Randomized algorithms (68W20) Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• On lattices, learning with errors, random linear codes, and cryptography
• Efficient Public Key Encryption Based on Ideal Lattices
• Polynomial evaluation over finite fields: new algorithms and complexity bounds
• On Ideal Lattices and Learning with Errors over Rings
• Explicit factorizations of cyclotomic polynomials over finite fields
• On the ring-LWE and polynomial-LWE problems
• Ring-LWE in Polynomial Rings
• Provably Weak Instances of Ring-LWE
• Ring-LWE cryptography for the number theorist
• On the condition number of the Vandermonde matrix of the \(n\)th cyclotomic polynomial
• On the RLWE/PLWE equivalence for cyclotomic number fields
• RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices

Cited In (1)

• Euclidean lattices: theory and applications

This page was built for publication: Trace-based cryptanalysis of cyclotomic \(R_{q, 0} \times R_q\)-PLWE for the non-split case

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