Stephen D. Miller

Orcid: 0000-0002-8804-7289

According to our database1, Stephen D. Miller authored at least 17 papers between 2004 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Generating cryptographically-strong random lattice bases and recognizing rotations of ℤ<sup>n</sup>.
IACR Cryptol. ePrint Arch., 2021

Generating Cryptographically-Strong Random Lattice Bases and Recognizing Rotations of $\mathbb {Z}^n$.
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

2019
Kissing Numbers and Transference Theorems from Generalized Tail Bounds.
SIAM J. Discret. Math., 2019

Stopping time signatures for some algorithms in cryptography.
IACR Cryptol. ePrint Arch., 2019

2018
Generalizations of Banaszczyk's transference theorems and tail bound.
IACR Cryptol. ePrint Arch., 2018

2017
Coppersmith's lattices and "focus groups": an attack on small-exponent RSA.
IACR Cryptol. ePrint Arch., 2017

2015
Non-abelian analogs of lattice rounding.
Groups Complex. Cryptol., 2015

2013
Object discovery in 3D scenes via shape analysis.
Proceedings of the 2013 IEEE International Conference on Robotics and Automation, 2013

Free your Camera: 3D Indoor Scene Understanding from Arbitrary Camera Motion.
Proceedings of the British Machine Vision Conference, 2013

2011
A distributed workflow management system with case study of real-life scientific applications.
Proceedings of the 30th IEEE International Performance Computing and Communications Conference, 2011

2010
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words.
Inf. Process. Lett., 2010

2008
Non-degeneracy of Pollard Rho Collisions
CoRR, 2008

2007
The Neutron Science TeraGrid Gateway: a TeraGrid science gateway to support the Spallation Neutron Source.
Concurr. Comput. Pract. Exp., 2007

2006
MV3: A new word based stream cipher using rapid mixing and revolving buffers.
IACR Cryptol. ePrint Arch., 2006

Spectral Analysis of Pollard Rho Collisions.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
Proceedings of the Advances in Cryptology, 2005

2004
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves.
IACR Cryptol. ePrint Arch., 2004


  Loading...