default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaus Diem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c3]Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke:
Computation of a 768-Bit Prime Field Discrete Logarithm. EUROCRYPT (1) 2017: 185-201- [i3]Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke:
Computation of a 768-bit prime field discrete logarithm. IACR Cryptol. ePrint Arch. 2017: 67 (2017) - 2012
- [j5]Claus Diem:
On the use of expansion series for stream ciphers. LMS J. Comput. Math. 15: 326-340 (2012) - 2011
- [j4]Claus Diem:
On the Notion of Bit Complexity. Bull. EATCS 103: 35-52 (2011) - [j3]Claus Diem:
On the discrete logarithm problem in class groups of curves. Math. Comput. 80(273): 443-475 (2011)
2000 – 2009
- 2008
- [j2]Claus Diem, Emmanuel Thomé
:
Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three. J. Cryptol. 21(4): 593-611 (2008) - 2007
- [j1]Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem:
A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76(257): 475-492 (2007) - 2006
- [c2]Claus Diem:
An Index Calculus Algorithm for Plane Curves of Small Degree. ANTS 2006: 543-557 - 2005
- [i2]Claus Diem:
Index Calculus in Class Groups of Plane Curves of Small Degree. IACR Cryptol. ePrint Arch. 2005: 119 (2005) - 2004
- [c1]Claus Diem:
The XL-Algorithm and a Conjecture from Commutative Algebra. ASIACRYPT 2004: 323-337 - [i1]Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem:
A double large prime variation for small genus hyperelliptic index calculus. IACR Cryptol. ePrint Arch. 2004: 153 (2004)
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 2024-04-24 23:04 CEST 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:
