OpenAlex
PricingAboutJobs
Log inGet started
Work

Worst-case to average-case reductions for module lattices

HTML

Year: 2014
Type: article
Source: Designs Codes and Cryptography
DOI: 10.1007/s10623-014-9938-4
Authors: Adeline Langlois, Damien Stehlé
Institutions: Lyon 1 Université, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire de l'Informatique du Parallélisme, ARIC: Arithmétiques des ordinateurs, méthodes formelles, génération de code
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: module lattices, worst-case to average-case reductions, module learning with errors, ring learning with errors, learning with errors, lattice-based cryptography, ideal lattices, polynomial rings, hardness assumptions

Open Access status: closed
OpenAlex ID: W1985439922
FWCI: 7.179
Cites: 50
Cited by: 849
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security