01714nlm0 22004811i 450 9900092373704033219783540319986000923737FED01000923737(Aleph)000923737FED0100092373720100926d2005----km-y0itay50------baengDEdrnn-008mamaaComputer Network SecurityRisorsa elettronicaThird International Workshop on Mathematical Methods, Models, and Architectures for Computer Network Security, MMM-ACNS 2005, St. Petersburg, Russia, September 24-28, 2005. ProceedingsediteBerlin ; HeidelbergSpringer2005Lecture Notes in Computer Science0302-97433685Documento elettronicoTestoFormato html, pdfGorodetsky,VladimirKotenko,IgorSkormin,VictorITUNINAREICATUNIMARCFull text per gli utenti Federico IIhttp://dx.doi.org/10.1007/11560326EB990009237370403321Algorithm Analysis and Problem ComplexityComputer Communication NetworksComputer Communication NetworksComputer scienceComputer ScienceComputer softwareComputers and SocietyData EncryptionData encryption (Computer science)Information SystemsManagement of Computing and Information SystemsOperating SystemsOperating systems (Computers)Computer Network Security772631UNINA05197nam 22007215 450 99646594430331620200701235714.03-540-44994-910.1007/10722028(CKB)1000000000548784(SSID)ssj0000321183(PQKBManifestationID)11246318(PQKBTitleCode)TC0000321183(PQKBWorkID)10263024(PQKB)11077804(DE-He213)978-3-540-44994-2(MiAaPQ)EBC3087838(PPN)155205056(EXLCZ)99100000000054878420121227d2000 u| 0engurnn|008mamaatxtccrAlgorithmic Number Theory[electronic resource] 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings /edited by Wieb Bosma1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (IX, 612 p.) Lecture Notes in Computer Science,0302-9743 ;1838Bibliographic Level Mode of Issuance: Monograph3-540-67695-3 Includes bibliographical references and index.Invited Talks -- The Complexity of Some Lattice Problems -- Rational Points Near Curves and Small Nonzero | x 3 ? y 2| via Lattice Reduction -- Coverings of Curves of Genus 2 -- Lattice Reduction in Cryptology: An Update -- Contributed Papers -- Construction of Secure C ab Curves Using Modular Curves -- Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensions -- New Results on Lattice Basis Reduction in Practice -- Baby-Step Giant-Step Algorithms for Non-uniform Distributions -- On Powers as Sums of Two Cubes -- Factoring Polynomials over ?-Adic Fields -- Strategies in Filtering in the Number Field Sieve -- Factoring Polynomials over Finite Fields and Stable Colorings of Tournaments -- Computing Special Values of Partial Zeta Functions -- Construction of Tables of Quartic Number Fields -- Counting Discriminants of Number Fields of Degree up to Four -- On Reconstruction of Algebraic Numbers -- Dissecting a Sieve to Cut Its Need for Space -- Counting Points on Hyperelliptic Curves over Finite Fields -- Modular Forms for GL(3) and Galois Representations -- Modular Symbols and Hecke Operators -- Fast Jacobian Group Arithmetic on C ab Curves -- Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem -- A One Round Protocol for Tripartite Diffie–Hellman -- On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields -- Component Groups of Quotients of J 0(N) -- Fast Computation of Relative Class Numbers of CM-Fields -- On Probable Prime Testing and the Computation of Square Roots mod n -- Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves -- Central Values of Artin L-Functions for Quaternion Fields -- The Pseudoprimes up to 1013 -- Computing the Number of Goldbach Partitions up to 5 108 -- Numerical Verification of the Brumer-Stark Conjecture -- Explicit Models of Genus 2 Curves with Split CM -- Reduction in Purely Cubic Function Fields of Unit Rank One -- Factorization in the Composition Algebras -- A Fast Algorithm for Approximately Counting Smooth Numbers -- Computing All Integer Solutions of a General Elliptic Equation -- A Note on Shanks’s Chains of Primes -- Asymptotically Fast Discrete Logarithms in Quadratic Number Fields -- Asymptotically Fast GCD Computation in ?[i].Lecture Notes in Computer Science,0302-9743 ;1838Number theoryData encryption (Computer science)AlgorithmsComputer science—MathematicsNumber Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/M25001Cryptologyhttps://scigraph.springernature.com/ontologies/product-market-codes/I28020Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Symbolic and Algebraic Manipulationhttps://scigraph.springernature.com/ontologies/product-market-codes/I17052Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Number theory.Data encryption (Computer science).Algorithms.Computer science—Mathematics.Number Theory.Cryptology.Algorithm Analysis and Problem Complexity.Symbolic and Algebraic Manipulation.Discrete Mathematics in Computer Science.512/.7Bosma Wiebedthttp://id.loc.gov/vocabulary/relators/edtAlgorithmic Number Theory Symposium(4th :2000 :Leiden, Netherlands)MiAaPQMiAaPQMiAaPQBOOK996465944303316Algorithmic Number Theory772632UNISA