Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings

DOI10.1007/BFb0054849zbMath0891.00022OpenAlexW2496824633MaRDI QIDQ1389774

No author found.

Publication date: 1 July 1998

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0054849

zbMATH Keywords

ProceedingsSymposiumAlgorithmic number theoryPortland, OR (USA)ANTS-III

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to number theory (11-06) Computational number theory (11Yxx)

Related Items (5)

Smooth ideals in hyperelliptic function fields ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ Factoring polynomials over finite fields: A survey ⋮ Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols

This page was built for publication: Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings