default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Lindner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j3]Pierre-Louis Cayrel, Mohammed Meziani, Ousmane Ndiaye
, Richard Lindner, Rosemberg Silva:
A pseudorandom number generator based on worst-case lattice problems. Appl. Algebra Eng. Commun. Comput. 28(4): 283-294 (2017)- 2013
- [j2]Paulo S. L. M. Barreto, Rafael Misoczki, Richard Lindner:
Decoding Square-Free Goppa Codes Over $\BBF_{p}$. IEEE Trans. Inf. Theory 59(10): 6851-6858 (2013) - 2011
- [b1]Richard Lindner:
Towards efficient lattice-based cryptography. Darmstadt University of Technology, 2011, pp. 1-71 - [c8]Richard Lindner, Chris Peikert:
Better Key Sizes (and Attacks) for LWE-Based Encryption. CT-RSA 2011: 319-339 - [c7]Rosemberg Silva, Pierre-Louis Cayrel, Richard Lindner:
A lattice-based batch identification scheme. ITW 2011: 215-219 - [c6]Paulo S. L. M. Barreto, Richard Lindner, Rafael Misoczki:
Monoidic Codes in Cryptography. PQCrypto 2011: 179-199 - [i8]Paulo S. L. M. Barreto, Richard Lindner, Rafael Misoczki:
Decoding square-free Goppa codes over $\F_p$. CoRR abs/1103.3296 (2011) - [i7]Paulo S. L. M. Barreto, Richard Lindner, Rafael Misoczki:
Monoidic Codes in Cryptography. IACR Cryptol. ePrint Arch. 2011: 371 (2011) - 2010
- [c5]Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva:
A Lattice-Based Threshold Ring Signature Scheme. LATINCRYPT 2010: 255-272 - [c4]Pierre-Louis Cayrel, Richard Lindner, Markus Rückert, Rosemberg Silva:
Improved Zero-Knowledge Identification with Lattices. ProvSec 2010: 1-17 - [i6]Paulo S. L. M. Barreto, Richard Lindner, Rafael Misoczki:
Decoding square-free Goppa codes over Fp. IACR Cryptol. ePrint Arch. 2010: 372 (2010) - [i5]Richard Lindner, Chris Peikert:
Better Key Sizes (and Attacks) for LWE-Based Encryption. IACR Cryptol. ePrint Arch. 2010: 613 (2010)
2000 – 2009
- 2009
- [j1]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider:
Post-quantum cryptography: lattice signatures. Computing 85(1-2): 105-125 (2009) - [c3]Johannes Buchmann, Richard Lindner:
Secure Parameters for SWIFFT. INDOCRYPT 2009: 1-17 - [i4]Johannes Buchmann, Richard Lindner:
Density of Ideal Lattices. Algorithms and Number Theory 2009 - 2008
- [c2]Johannes Buchmann, Richard Lindner, Markus Rückert:
Explicit Hard Instances of the Shortest Vector Problem. PQCrypto 2008: 79-94 - [c1]Johannes Buchmann, Martin Döring, Richard Lindner:
Efficiency Improvement for NTRU. Sicherheit 2008: 163-178 - [i3]Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider:
Explicit hard instances of the shortest vector problem. IACR Cryptol. ePrint Arch. 2008: 333 (2008) - [i2]Johannes Buchmann, Richard Lindner:
Secure Parameters for SWIFFT. IACR Cryptol. ePrint Arch. 2008: 493 (2008) - 2007
- [i1]Jintai Ding, Richard Lindner:
Identifying Ideal Lattices. IACR Cryptol. ePrint Arch. 2007: 322 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
