Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
24
views
0
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
0
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Lecture Notes in Computer Science
Algorithmic Number Theory
other
Editor(s):
Wieb Bosma
Publication date
(Print):
2000
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Author and book information
Book
ISBN (Print):
978-3-540-67695-9
ISBN (Electronic):
978-3-540-44994-2
Publication date (Print):
2000
DOI:
10.1007/10722028
SO-VID:
228f7903-8275-40bd-8aba-baa977b18f5b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 33
Rational Points Near Curves and Small Nonzero | x 3 − y 2| via Lattice Reduction
pp. 85
Lattice Reduction in Cryptology: An Update
pp. 185
Factoring Polynomials over ρ-Adic Fields
pp. 209
Strategies in Filtering in the Number Field Sieve
pp. 313
Counting Points on Hyperelliptic Curves over Finite Fields
pp. 385
A One Round Protocol for Tripartite Diffie–Hellman
pp. 395
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields