default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Shumow
Person information
- affiliation: Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Sharon Goldberg, Miro Haller, Nadia Heninger, Mike Milano, Dan Shumow, Marc Stevens, Adam Suhl:
RADIUS/UDP Considered Harmful. USENIX Security Symposium 2024- 2023
- [j3]Daniel Shumow:
Incorrectly Generated RSA Keys: How I Learned To Stop Worrying And Recover Lost Plaintexts. Comput. J. 66(6): 1342-1349 (2023) - 2020
- [i9]Daniel Shumow:
Incorrectly Generated RSA Keys: How To Recover Lost Plaintexts. IACR Cryptol. ePrint Arch. 2020: 1059 (2020)
2010 – 2019
- 2019
- [c5]Joanne Woodage, Dan Shumow:
An Analysis of NIST SP 800-90A. EUROCRYPT (2) 2019: 151-180 - [i8]Greg Zaverucha
, Dan Shumow:
Are Certificate Thumbprints Unique? IACR Cryptol. ePrint Arch. 2019: 130 (2019) - 2018
- [i7]Joanne Woodage, Dan Shumow:
An Analysis of the NIST SP 800-90A Standard. IACR Cryptol. ePrint Arch. 2018: 349 (2018) - 2017
- [c4]Marc Stevens, Daniel Shumow:
Speeding up detection of SHA-1 collision attacks using unavoidable attack conditions. USENIX Security Symposium 2017: 881-897 - [i6]Marc Stevens, Daniel Shumow:
Speeding up detection of SHA-1 collision attacks using unavoidable attack conditions. IACR Cryptol. ePrint Arch. 2017: 173 (2017) - 2016
- [j2]Dustin Moody, Daniel Shumow:
Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves. Math. Comput. 85(300): 1929-1951 (2016) - 2013
- [j1]Jonathan Kaveh Valamehr, Melissa Chase, Seny Kamara, Andrew Putnam, Daniel Shumow, Vinod Vaikuntanathan, Timothy Sherwood:
Inspection-Resistant Memory Architectures. IEEE Micro 33(3): 48-56 (2013) - [c3]Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, Gregory M. Zaverucha:
Montgomery Multiplication Using Vector Instructions. Selected Areas in Cryptography 2013: 471-489 - [i5]Joppe W. Bos, Peter L. Montgomery, Daniel Shumow, Gregory M. Zaverucha:
Montgomery Multiplication Using Vector Instructions. IACR Cryptol. ePrint Arch. 2013: 519 (2013) - 2012
- [c2]Jonathan Valamehr, Melissa Chase, Seny Kamara, Andrew Putnam, Daniel Shumow, Vinod Vaikuntanathan, Timothy Sherwood:
Inspection resistant memory: Architectural support for security from physical examination. ISCA 2012: 130-141 - [c1]Tolga Acar, Kristin E. Lauter, Michael Naehrig, Daniel Shumow:
Affine Pairings on ARM. Pairing 2012: 203-209 - 2011
- [i4]Tolga Acar, Kristin E. Lauter, Michael Naehrig, Daniel Shumow:
Affine Pairings on ARM. IACR Cryptol. ePrint Arch. 2011: 243 (2011) - [i3]Dustin Moody, Daniel Shumow:
Analogues of Velu's formulas for Isogenies on Alternate Models of Elliptic Curves. IACR Cryptol. ePrint Arch. 2011: 430 (2011)
2000 – 2009
- 2009
- [i2]Daniel Shumow:
Isogenies of Elliptic Curves: A Computational Approach. CoRR abs/0910.5370 (2009) - [i1]Daniel Shumow:
Isogenies of Elliptic Curves: A Computational Approach. IACR Cryptol. ePrint Arch. 2009: 522 (2009)
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-10-07 21:23 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:
