research-article

Algebraic algorithms for LWE problems

Authors:

Martin R. Albrecht,

Carlos Cid,

Jean-Charles Faugère,

Robert Fitzpatrick,

Ludovic PerretAuthors Info & Claims

ACM Communications in Computer Algebra, Volume 49, Issue 2

Page 62

https://doi.org/10.1145/2815111.2815158

Published: 14 August 2015 Publication History

Get Access

Abstract

No abstract available.

Cited By

View all

Bouillaguet CSauvage J(2024)Preliminary Cryptanalysis of the Biscuit Signature SchemeIACR Communications in Cryptology10.62056/aemp-4c2hOnline publication date: 9-Apr-2024
https://doi.org/10.62056/aemp-4c2h
Bai SJangir HNgo TYoumans W(2024)An algebraic algorithm for breaking NTRU with multiple keysDesigns, Codes and Cryptography10.1007/s10623-024-01473-zOnline publication date: 10-Aug-2024
https://doi.org/10.1007/s10623-024-01473-z
Jain ALin HSaha S(2024)A Systematic Study of Sparse LWEAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68382-4_7(210-245)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68382-4_7
Show More Cited By

Recommendations

Efficient Chosen-Ciphertext Secure Encryption from R-LWE

In order to construct efficient public-key encryption scheme that is secure against adaptive chosen-ciphertext attacks (CCA), an efficient signature scheme and an identity-based encryption (IBE) scheme from the learning with errors over rings are ...
Multi-key FHE from LWE, Revisited
Proceedings, Part II, of the 14th International Conference on Theory of Cryptography - Volume 9986

Traditional fully homomorphic encryption FHE schemes only allow computation on data encrypted under a single key. López-Alt, Tromer, and Vaikuntanathan STOC 2012 proposed the notion of multi-key FHE, which allows homomorphic computation on ciphertexts ...
Efficient Linear Homomorphic Encryption from LWE Over Rings

As the basis for secure public-key encryption under various cases, the learning with errors (LWE) problem has proved to be versatile for encryption schemes. Unfortunately, it tends not to be efficient enough for practical applications. For improving the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra

ACM Communications in Computer Algebra Volume 49, Issue 2

June 2015

66 pages

ISSN:1932-2232

EISSN:1932-2240

DOI:10.1145/2815111

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 August 2015

Published in SIGSAM-CCA Volume 49, Issue 2

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bouillaguet CSauvage J(2024)Preliminary Cryptanalysis of the Biscuit Signature SchemeIACR Communications in Cryptology10.62056/aemp-4c2hOnline publication date: 9-Apr-2024
https://doi.org/10.62056/aemp-4c2h
Bai SJangir HNgo TYoumans W(2024)An algebraic algorithm for breaking NTRU with multiple keysDesigns, Codes and Cryptography10.1007/s10623-024-01473-zOnline publication date: 10-Aug-2024
https://doi.org/10.1007/s10623-024-01473-z
Jain ALin HSaha S(2024)A Systematic Study of Sparse LWEAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68382-4_7(210-245)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68382-4_7
Steiner M(2024)The Complexity of Algebraic Algorithms for LWEAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58734-4_13(375-403)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58734-4_13
Lou PSahai ASivashankar V(2023)Relinearization Attack On LPN Over Large FieldsThe Computer Journal10.1093/comjnl/bxad07067:4(1438-1442)Online publication date: 14-Jul-2023
https://doi.org/10.1093/comjnl/bxad070
Boudgoust KJeudy CRoux-Langlois AWen W(2023)On the Hardness of Module Learning with Errors with Short DistributionsJournal of Cryptology10.1007/s00145-022-09441-336:1Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1007/s00145-022-09441-3
Esgin MSteinfeld RLiu DRuj S(2023)Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFsAdvances in Cryptology – CRYPTO 202310.1007/978-3-031-38554-4_16(484-517)Online publication date: 20-Aug-2023
https://dl.acm.org/doi/10.1007/978-3-031-38554-4_16
Bi LLu XLuo JWang KZhang Z(2022)Hybrid dual attack on LWE with arbitrary secretsCybersecurity10.1186/s42400-022-00115-y5:1Online publication date: 1-Aug-2022
https://doi.org/10.1186/s42400-022-00115-y
Biasse JBonnetain XKirshanova ESchrottenloher ASong F(2022)Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptographyIET Information Security10.1049/ise2.1208117:2(171-209)Online publication date: 29-Aug-2022
https://dl.acm.org/doi/10.1049/ise2.12081
Zhao LWang XHuang X(2021)Verifiable single-server private information retrieval from LWE with binary errorsInformation Sciences10.1016/j.ins.2020.08.071546(897-923)Online publication date: Feb-2021
https://doi.org/10.1016/j.ins.2020.08.071
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Efficient Chosen-Ciphertext Secure Encryption from R-LWE

Multi-key FHE from LWE, Revisited

Efficient Linear Homomorphic Encryption from LWE Over Rings

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations