How (Not) to Instantiate Ring-LWE (Q2827731)

From MaRDI portal

Revision as of 18:19, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	How (Not) to Instantiate Ring-LWE	scientific article

Statements

scholarly article

0 references

How (Not) to Instantiate Ring-LWE (English)

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

21 October 2016

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-44618-9_22

0 references

Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling

0 references

A sieve algorithm for the shortest lattice vector problem

0 references

Practical Bootstrapping in Quasilinear Time

0 references

New Algorithms for Learning in Presence of Errors

0 references

Noise-tolerant learning, the parity problem, and the statistical query model

0 references

Classical hardness of learning with errors

0 references

Provably Weak Instances of Ring-LWE Revisited

0 references

Weak Instances of PLWE

0 references

Provably Weak Instances of Ring-LWE

0 references

Better Key Sizes (and Attacks) for LWE-Based Encryption

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

A Toolkit for Ring-LWE Cryptography

0 references

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

Lattice-based Cryptography

0 references

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

Lattice Cryptography for the Internet

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-44618-9_22

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2827731

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2827731&oldid=36281519"