Generating Shorter Bases for Hard Random Lattices

Article Properties
Cite
Alwen, Joël, and Chris Peikert. “Generating Shorter Bases for Hard Random Lattices”. Theory of Computing Systems, vol. 48, no. 3, 2010, pp. 535-53, https://doi.org/10.1007/s00224-010-9278-3.
Alwen, J., & Peikert, C. (2010). Generating Shorter Bases for Hard Random Lattices. Theory of Computing Systems, 48(3), 535-553. https://doi.org/10.1007/s00224-010-9278-3
Alwen J, Peikert C. Generating Shorter Bases for Hard Random Lattices. Theory of Computing Systems. 2010;48(3):535-53.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
Citations
Citations Analysis
The first research to cite this article was titled A Strong Binding Encryption Scheme from Lattices for Secret Broadcast and was published in 2012. The most recent citation comes from a 2024 study titled A Strong Binding Encryption Scheme from Lattices for Secret Broadcast . This article reached its peak citation in 2023 , with 18 citations.It has been cited in 57 different journals, 19% of which are open access. Among related journals, the IEEE Access cited this research the most, with 10 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year