Home > Mathematics and Science Textbooks > Mathematics > Number theory > Algorithmic Number Theory: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings(2369 Lecture Notes in Computer Science)
Algorithmic Number Theory: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings(2369 Lecture Notes in Computer Science)

Algorithmic Number Theory: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings(2369 Lecture Notes in Computer Science)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

TheAlgorithmicNumberTheorySymposiabeganin1994atCornellUniversity inIthaca,NewYorktorecognizethegrowingimportanceofalgorithmicwork in the theory of numbers. The subject of the conference is broadly construed toencompassadiversebodyofmathematics,andtocoverboththetheoretical andpracticaladvancesinthe?eld. Theyhavebeenheldeverytwoyearssince: inBordeaux(Universit'eBordeauxI)in1996,Portland(ReedCollege)in1998, Leiden(UniversiteitLeiden)in2000,andthepresentconferencehostedbythe MagmaComputationalAlgebraGroupattheUniversityofSydney. TheconferenceprogramincludedinvitedtalksbyManjulBhargava(Prin- ton),JohnCoates(Cambridge),AntoineJoux(DCSSICryptoLab),BjornP- nen(Berkeley),andTakakazuSatoh(Saitama),aswellas34contributedtalks invariousareasofnumbertheory. Inadditiontothemathematicalprogram,the conferenceincludedaspecialdinnertohonourAlfvanderPoortenofMacquarie University,ontheoccasionofhis60thbirthday. Eachpaperwasreviewedbyatleasttwoexpertsexternaltotheprogram committeeandtheselectionofpaperswasmadeonthebasisoftheserec- mendations. Weexpressourappreciationtothe66expertrefereeswhoprovided reportsonaverytightschedule. Refereeingofthesubmissionfromamemberof theMagmagroupwasorganizedbyJoeBuhler. Theprogramcommitteethanksthegenerousadvicefromorganizersofpre- ousANTSconferences,particularlyJoeBuhler,WiebBosma,HendrikLenstra, andBartdeSmit. TheconferencewasgenerouslysupportedbytheCollegeof ScienceandTechnology,theSchoolofMathematicsandStatistics(bothatthe UniversityofSydney),theAustralianDefenceScienceTechnologyOrganisation, andeSign. April2002 JohnCannon ClausFieker DavidKohel TableofContents InvitedTalks GaussCompositionandGeneralizations ...1 ManjulBhargava EllipticCurves-TheCrossroadsofTheoryandComputation...9 JohnCoates TheWeilandTatePairingsasBuildingBlocks forPublicKeyCryptosystems...20 AntoineJoux UsingEllipticCurvesofRankOnetowardstheUndecidability ofHilbert'sTenthProblemoverRingsofAlgebraicIntegers...33 BjornPoonen Onp-adicPointCountingAlgorithmsforEllipticCurves overFiniteFields...43 TakakazuSatoh NumberTheory OnArithmeticallyEquivalentNumberFieldsofSmallDegree ...67 WiebBosma,BartdeSmit ASurveyofDiscriminantCounting...80 HenriCohen,FranciscoDiazyDiaz,MichelOlivier AHigher-RankMersenneProblem...95 GrahamEverest,PeterRogers,ThomasWard AnApplicationofSiegelModularFunctions toKronecker'sLimitFormula...108 TakashiFukuda,KeiichiKomatsu ComputationalAspectsofNUCOMP...1 20 MichaelJ. Jacobson,Jr. ,AlfredJ. vanderPoorten E?cientComputationofClassNumbersofRealAbelianNumberFields. . 134 St'ephaneR. Louboutin AnAcceleratedBuchmannAlgorithmforRegulatorComputation inRealQuadraticFields...148 UlrichVollmer VIII TableofContents ArithmeticGeometry SomeGenus3CurveswithManyPoints ...163 RolandAuer,JaapTop 7 8 Trinomialsax +bx+candax +bx+c withGaloisGroupsofOrder168and8*168...172 NilsBruin,NoamD. Elkies ComputationsonModularJacobianSurfaces...189 EnriqueGonz'alez-Jim'enez,JosepGonz'TheAlgorithmicNumberTheorySymposiabeganin1994atCornellUniversity inIthaca,NewYorktorecognizethegrowingimportanceofalgorithmicwork in the theory of numbers. The subject of the conference is broadly construed toencompassadiversebodyofmathematics,andtocoverboththetheoretical andpracticaladvancesinthe?eld. Theyhavebeenheldeverytwoyearssince: inBordeaux(Universit'eBordeauxI)in1996,Portland(ReedCollege)in1998, Leiden(UniversiteitLeiden)in2000,andthepresentconferencehostedbythe MagmaComputationalAlgebraGroupattheUniversityofSydney. TheconferenceprogramincludedinvitedtalksbyManjulBhargava(Prin- ton),JohnCoates(Cambridge),AntoineJoux(DCSSICryptoLab),BjornP- nen(Berkeley),andTakakazuSatoh(Saitama),aswellas34contributedtalks invariousareasofnumbertheory. Inadditiontothemathematicalprogram,the conferenceincludedaspecialdinnertohonourAlfvanderPoortenofMacquarie University,ontheoccasionofhis60thbirthday. Eachpaperwasreviewedbyatleasttwoexpertsexternaltotheprogram committeeandtheselectionofpaperswasmadeonthebasisoftheserec- mendations. Weexpressourappreciationtothe66expertrefereeswhoprovided reportsonaverytightschedule. Refereeingofthesubmissionfromamemberof theMagmagroupwasorganizedbyJoeBuhler. Theprogramcommitteethanksthegenerousadvicefromorganizersofpre- ousANTSconferences,particularlyJoeBuhler,WiebBosma,HendrikLenstra, andBartdeSmit. TheconferencewasgenerouslysupportedbytheCollegeof ScienceandTechnology,theSchoolofMathematicsandStatistics(bothatthe UniversityofSydney),theAustralianDefenceScienceTechnologyOrganisation, andeSign. April2002 JohnCannon ClausFieker DavidKohel TableofContents InvitedTalks GaussCompositionandGeneralizations ...1 ManjulBhargava EllipticCurves-TheCrossroadsofTheoryandComputation...9 JohnCoates TheWeilandTatePairingsasBuildingBlocks forPublicKeyCryptosystems...20 AntoineJoux UsingEllipticCurvesofRankOnetowardstheUndecidability ofHilbert'sTenthProblemoverRingsofAlgebraicIntegers...33 BjornPoonen Onp-adicPointCountingAlgorithmsforEllipticCurves overFiniteFields...43 TakakazuSatoh NumberTheory OnArithmeticallyEquivalentNumberFieldsofSmallDegree ...67 WiebBosma,BartdeSmit ASurveyofDiscriminantCounting...80 HenriCohen,FranciscoDiazyDiaz,MichelOlivier AHigher-RankMersenneProblem...95 GrahamEverest,PeterRogers,ThomasWard AnApplicationofSiegelModularFunctions toKronecker'sLimitFormula...108 TakashiFukuda,KeiichiKomatsu ComputationalAspectsofNUCOMP...120 MichaelJ. Jacobson,Jr. ,AlfredJ. vanderPoorten E?cientComputationofClassNumbersofRealAbelianNumberFields. . 134 St'ephaneR. Louboutin AnAcceleratedBuchmannAlgorithmforRegulatorComputation inRealQuadraticFields...148 UlrichVollmer VIII TableofContents ArithmeticGeometry SomeGenus3CurveswithManyPoints ...163 RolandAuer,JaapTop 7 8 Trinomialsax +bx+candax +bx+c withGaloisGroupsofOrder168and8*168...172 NilsBruin,NoamD. Elkies ComputationsonModularJacobianSurfaces...1 89 EnriqueGonz'alez-Jim'enez,JosepGonz'alez,JordiGu'ardia IntegralPointsonPuncturedAbelianSurfaces...198 AndrewKresch,YuriTschinkel Genus2Curveswith(3,3)-SplitJacobian andLargeAutomorphismGroup...205 TonyShaska TransportableModularSymbolsandtheIntersectionPairing...219 HelenaA. Verrill EllipticCurvesandCM ActionofModularCorrespondencesaroundCMPoints...234 Jean-MarcCouveignes,ThierryHenocq 2 3 CurvesDy =x ?xofOddAnalyticRank...244 NoamD. Elkies ComparingInvariantsforClassFieldsofImaginaryQuadraticFields...252 AndreasEnge,Fran,coisMorain ADatabaseofEllipticCurves-FirstReport...267 WilliamA. Stein,MarkWatkins PointCounting IsogenyVolcanoesandtheSEAAlgorithm...276 MireilleFouquet,Fran,coisMorain FastEllipticCurvePointCountingUsingGaussianNormalBasis...292 HaeYoungKim,JungYoulPark,JungHeeCheon,JeHongPark, JaeHeonKim,SangGeunHahn AnExtensionofKedlaya'sAlgorithmtoArtin-SchreierCurves inCharacteristic2...308 JanDenef,FrederikVercauteren TableofContents IX Cryptography ImplementingtheTatePairing ...324 StevenD. Galbraith,KeithHarrison,DavidSoldera SmoothOrdersandCryptographicApplications...338 CarlPomerance,IgorE. Shparlinski ChineseRemainderingforAlgebraicNumbersinaHiddenField...3 49 IgorE. Shparlinski,RonSteinfeld FunctionFields AnAlgorithmforComputingWeierstrassPoints...357 FlorianHess NewOptimalTameTowersofFunctionFieldsoverSmallFiniteFields ...372 Wen-ChingW. Li,HirenMaharaj,HenningStichtenoth, NoamD. Elkies PeriodicContinuedFractionsinEllipticFunctionFields...390 AlfredJ. vanderPoorten,XuanChuongTran DiscreteLogarithmsandFactoring FixedPointsandTwo-CyclesoftheDiscreteLogarithm ...405 JoshuaHolden RandomCayleyDigraphsandtheDiscreteLogarithm...416 JeremyHorwitz,RamarathnamVenkatesan TheFunctionFieldSieveIsQuiteSpecial...431 AntoineJoux,ReynaldLercier MPQSwithThreeLargePrimes...446 PaulLeyland,ArjenLenstra,BruceDodson,AlecMu?ett,SamWagsta? AnImprovedBabyStepGiantStepAlgorithm forPointCountingofHyperellipticCurvesoverFiniteFields...461 KazutoMatsuo,JinhuiChao,ShigeoTsujii 2 FactoringN=pq withtheEllipticCurveMethod...475 PeterEbinger,EdlynTeske GrobnerBases ANewSchemeforComputingwithAlgebraicallyClosedFields...491 AllanSteel X TableofContents Complexity AdditiveComplexityandRootsofPolynomials overNumberFieldsandp-adicFields...506 J. MauriceRojas AuthorIndex...5 17 Gauss Composition and Generalizations ManjulBhargava Clay Mathematics Institute and Princeton University Abstract. We discuss several higher analogues of Gauss composition and consider their potential algorithmic applications.

Table of Contents:
Invited Talks.- Gauss Composition and Generalizations.- Elliptic Curves — The Crossroads of Theory and Computation.- The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems.- Using Elliptic Curves of Rank One towards the Undecidability of Hilbert’s Tenth Problem over Rings of Algebraic Integers.- On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields.- Number Theory.- On Arithmetically Equivalent Number Fields of Small Degree.- A Survey of Discriminant Counting.- A Higher-Rank Mersenne Problem.- An Application of Siegel Modular Functions to Kronecker’s Limit Formula.- Computational Aspects of NUCOMP.- Efficient Computation of Class Numbers of Real Abelian Number Fields.- An Accelerated Buchmann Algorithm for Regulator Computation in Real Quadratic Fields.- Arithmetic Geometry.- Some Genus 3 Curves with Many Points.- Trinomials ax 7 + bx + c and ax 8 + bx + c with Galois Groups of Order 168 and 8 · 168.- Computations on Modular Jacobian Surfaces.- Integral Points on Punctured Abelian Surfaces.- Genus 2 Curves with (3, 3)-Split Jacobian and Large Automorphism Group.- Transportable Modular Symbols and the Intersection Pairing.- Elliptic Curves and CM.- Action of Modular Correspondences around CM Points.- Curves Dy 2 = x 3 — x of Odd Analytic Rank.- Comparing Invariants for Class Fields of Imaginary Quadratic Fields.- A Database of Elliptic Curves — First Report.- Point Counting.- Isogeny Volcanoes and the SEA Algorithm.- Fast Elliptic Curve Point Counting Using Gaussian Normal Basis.- An Extension of Kedlaya’s Algorithm to Artin-Schreier Curves in Characteristic 2.- Cryptography.- Implementing the Tate Pairing.- Smooth Orders and Cryptographic Applications.- Chinese Remaindering for Algebraic Numbers in a Hidden Field.-Function Fields.- An Algorithm for Computing Weierstrass Points.- New Optimal Tame Towers of Function Fields over Small Finite Fields.- Periodic Continued Fractions in Elliptic Function Fields.- Discrete Logarithms and Factoring.- Fixed Points and Two-Cycles of the Discrete Logarithm.- Random Cayley Digraphs and the Discrete Logarithm.- The Function Field Sieve Is Quite Special.- MPQS with Three Large Primes.- An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields.- Factoring N = pq 2 with the Elliptic Curve Method.- Gröbner Bases.- A New Scheme for Computing with Algebraically Closed Fields.- Complexity.- Additive Complexity and Roots of Polynomials over Number Fields and -adic Fields.


Best Sellers


Product Details
  • ISBN-13: 9783540438632
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Depth: 25
  • Language: English
  • Returnable: N
  • Series Title: 2369 Lecture Notes in Computer Science
  • Sub Title: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings
  • Width: 155 mm
  • ISBN-10: 3540438637
  • Publisher Date: 26 Jun 2002
  • Binding: Paperback
  • Height: 235 mm
  • No of Pages: 522
  • Returnable: Y
  • Spine Width: 27 mm
  • Weight: 1219 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Algorithmic Number Theory: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings(2369 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithmic Number Theory: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings(2369 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithmic Number Theory: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings(2369 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA