default search action
Stephen D. Miller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c7]Tamar Lichter Blanks, Stephen D. Miller
:
Generating Cryptographically-Strong Random Lattice Bases and Recognizing Rotations of $\mathbb {Z}^n$. PQCrypto 2021: 319-338 - [i16]Tamar Lichter Blanks, Stephen D. Miller:
Generating cryptographically-strong random lattice bases and recognizing rotations of Zn. CoRR abs/2102.06344 (2021) - [i15]Tamar Lichter Blanks, Stephen D. Miller:
Generating cryptographically-strong random lattice bases and recognizing rotations of ℤn. IACR Cryptol. ePrint Arch. 2021: 154 (2021)
2010 – 2019
- 2019
- [j4]Stephen D. Miller
Kissing Numbers and Transference Theorems from Generalized Tail Bounds. SIAM J. Discret. Math. 33(3): 1313-1325 (2019) - [i14]Percy Deift, Stephen D. Miller, Thomas Trogdon:
Stopping time signatures for some algorithms in cryptography. CoRR abs/1905.08408 (2019) - [i13]Percy Deift, Stephen D. Miller, Thomas Trogdon:
Stopping time signatures for some algorithms in cryptography. IACR Cryptol. ePrint Arch. 2019: 533 (2019) - 2018
- [i12]Stephen D. Miller, Noah Stephens-Davidowitz:
Generalizations of Banaszczyk's transference theorems and tail bound. IACR Cryptol. ePrint Arch. 2018: 188 (2018) - 2017
- [i11]Stephen D. Miller, Bhargav Narayanan, Ramarathnam Venkatesan:
Coppersmith's lattices and "focus groups": an attack on small-exponent RSA. CoRR abs/1708.09445 (2017) - [i10]Stephen D. Miller, Bhargav Narayanan, Ramarathnam Venkatesan:
Coppersmith's lattices and "focus groups": an attack on small-exponent RSA. IACR Cryptol. ePrint Arch. 2017: 835 (2017) - 2015
- [j3]Evgeni Begelfor, Stephen D. Miller, Ramarathnam Venkatesan:
Non-abelian analogs of lattice rounding. Groups Complex. Cryptol. 7(2): 117-133 (2015) - [i9]Evgeni Begelfor, Stephen D. Miller, Ramarathnam Venkatesan:
Non-Abelian Analogs of Lattice Rounding. CoRR abs/1501.03056 (2015) - [i8]Evgeni Begelfor, Stephen D. Miller, Ramarathnam Venkatesan:
Non-Abelian Analogs of Lattice Rounding. IACR Cryptol. ePrint Arch. 2015: 24 (2015) - 2013
- [c6]Axel Furlan, Stephen D. Miller, Domenico G. Sorrenti, Li Fei-Fei, Silvio Savarese:
Free your Camera: 3D Indoor Scene Understanding from Arbitrary Camera Motion. BMVC 2013 - [c5]Andrej Karpathy, Stephen D. Miller, Li Fei-Fei:
Object discovery in 3D scenes via shape analysis. ICRA 2013: 2088-2095 - 2011
- [c4]Qishi Wu, Mengxia Zhu, Yi Gu, Xukang Lu, Patrick Brown, Michael A. Reuter, Stephen D. Miller:
A distributed workflow management system with case study of real-life scientific applications. IPCCC 2011: 1-8 - 2010
- [j2]Nathan Keller, Stephen D. Miller
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words. Inf. Process. Lett. 110(4): 129-132 (2010)
2000 – 2009
- 2009
- [i7]Nathan Keller, Stephen D. Miller:
Distinguishing Attacks on Stream Ciphers Based on Arrays of Pseudo-random Words. IACR Cryptol. ePrint Arch. 2009: 412 (2009) - 2008
- [i6]Stephen D. Miller, Ramarathnam Venkatesan:
Non-degeneracy of Pollard Rho Collisions. CoRR abs/0808.0469 (2008) - 2007
- [j1]John W. Cobb, Al Geist, James Arthur Kohl, Stephen D. Miller, Peter F. Peterson
The Neutron Science TeraGrid Gateway: a TeraGrid science gateway to support the Spallation Neutron Source. Concurr. Comput. Pract. Exp. 19(6): 809-826 (2007) - [c3]Nathan Keller, Stephen D. Miller
MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers. CT-RSA 2007: 1-19 - 2006
- [c2]Stephen D. Miller
Spectral Analysis of Pollard Rho Collisions. ANTS 2006: 573-581 - [i5]Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan:
MV3: A new word based stream cipher using rapid mixing and revolving buffers. CoRR abs/cs/0610048 (2006) - [i4]Stephen D. Miller, Ramarathnam Venkatesan:
Spectral Analysis of Pollard Rho Collisions. CoRR abs/math/0603727 (2006) - [i3]Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan:
MV3: A new word based stream cipher using rapid mixing and revolving buffers. IACR Cryptol. ePrint Arch. 2006: 341 (2006) - 2005
- [c1]David Jao
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? ASIACRYPT 2005: 21-40 - 2004
- [i2]David Jao, Stephen D. Miller, Ramarathnam Venkatesan:
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves. CoRR math.NT/0411378 (2004) - [i1]David Jao, Stephen D. Miller, Ramarathnam Venkatesan:
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves. IACR Cryptol. ePrint Arch. 2004: 312 (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-10-07 21:22 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: