Rounding in the rings (Q2096527)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rounding in the rings	scientific article

Statements

scholarly article

0 references

Rounding in the rings (English)

0 references

0 references

0 references

publication date

9 November 2022

0 references

zbMATH Keywords

ring leftover hash lemma

0 references

ring-LWR

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-56880-1_11

0 references

On the concrete hardness of learning with errors

0 references

Learning with Rounding, Revisited

0 references

Middle-product learning with rounding problem and its applications

0 references

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance

0 references

Pseudorandom Functions and Lattices

0 references

Round5: compact and fast post-quantum public-key encryption

0 references

On the Hardness of Learning with Rounding over Small Modulus

0 references

Order-LWE and the hardness of ring-LWE with entropic secrets

0 references

Classical hardness of learning with errors

0 references

On error distributions in ring-based LWE

0 references

Attacks on the Search RLWE Problem with Small Errors

0 references

On the hardness of the computational ring-LWR problem and its applications

0 references

(In)security of ring-LWE under partial key exposure

0 references

Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

Weak Instances of PLWE

0 references

Provably Weak Instances of Ring-LWE

0 references

A normal integral basis theorem

0 references

Faster Gaussian sampling for trapdoor lattices with arbitrary modulus

0 references

Building an efficient lattice gadget toolkit: Subgaussian sampling and more

0 references

Trapdoors for hard lattices and new cryptographic constructions

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

Gaussian sampling over the integers: efficient, generic, constant-time

0 references

Advances in cryptology -- EUROCRYPT 2018. 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 -- May 3, 2018. Proceedings. Part I

0 references

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

0 references

An Efficient and Parallel Gaussian Sampler for Lattices

0 references

How (Not) to Instantiate Ring-LWE

0 references

A Decade of Lattice Cryptography

0 references

Algebraically structured LWE. Revisited

0 references

Pseudorandomness of ring-LWE for any ring and modulus

0 references

Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings

0 references

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

0 references

On the ring-LWE and polynomial-LWE problems

0 references

Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-56880-1_11

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2096527

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