Research
Read how they describe their research on their University of Alberta profile.
Latest papers
Gross lattices of supersingular elliptic curves
arXiv (Cornell University) · 2025
Principal well-rounded ideals of real quadratic fields
Journal of Algebra and Its Applications · 2025 · senior author
Orientations and Cycles in Supersingular Isogeny Graphs
Association for Women in Mathematics series · 2024 · senior author
Latest funding
- $12,500
Efficient algorithms for ideal lattices, with applications
NSERC · 2019 · Principal investigator
- $112,000
Efficient algorithms for ideal lattices, with applications
NSERC · 2019 · Principal investigator
29 publications.
Gross lattices of supersingular elliptic curves
Chenfeng He, Gaurish Korpal, Ha Thanh Nguyen Tran, Christelle Vincent
Principal well-rounded ideals of real quadratic fields
Morgan Smith, Ha Thanh Nguyen Tran
Orientations and Cycles in Supersingular Isogeny Graphs
Sarah Noel Arpin, Mingjie Chen, Kristin Lauter, Renate Scheidler, Katherine E. Stange, Ha Thanh Nguyen Tran
Reduced Ideals from the Reduction Algorithm
Peng Tian, Ha Thanh Nguyen Tran
The size function for imaginary cyclic sextic fields
Ha Thanh Nguyen Tran, Peng Tian, Amy Feaver
Orienteering with One Endomorphism.
Arpin S, Chen M, Lauter KE, Scheidler R, Stange KE, Tran HTN
Well-Rounded ideal lattices of cyclic cubic and quartic fields
Dat T. Tran, Nam H. Le, Ha Thanh Nguyen Tran
Well-Rounded ideal lattices of cyclic cubic and quartic fields
Dat T. Tran, Nam H. Le, Ha Thanh Nguyen Tran
The size function for imaginary cyclic sextic fields
Ha Thanh Nguyen Tran, Peng Tian, Amy Feaver
Computing mod $ \ell $ Galois representations associated to modular forms for small primes
Peng Tian, Ha Thanh Nguyen Tran, Dung Hoang Duong
Efficient algorithms for ideal lattices, with applications
Principal investigators: Tran, Ha
Efficient algorithms for ideal lattices, with applications
Principal investigators: Tran, Ha
Keywords: ideal lattice; reduced ideal; reduction algorithm; lll-algorithm; the size function; well-rounded lattice; shortest vector problem; closest vector problem; lattice-based cryptography; physical layer security
From public funding decisions: CIHR since 2008, NSERC since 1991 and SSHRC since 1998 with their latest competition results, the Canada Foundation for Innovation, Genome Canada, the Canadian Space Agency, Canada Research Chairs, the Fonds de recherche du Québec, Ontario research funding, Michael Smith Health Research BC, the Canadian Cancer Society, Heart & Stroke and Brain Canada.
Frequent collaborators
A short, specific email works best. This draft uses one of their recent papers; replace the parts in brackets with your own details before sending.
Profile data last refreshed on September 29, 2026 from the university directory, publication records and public research funding records.