Nantilus
Binary Quadratic Forms : An Algorithmic Approach
This book deals with algorithmic problems concerning binary quadratic forms 2 2 f(X,Y)= aX +bXY +cY with integer coe?cients a, b, c, the mathem- ical theories that permit the solution of these problems, and applications to cryptography. A considerable part of the theory is developed for forms with r...
Enregistré dans:
| Auteurs principaux : | , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Binary Quadratic Forms : An Algorithmic Approach / Johannes Buchmann, Ulrich Vollmer. |
| Édition : | 1st ed. 2007. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, [20..] Cham : Springer Nature |
| Collection : | Algorithms and computation in mathematics editors, Arjeh M. Cohen, Henri Cohen, David Eisenbud... [et al.] ; 20 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |
| Reproduction de : | Numérisation de l'édition de Berlin ; Heidelberg : Springer, cop. 2007 |
| Contenu : | Binary Quadratic Forms. Equivalence of Forms. Constructing Forms. Forms, Bases, Points, and Lattices. Reduction of Positive Definite Forms. Reduction of Indefinite Forms. Multiplicative Lattices. Quadratic Number Fields. Class Groups. Infrastructure. Subexponential Algorithms. Cryptographic Applications |
| Sujets : | |
| Documents associés : | Autre format:
Binary quadratic forms Autre format: Binary Quadratic Forms Autre format: Binary Quadratic Forms Autre format: Binary quadratic forms |
| LEADER | 05809clm a2200841 4500 | ||
|---|---|---|---|
| 001 | PPN123157641 | ||
| 003 | http://www.sudoc.fr/123157641 | ||
| 005 | 20241001154600.0 | ||
| 010 | |a 978-3-540-46368-9 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-540-46368-9 |2 DOI |
| 035 | |a (OCoLC)690294532 | ||
| 035 | |a Springer978-3-540-46368-9 | ||
| 035 | |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-540-46368-9 | ||
| 035 | |a Springer-11649-978-3-540-46368-9 | ||
| 100 | |a 20080410f20 k y0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a DE | ||
| 105 | |a a a 001yy | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Binary Quadratic Forms |e An Algorithmic Approach |f Johannes Buchmann, Ulrich Vollmer. | |
| 205 | |a 1st ed. 2007. | ||
| 214 | 0 | |a Berlin, Heidelberg |c Springer Berlin Heidelberg | |
| 214 | 2 | |a Cham |c Springer Nature |d [20..] | |
| 225 | 2 | |a Algorithms and Computation in Mathematics |v 20 | |
| 303 | |a L'impression du document génère 330 p. | ||
| 320 | |a Bibliogr. Index | ||
| 324 | |a Numérisation de l'édition de Berlin ; Heidelberg : Springer, cop. 2007 | ||
| 327 | 1 | |a Binary Quadratic Forms |a Equivalence of Forms |a Constructing Forms |a Forms, Bases, Points, and Lattices |a Reduction of Positive Definite Forms |a Reduction of Indefinite Forms |a Multiplicative Lattices |a Quadratic Number Fields |a Class Groups |a Infrastructure |a Subexponential Algorithms |a Cryptographic Applications | |
| 330 | |a This book deals with algorithmic problems concerning binary quadratic forms 2 2 f(X,Y)= aX +bXY +cY with integer coe?cients a, b, c, the mathem- ical theories that permit the solution of these problems, and applications to cryptography. A considerable part of the theory is developed for forms with real coe?cients and it is shown that forms with integer coe?cients appear in a natural way. Much of the progress of number theory has been stimulated by the study of concrete computational problems. Deep theories were developed from the classic time of Euler and Gauss onwards to this day that made the solutions ofmanyof theseproblemspossible.Algorithmicsolutionsandtheirproperties became an object of study in their own right. Thisbookintertwinestheexpositionofoneveryclassicalstrandofnumber theory with the presentation and analysis of algorithms both classical and modern which solve its motivating problems. This algorithmic approach will lead the reader, we hope, not only to an understanding of theory and solution methods, but also to an appreciation of the e?ciency with which solutions can be reached. The computer age has led to a marked advancement of algorithmic - search. On the one hand, computers make it feasible to solve very hard pr- lems such as the solution of Pell equations with large coe?cients. On the other, the application of number theory in public-key cryptography increased the urgency for establishing the complexity of several computational pr- lems: many a computer system stays only secure as long as these problems remain intractable | ||
| 371 | 0 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | |
| 371 | 0 | |a Accès soumis à abonnement pour tout autre établissement | |
| 371 | 1 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales |c https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | |
| 410 | | | |0 160477956 |t Algorithms and computation in mathematics |b Ressource électronique |f editors, Arjeh M. Cohen, Henri Cohen, David Eisenbud... [et al.] |c Berlin |n Springer |d 2005 |v 20 | |
| 452 | | | |0 113452551 |t Binary quadratic forms |o an algorithmic approach |f Johannes Buchmann, Ulrich Vollmer |d 2007 |c Berlin |n Springer |p 1 vol. (XIV-318 p.) |s Algorithms and computation in mathematics |y 978-3-540-46367-2 | |
| 452 | | | |t Binary Quadratic Forms |b Texte imprimé |y 9783540831402 | |
| 452 | | | |t Binary Quadratic Forms |b Texte imprimé |y 9783642079719 | |
| 452 | | | |0 113452551 |t Binary quadratic forms |o an algorithmic approach |f Johannes Buchmann, Ulrich Vollmer |d 2007 |c Berlin |n Springer |p 1 vol. (XIV-318 p.) |s Algorithms and computation in mathematics |y 978-3-540-46367-2 | |
| 606 | |3 PPN027270475 |a Théorie des nombres |2 rameau | ||
| 606 | |3 PPN027828549 |a Formes binaires |2 rameau | ||
| 606 | |3 PPN027282341 |a Formes quadratiques |2 rameau | ||
| 606 | |3 PPN027359611 |a Analyse diophantienne |2 rameau | ||
| 606 | |3 PPN031498957 |a Mathématiques |x Informatique |2 rameau | ||
| 610 | 1 | |a Mathematics | |
| 610 | 2 | |a Data Encryption | |
| 610 | 2 | |a Number Theory | |
| 610 | 2 | |a Mathematics of Computing | |
| 610 | 2 | |a Algebra | |
| 610 | 2 | |a Cryptology. | |
| 615 | |a @Mathematics and Statistics |n 11649 |2 Springer | ||
| 676 | |a 512.7 |v 23 | ||
| 680 | |a QA241-247.5 | ||
| 686 | |a 11E16 |c 2010 |2 msc | ||
| 686 | |a 11-01 |c 2010 |2 msc | ||
| 686 | |a 11R11 |c 2010 |2 msc | ||
| 686 | |a 11Y40 |c 2010 |2 msc | ||
| 700 | 1 | |3 PPN067739725 |a Buchmann |b Johannes A. |4 070 | |
| 701 | 1 | |3 PPN070186375 |a Vollmer |b Ulrich |f 19..-.... |4 070 | |
| 702 | 1 | |a Vollmer |b Ulrich |4 070 | |
| 801 | 3 | |a FR |b Abes |c 20240911 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20211020 |g AACR2 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-540-46368-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-LTPSZ8H6-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 441099901:830845992 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-540-46368-9 | |
| 915 | |5 441099901:830845992 |b SPRING18-00205 | ||
| 930 | |5 441099901:830845992 |b 441099901 |j g | ||
| 991 | |5 441099901:830845992 |a Exemplaire créé en masse par ITEM le 30-09-2024 16:00 | ||
| 997 | |a NUM |b SPRING18-00205 |d NUMpivo |e EM |s d | ||
| 998 | |a 977704 | ||