• 567 Citations
  • 14 h-Index
19992018
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Dive into the research topics where Sean Hallgren is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 2 Similar Profiles
Polynomials Engineering & Materials Science
Quantum Algorithms Mathematics
Quantum computers Engineering & Materials Science
Fourier transforms Engineering & Materials Science
Number theory Engineering & Materials Science
Cryptography Engineering & Materials Science
Number field Mathematics
Sampling Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1999 2018

  • 567 Citations
  • 14 h-Index
  • 10 Conference contribution
  • 7 Article
  • 4 Conference article
  • 1 Paper
4 Citations (Scopus)

Supersingular isogeny graphs and endomorphism rings: reductions and solutions

Eisenträger, K., Hallgren, S., Lauter, K., Morrison, T. & Petit, C., Jan 1 2018, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings. Nielsen, J. B. & Rijmen, V. (eds.). Springer Verlag, p. 329-368 40 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10822 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Isogeny
Hash functions
Endomorphism Ring
Algebra
Maximal Order

How hard is deciding trivial versus nontrivial in the dihedral coset problem

Chia, N. H. & Hallgren, S., Sep 1 2016, 11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 61. 6

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Set theory
Hardness
Sampling
3 Citations (Scopus)

Classical cryptographic protocols in a quantum world

Hallgren, S., Smith, A. & Song, F., Jun 26 2015, In : International Journal of Quantum Information. 13, 4, 1550028.

Research output: Contribution to journalArticle

cryptography
polynomials
time functions
evaluation
learning
18 Citations (Scopus)

A quantum algorithm for computing the unit group of an arbitrary degree number field

Eisentraeger, A. K., Hallgren, S., Kitaev, A. & Song, F., Jan 1 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 293-302 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Number theory
Cryptography
Polynomials
19 Citations (Scopus)

Weak instances of PLWE

Eisenträger, K., Hallgren, S. & Lauter, K., Jan 1 2014, Selected Areas in Cryptography - SAC 2014 - 21st International Conference, Revised Selected Papers. Joux, A. & Youssef, A. (eds.). Springer Verlag, p. 183-194 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8781).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Number field
Polynomials
Cyclotomic numbers
Costs
Cyclotomic Fields