Sean Hallgren

According to our database1, Sean Hallgren authored at least 27 papers between 1999 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Supersingular isogeny graphs and endomorphism rings: reductions and solutions.
IACR Cryptology ePrint Archive, 2018

On Basing One-way Permutations on NP-hard Problems under Quantum Reductions.
CoRR, 2018

2017
On the Hardness of Computing Endomorphism Rings of Supersingular Elliptic Curves.
IACR Cryptology ePrint Archive, 2017

2016
Quantum Algorithms for Class Group of a Number Field.
Encyclopedia of Algorithms, 2016

Quantum Algorithm for Solving Pell's Equation.
Encyclopedia of Algorithms, 2016

Quantum Algorithm for Factoring.
Encyclopedia of Algorithms, 2016

How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?.
Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

2015
Classical Cryptographic Protocols in a Quantum World.
IACR Cryptology ePrint Archive, 2015

2014
Weak Instances of PLWE.
IACR Cryptology ePrint Archive, 2014

A quantum algorithm for computing the unit group of an arbitrary degree number field.
Proceedings of the Symposium on Theory of Computing, 2014

2013
The local Hamiltonian problem on a line with eight states is QMA-complete.
Quantum Information & Computation, 2013

2010
Limitations of quantum coset states for graph isomorphism.
J. ACM, 2010

Algorithms for Ray Class Groups and Hilbert Class Fields.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2008
Quantum Algorithms for Class Group of a Number Field.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Quantum Algorithm for Solving the Pell's Equation.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Quantum Algorithm for Factoring.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Superpolynomial Speedups Based on Almost Any Quantum Circuit.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem.
J. ACM, 2007

2006
Quantum Algorithms for Some Hidden Shift Problems.
SIAM J. Comput., 2006

2005
Fast quantum algorithms for computing the unit group and class group of a number field.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Quantum Noisy Rational Function Reconstruction.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2003
The Hidden Subgroup Problem and Quantum Computation Using Group Representations.
SIAM J. Comput., 2003

2000
Efficient Quantum Algorithms for Shifted Quadratic Character Problems
CoRR, 2000

Normal subgroup reconstruction and quantum computation using group representations.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

An Improved Quantum Fourier Transform Algorithm and Applications.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Quantum Fourier Sampling Simplified.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999


  Loading...