Остановите войну!
for scientists:
default search action
Chris Peikert
- > Home > Persons > Chris Peikert
Publications
- 2020
- [c61]Chris Peikert:
He Gives C-Sieves on the CSIDH. EUROCRYPT (2) 2020: 463-492 - 2019
- [i50]Chris Peikert:
He Gives C-Sieves on the CSIDH. IACR Cryptol. ePrint Arch. 2019: 725 (2019) - 2016
- [j10]Chris Peikert:
A Decade of Lattice Cryptography. Found. Trends Theor. Comput. Sci. 10(4): 283-424 (2016) - [c46]Chris Peikert:
How (Not) to Instantiate Ring-LWE. SCN 2016: 411-430 - [i43]Chris Peikert:
How (Not) to Instantiate Ring-LWE. IACR Cryptol. ePrint Arch. 2016: 351 (2016) - 2015
- [i37]Chris Peikert:
A Decade of Lattice Cryptography. IACR Cryptol. ePrint Arch. 2015: 939 (2015) - 2014
- [c40]Chris Peikert:
Lattice Cryptography for the Internet. PQCrypto 2014: 197-219 - [i34]Chris Peikert:
Lattice Cryptography for the Internet. IACR Cryptol. ePrint Arch. 2014: 70 (2014) - 2010
- [c23]Chris Peikert:
An Efficient and Parallel Gaussian Sampler for Lattices. CRYPTO 2010: 80-97 - [c19]Chris Peikert:
Heuristics and Rigor in Lattice-Based Cryptography - (Invited Talk). SCN 2010: 54 - [i18]Chris Peikert:
An Efficient and Parallel Gaussian Sampler for Lattices. IACR Cryptol. ePrint Arch. 2010: 88 (2010) - 2009
- [c15]Chris Peikert:
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. STOC 2009: 333-342 - [c14]Chris Peikert:
Some Recent Progress in Lattice-Based Cryptography. TCC 2009: 72 - [i15]Chris Peikert:
Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography). IACR Cryptol. ePrint Arch. 2009: 359 (2009) - 2008
- [j1]Chris Peikert:
Limits on the Hardness of Lattice Problems in lp Norms. Comput. Complex. 17(2): 300-351 (2008) - [i14]Chris Peikert:
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. Theoretical Foundations of Practical Information Security 2008 - [i13]Chris Peikert:
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. Electron. Colloquium Comput. Complex. TR08 (2008) - [i12]Chris Peikert:
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. IACR Cryptol. ePrint Arch. 2008: 481 (2008) - 2007
- [c8]Chris Peikert:
Limits on the Hardness of Lattice Problems in ell _p Norms. CCC 2007: 333-346 - 2006
- [b1]Christopher Jason Peikert:
Cryptographic error correction. Massachusetts Institute of Technology, Cambridge, MA, USA, 2006 - [c5]Chris Peikert:
On Error Correction in the Exponent. TCC 2006: 167-183 - [i5]Chris Peikert:
Limits on the Hardness of Lattice Problems in ℓp Norms. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i1]Chris Peikert:
On Error Correction in the Exponent. IACR Cryptol. ePrint Arch. 2005: 105 (2005)
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 2024-04-21 17:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint