8th Algorithmic Number Theory Symposium
The poster abstracts have been published in issue 164 of the ACM Communications in Computer Algebra. Here is the Table of Contents of the issue.
The best poster award as voted on by the ANTS-VIII participants was awarded to Genus 2 Curves With Split Jacobians by Kevin Doerksen of Simon Fraser University. The award included a gift certificate from Springer and a research book from A K Peters Publishers. Congratulations to Kevin on a very fine poster.
Calculating Really Big Cyclotomic Polynomials
Andrew Arnold and Michael Monagan, Simon Fraser University
(abstract) (poster)
Genus 2 Curves With Split Jacobians
Kevin Doerksen, Simon Fraser University
* * * Winner of the ANTS-VIII Best Poster Award * * *
(abstract) (poster)
A Variant of Wiener's Attack on RSA with Small Secret Exponent
Andrej Dujella, University of Zagreb
(abstract) (poster)
Computing the 2-Distribution of Points on Hermitian Surfaces
Frederic Edoukou, Institut de Mathématiques de Luminy
(abstract) (poster)
Curves of Genus 2 With Many Rational Points Via K3 Surfaces
Noam Elkies, Harvard University
(abstract)
Abstract Infrastructures of Unit Rank Two
Felix Fontein, University of Zürich
(abstract) (poster)
Minimal Heights and Regulators for Elliptic Surfaces
Sonal Jain, Courant Institute of Mathematical Sciences, New York University
(abstract) (poster)
Implementing a Feasible Attack against ECC2K-130 Certicom Challenge
Ahmad Lavasani and Reza Mohammadi
Concordia University and Sharif University of Technology
(abstract)
A Statistical Look at Maps of the Discrete Logarithm
Nathaniel W. Lindle and Joshua Holden
Rose-Hulman Institute of Technology
(abstract) (poster)
The Carmichael Numbers up to 1021
Richard Pinch, HMG
(abstract) (poster)
Computing L-polynomials of Non-Hyperelliptic Genus 4 and 5 Curves
Raminder Ruprai and Steven Galbraith
Royal Holloway University of London
(abstract) (poster)
More Constructing Pairing-Friendly Elliptic Curves for Cryptography
Tanaka Satoru and Ken Nakamula, Tokyo Metropolitan University
(abstract) (poster)
A Straight Line Program Computing the Integer Greatest Common Divisor
Sidi Mohamed Sedjelmaci, University of Paris-North
(abstract) (poster)
The Discrete Logarithm Problem on Elliptic Curves Defined Over Q
Masaya Yasuba, Fujitsu Laboratories Ltd.
(abstract) (poster)