Algorithmic number theory. 4th international symposium. ANTS-IV, Leiden, the Netherlands, July 2--7, 2000. Proceedings (Q5930664)

From MaRDI portal
Revision as of 18:19, 21 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1590198
Language Label Description Also known as
English
Algorithmic number theory. 4th international symposium. ANTS-IV, Leiden, the Netherlands, July 2--7, 2000. Proceedings
scientific article; zbMATH DE number 1590198

    Statements

    Algorithmic number theory. 4th international symposium. ANTS-IV, Leiden, the Netherlands, July 2--7, 2000. Proceedings (English)
    0 references
    23 April 2001
    0 references
    The articles of this volume will be reviewed individually. The preceding symposium (3rd, 1998) has been reviewed (see Zbl 0891.00022). Indexed articles: \textit{Cai, Jin-Yi}, The complexity of some lattice problems, 1-32 [Zbl 0988.11057] \textit{Elkies, Noam D.}, Rational points near curves and small nonzero \(|x^3-y^2|\) via lattice reduction, 33-63 [Zbl 0991.11072] \textit{Flynn, E. Victor}, Coverings of curves of genus 2, 65-84 [Zbl 0986.11042] \textit{Nguyen, Phong Q.; Stern, Jacques}, Lattice reduction in cryptology: An update, 85-112 [Zbl 0980.94010] \textit{Arita, Seigo}, Construction of secure \(C_{ab}\) curves using modular curves, 113-126 [Zbl 1009.11040] \textit{Auer, Roland}, Curves over finite fields with many rational points obtained by ray class field extensions, 127-134 [Zbl 0991.11031] \textit{Backes, Werner; Wetzel, Susanne}, New results on lattice basis reduction in practice, 135-152 [Zbl 0982.11072] \textit{Blackburn, Simon R.; Teske, Edlyn}, Baby-step giant-step algorithms for non-uniform distributions, 153-168 [Zbl 0999.11076] \textit{Bruin, Nils}, On powers as sums of two cubes, 169-184 [Zbl 0986.11021] \textit{Cantor, David G.; Gordon, Daniel M.}, Factoring polynomials over \(p\)-adic fields, 185-208 [Zbl 1006.11066] \textit{Cavallar, Stefania}, Strategies in filtering in the number field sieve, 209-231 [Zbl 1006.11076] \textit{Cheng, Qi; Huang, Ming-Deh A.}, Factoring polynomials over finite fields and stable colorings of tournaments, 233-245 [Zbl 1006.11084] \textit{Chinta, Gautam; Gunnells, Paul E.; Sczech, Robert}, Computing special values of partial zeta-functions, 247-256 [Zbl 1032.11049] \textit{Cohen, Henri; Diaz y Diaz, Francisco; Olivier, Michel}, Construction of tables of quartic number fields, 257-268 [Zbl 0987.11079] \textit{Cohen, Henri; Diaz y Diaz, Francisco; Olivier, Michel}, Counting discriminants of number fields of degree up to four, 269-283 [Zbl 0987.11080] \textit{Fieker, Claus; Friedrichs, Carsten}, On reconstruction of algebraic numbers, 285-296 [Zbl 0990.11084] \textit{Galway, William F.}, Dissecting a sieve to cut its need for space, 297-312 [Zbl 1032.11059] \textit{Gaudry, Pierrick; Harley, Robert}, Counting points on hyperelliptic curves over finite fields, 313-332 [Zbl 1011.11041] \textit{van Geemen, Bert; Top, Jaap}, Modular forms for \(\text{GL}(3)\) and Galois representations, 333-346 [Zbl 0985.11026] \textit{Gunnells, Paul E.}, Modular symbols and Hecke operators, 347-357 [Zbl 1032.11019] \textit{Harasawa, Ryuichi; Suzuki, Joe}, Fast Jacobian group arithmetic on \(C_{ab}\) curves, 359-376 [Zbl 1032.11025] \textit{Huang, Ming-Deh A.; Kueh, Ka Lam; Tan, Ki-Seng}, Lifting elliptic curves and solving the elliptic curve discrete logarithm problem, 377-384 [Zbl 1067.94012] \textit{Joux, Antoine}, A one round protocol for tripartite Diffie-Hellman, 385-393 [Zbl 1029.94026] \textit{Kohel, David R.; Shparlinski, Igor E.}, On exponential sums and group generators for elliptic curves over finite fields, 395-404 [Zbl 1032.11034] \textit{Kohel, David R.; Stein, William A.}, Component groups of quotients of \(J_0(N)\), 405-412 [Zbl 0984.11022] \textit{Louboutin, Stéphane}, Fast computation of relative class numbers of CM-fields, 413-422 [Zbl 1032.11047] \textit{Müller, Siguna}, On probable prime testing and the computation of square roots mod \(n\), 423-437 [Zbl 1048.11102] \textit{Nagao, Koh-ichi}, Improving group law algorithms for Jacobians of hyperelliptic curves, 439-447 [Zbl 1023.68132] \textit{Omar, Sami}, Central values of Artin \(L\)-functions for quaternion fields, 449-458 [Zbl 1032.11050] \textit{Pinch, Richard G. E.}, The pseudoprimes up to \(10^{13}\), 459-473 [Zbl 1032.11060] \textit{Richstein, Jörg}, Computing the number of Goldbach partitions up to \(5\cdot 10^8\), 475-490 [Zbl 0984.11049] \textit{Roblot, Xavier-François; Tangedal, Brett A.}, Numerical verification of the Brumer-Stark conjecture, 491-503 [Zbl 1161.11404] \textit{Rodriguez-Villegas, Fernando}, Explicit models of genus 2 curves with split CM, 505-513 [Zbl 1032.11026] \textit{Scheidler, Renate}, Reduction in purely cubic function fields of unit rank one, 515-532 [Zbl 1035.11057] \textit{Smith, Derek A.}, Factorization in the composition algebras, 533-537 [Zbl 1072.17500] \textit{Sorenson, Jonathan P.}, A fast algorithm for approximately counting smooth numbers, 539-549 [Zbl 1032.11039] \textit{Stroeker, Roel J.; Tzanakis, Nikolaos}, Computing all integer solutions of a general elliptic equation, 551-561 [Zbl 0991.11071] \textit{Teske, Edlyn; Williams, Hugh C.}, A note on Shanks's chains of primes, 563-580 [Zbl 1032.11065] \textit{Vollmer, Ulrich}, Asymptotically fast discrete logarithms in quadratic number fields, 581-594 [Zbl 1032.11064] \textit{Weilert, André}, Asymptotically fast GCD computation in \(\mathbb{Z}[i]\), 595-613 [Zbl 1032.11063]
    0 references
    Leiden (Netherlands)
    0 references
    Symposium
    0 references
    Proceedings
    0 references
    ANTS-IV
    0 references
    Algorithmic number theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references