Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Booktitle=Proceedings of the 5th International Symposium on Algorithmic Number Theory, ANTS'2002 (Sydney, Australia, July 7-12, 2002)
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Implementing the Tate pairing
Steven D. Galbraith
,
Keith Harrison
,
David Soldera
Lecture Notes in Computer Science
2369
, 2002, pp. 324-337
Smooth orders and cryptographic applications
Carl Pomerance
,
Igor E. Shparlinski
Lecture Notes in Computer Science
2369
, 2002, pp. 338-348
Chinese remaindering for algebraic numbers in a hidden field
Igor E. Shparlinski
,
Ron Steinfeld
Lecture Notes in Computer Science
2369
, 2002, pp. 349-356
An algorithm for computing Weierstrass points
Florian Hess
Lecture Notes in Computer Science
2369
, 2002, pp. 357-371
New optimal tame towers of function fields over small finite fields
Wen-Ching W. Li
,
Hiren Maharaj
,
Henning Stichtenoth
,
Noam D. Elkies
Lecture Notes in Computer Science
2369
, 2002, pp. 372-389
Periodic continued fractions in elliptic function fields
Alfred J. van der Poorten
,
Xuan Chuong Tran
Lecture Notes in Computer Science
2369
, 2002, pp. 390-404
Fixed points and two-cycles of the discrete logarithm
Joshua Holden
Lecture Notes in Computer Science
2369
, 2002, pp. 405-415
Random Cayley digraphs and the discrete logarithm
Jeremy Horwitz
,
Ramarathnam Venkatesan
Lecture Notes in Computer Science
2369
, 2002, pp. 416-430
The function field sieve is quite special
Antoine Joux
,
Reynald Lercier
Lecture Notes in Computer Science
2369
, 2002, pp. 431-445
MPQS with three large primes
Paul Leyland
,
Arjen Lenstra
,
Bruce Dodson
,
Alec Muffett
,
Sam Wagstaff
Lecture Notes in Computer Science
2369
, 2002, pp. 446-460
An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields
Kazuto Matsuo
,
Jinhui Chao
,
Shigeo Tsujii
Lecture Notes in Computer Science
2369
, 2002, pp. 461-474
Factoring
N = pq^2
with the elliptic curve method
Peter Ebinger
,
Edlyn Teske
Lecture Notes in Computer Science
2369
, 2002, pp. 475-490
A new scheme for computing with algebraically closed fields
Allan Steel
Lecture Notes in Computer Science
2369
, 2002, pp. 491-505
Additive complexity and roots of polynomials over number fields and
p
-adic fields
J. Maurice Rojas
Lecture Notes in Computer Science
2369
, 2002, pp. 506-515
Seiten
<
1
2