Fermilab Core Computing Division
Library Home | Ask a Librarian library@fnal.gov | Book Catalog | Library Journals | Requests | SPIRES | Fermilab Documents |
Fermilab Library |
Call number: | SPRINGER-2016-9783319320854:ONLINE Show nearby items on shelf |
Title: | Geometry, Algebra and Applications: From Mechanics to Cryptography |
Author(s): | |
Date: | 2016 |
Size: | 1 online resource (198 p.) |
Note: | 10.1007/978-3-319-32085-4 |
Contents: | 1 W. Batat, P. M. Gadea, J. A. Oubiña, A survey on homogeneous structures on the classical hyperbolic spaces -- 2 A. Bejancu, On the (1 + 3) threading of spacetime -- 3 M. Brozos-Vázquez, E. Calviño-Louzao, E. García-Río, R. Vázquez-Lorenzo, L ocal structure of self-dual gradient Yamabe solitons -- 4 G. Calvaruso, The prescribed curvature problem in low dimension -- 5 M. Castrillón López, P. L. García, Euler-Poincare reduction by a subgroup of symmetries as an optimal control problem -- 6 M. Castrillón López, T. S. Ratiu, Morse families and Lagrangian submanifolds -- 7 R. Durán Díaz, L. Hernández Encinas, Special primes: properties and applications -- 8 F. Etayo, Rotation Minimizing vector fields and frames in Riemannian manifolds -- 9 R. Ferreiro Pérez, Local anomaly cancellation and equivariant cohomology of jet bundles -- 10 A. Fúster-Sabater, F. Montoya Vitini, Classes of nonlinear filters for stream ciphers -- 11 V. Gayoso Martínez, L. Hernández Encinas, A. Martín Muñoz, |
Implementation of cryptographic algorithms for elliptic curves -- 12 R. Hernández-Amador, J. Monterde, J. Vallejo, Supermanifolds, symplectic geometry and curvature -- 13 A. Marcelo, F. Marcelo, C. Rodríguez, Prime submodules and symmetric algebra s -- 14 A. Martín del Rey, G. Rodríguez Sánchez, Application to cybersecurity of the stability theory of the systems of ordinary differential equations -- 15 I. V. Mykytyuk, On the non-triviality of the eight-form T4(w) on manifolds with a Spin(9)-stru cture -- 16 A. Peinado, Flaws in the application of Number Theory in Key Distribution Schemes for Multicast Networks -- 17 L. Pozo, E. Rosado, Einstein-Hilbert Lagrangian induced on the linear frame bundle | |
ISBN: | 9783319320854 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Springer Proceedings in Mathematics & Statistics: 161 |
Keywords: | Mathematics , Data structures (Computer science) , Data encryption (Computer science) , Coding theory , Differential geometry , Mathematical physics , Mathematics , Mathematical Physics , Differential Geometry , Data Encryption , Data Structures , Coding and Information Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2014-9789400773622:ONLINE Show nearby items on shelf |
Title: | Chaos, Complexity and Leadership 2012 [electronic resource] |
Author(s): |
Santo Banerjee efika ule Eretin |
Date: | 2014 |
Publisher: | Dordrecht : Springer Netherlands : Imprint: Springer |
Size: | 1 online resource |
Note: | These proceedings from the 2012 symposium on Chaos, complexity and leadership reflect current research results from all branches of Chaos, Complex Systems and their applications in Management. Included are the diverseresults in the fields of applied nonlinear methods, modeling of data and simulations, as well as theoretical achievements of Chaos and Complex Systems. Also highlighted are Leadership and Management applications of Chaos andComplexity Theory |
Contents: | Great Illusion in 21st Century |
Chaos Knocking Door | |
Chaotic Time Delay Systems and Field Programmable Gate Array Realization. An Adaptive Neuro | |
Fuzzy Inference System | |
Based Approach to Forecast Time Series of Chaotic Systems | |
Design and Development of a Chaos | |
Based Image Encryption System | |
Comparison of Principal Component Analysis Biplots Based on Different Robust Covariance Matrix Estimates | |
Complexity and the relationship of the state with islam | |
Anadolu Agency and The New Media Order | |
The role and place of migration and diasporas policy in bilateral relations between Kazakhs | |
ISBN: | 9789400773622 |
Series: | eBooks |
Series: | SpringerLink |
Series: | Springer Proceedings in Complexity, 2213-8684 |
Series: | Physics and Astronomy (Springer-11651) |
Keywords: | Engineering , Economics |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2013-9781461485292:ONLINE Show nearby items on shelf |
Title: | Mathematics in the Real World [electronic resource] |
Author(s): |
W.D Wallis |
Date: | 2013 |
Publisher: | New York, NY : Springer New York : Imprint: Birkhuser |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Mathematics in the Real World is a self-contained, accessible introduction to the world of mathematics for non-technical majors. With a focus on everyday applications and context, the topics in this textbook build in difficultyand are presented seque ntially, starting with a brief review of sets and numbers followed by an introduction to elementary statistics, models, and graph theory. Data and identification numbers are then covered, providing the pathwayto voting and finance. Each subject is covered in a concise and clear fashion through the use of real-world applications and the introduction of relevant terminology. Many sample problems both writing exercises and multiple-choicequestions are included to help develop students level of understandin g and to offer a variety of options to instructors. Covering six major units and outlining a one-semester course, Mathematics in the Real World is aimed atundergraduate liberal art students fulfilling the mathematics requirement in their degree program. T his introductory text will be an excellent resource for such courses, and will show students where mathematics arises in their everydaylives |
Note: | Springer eBooks |
Contents: | Preface |
Part IIntroduction | |
Math is Everywhere | |
Numbers and Sets | |
Counting | |
Part IIStatistical Ideas | |
Collecting Data | |
Measuring Data | |
Normal | |
Sampling, Predicting | |
Multivariate Situations | |
Probability | |
Part IIIGraph Models | |
Euler | |
Hamilton | |
Trees | |
Scheduling, Critical Paths | |
Coloring, Handshakes | |
Part IVData | |
Identification Numbers | |
Data Transmission | |
Encryption The Hat Game | |
Part V Voting | |
Voting Systems | |
Messing with Systems | |
Electing a President | |
Part VI The Exponential World | |
Finance | |
Populations and Radioactivity. | |
ISBN: | 9781461485292 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2012-9780817682989:ONLINE Show nearby items on shelf |
Title: | Prime Numbers and Computer Methods for Factorization [electronic resource] |
Author(s): |
Hans Riesel |
Date: | 2012 |
Publisher: | Boston, MA : Birkhuser Boston : Imprint: Birkhuser |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Published in the mid 1980s, thehighly successful first edition ofthistitle investigated the mathematical underpinnings ofcomputer encryption, a discipline drawing heavily on the factorization of large numbers into primes.The book serveda broad audien ceof researchers, students, practitioners of cryptography, and non-scientific readers with a mathematical inclination, treating four fundamental problems: the number of primes below a given limit, theapproximate number of primes, the recognition of primes , and the factorization of large numbers. The second edition of the work, released in the mid 1990s,expanded significantly upon the original book, including important advances incomputational prime number theoryand factorization, as well as revised and up dated tables.With explicit algorithms and computer programs,the authorillustrated applications while attempting to discuss many classically importantresults along with more modern discoveries. Although it has been over a decade since the publication of th is second edition, thetheoryitcontained remains still highly relevant, and the particular cryptosystem it addressed (RSApublic-key)is ubiquitous. Therefore, in addition to providing a historical perspective on many of the issues in modern prime number the ory and data encryption,this soft cover versionwhichreproduces thesecond editionexactlyas it originally appearedoffers affordable access toa greatdeal of valuable information. Highly readable for a wide variety of mathematicians, students of applied numbe r theory, and others, this modern classic will be ofinterest to anyoneinvolved inthe studyof number theory and cryptography. Reviews: Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfu lly passes a criticalmilestone not allowed to many books, viz., a second edition... All in all, this handy volume continues to be an attractive comb |
Note: | Springer eBooks |
Contents: | Preface |
The Number of Primes Below a Given Limit | |
The Primes Viewed at Large | |
Subtleties in the Distribution of Primes | |
The Recognition of Primes | |
Classical Methods of Factorization | |
Modern Factorization Methods | |
Prime Numbers and Cryptography | |
Appendix 1. Basic Concepts in Higher Algebra | |
Appendix 2. Basic concepts in Higher Arithmetic | |
Appendix 3. Quadratic Residues | |
Appendix 4. The Arithmetic of Quadratic Fields | |
Appendix 5. Higher Algebraic Number Fields | |
Appendix 6. Algebraic Factors | |
Appendix 7. Elliptic Curves | |
Appendix 8. Continued Fractions | |
Appendix 9 | |
ISBN: | 9780817682989 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Modern Birkhuser Classics |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data encryption (Computer science) , Algorithms , Number theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2010-9783642048319:ONLINE Show nearby items on shelf |
Title: | Applied Quantum Cryptography [electronic resource] |
Author(s): |
Christian Kollmitzer Mario Pivk |
Date: | 2010 |
Publisher: | Berlin, Heidelberg : Springer Berlin Heidelberg |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Using the quantum properties of single photons to exchange binary keys between two partners for subsequent encryption of secret data is an absolutely novel technology. Only a few years ago quantum cryptography or better:quantum key distribution was the domain of basic research laboratories at universities. But during the last few years things changed. QKD left the laboratories and was picked up by more practical oriented teams that worked hard todevelop a practically applicable technology out of th e astonishing results of basic research. One major milestone towards a QKD technology was a large research and development project funded by the European Commission that aimed atcombining quantum physics with complementary technologies that are necessary to create a technical solution: electronics, software, and network components were added within the project SECOQC (Development of a Global Network for SecureCommunication based on Quantum Cryptography) that teamed up all expertise on European level to ge t a technology for future encryption. The practical application of QKD in a standard optical fibre network was demonstrated October 2008in Vienna, giving a glimpse of the future of secure communication. Although many steps have still to be done in order t o achieve a real mature technology, the corner stone for future secure communication is already laid. QKD will notbe the Holy Grail of security, it will not be able to solve all problems for evermore. But QKD has the potential to replace one of the weakes t parts of symmetric encryption: the exchange of the key. It can be proven that the keyexchange process cannot be corrupted and that keys that are generated and exchanged quantum cryptographically will be secure for ever (as long as some additional condit ions are kept). This book will show the state of the art of QuantumCryptography and it will sketch how it can be implemented in standard communication infrastructure. The growing vulnerability of |
Note: | Springer eBooks |
Contents: | Introduction |
Preliminaries | |
Quantum Key Distribution | |
Real | |
life QKD Systems | |
Attack Strategies on QKD Protocols | |
Access to QKD Networks with PDAs | |
Security Requirements for Future Medical Information Systems | |
Adaptive Cascade | |
Statistical Analysis of QKD Networks in Real | |
life Environment | |
QKD Networks Based on Q3P | |
Ring of Trust | |
ISBN: | 9783642048319 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Lecture Notes in Physics, 0075-8450 : v797 |
Series: | Physics and Astronomy (Springer-11651) |
Keywords: | Quantum theory , Engineering mathematics |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2009-9783540938064:ONLINE Show nearby items on shelf |
Title: | Grbner Bases, Coding, and Cryptography [electronic resource] |
Author(s): |
Massimiliano Sala Shojiro Sakata Teo Mora Carlo Traverso Ludovic Perret |
Date: | 2009 |
Publisher: | Berlin, Heidelberg : Springer Berlin Heidelberg |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Coding theory and cryptography allow secure and reliable data transmission, which is at the heart of modern communication. Nowadays, it is hard to find an electronic device without some code inside. Grbner bases have emerged asthe main tool in comput ational algebra, permitting numerous applications, both in theoretical contexts and in practical situations. This book is the first book ever giving a comprehensive overview on the application of commutativealgebra to coding theory and cryptography. For e xample, all important properties of algebraic/geometric coding systems (including encoding, construction, decoding, list decoding) are individually analysed, reporting all significantapproaches appeared in the literature. Also, stream ciphers, PK cryptogr aphy, symmetric cryptography and Polly Cracker systems deserve each a separate chapter, where all the relevant literature is reported and compared. While manyshort notes hint at new exciting directions, the reader will find that all chapters fit nicely wi thin a unified notation |
Note: | Springer eBooks |
Contents: | Grbner Bases, Coding, and Cryptography: aGuide to the State |
of | |
Art | |
Grbner Bases, Coding, and Cryptography: aGuide to the State | |
of | |
Art | |
Invited Papers | |
Grbner Technology | |
The FGLM Problem and Mllers Algorithm onZero | |
dimensional Ideals | |
An Introduction to Linear and Cyclic Codes | |
Decoding Cyclic Codes: the Cooper Philosophy | |
A Tutorial on AG Code Construction fromaGrbner Basis Perspective | |
Automorphisms and Encoding of AG and Order Domain Codes | |
Algebraic Geometry Codes from Order Domains | |
The BMS Algorithm | |
The BMS Algorithm and Decoding of AG Codes | |
ISBN: | 9783540938064 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data encryption (Computer science) , Information theory , Computer science , Algebra , Combinatorics |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2009-9783540887027:ONLINE Show nearby items on shelf |
Title: | Post-Quantum Cryptography [electronic resource] |
Author(s): |
Daniel J Bernstein Johannes Buchmann Erik Dahmen |
Date: | 2009 |
Publisher: | Berlin, Heidelberg : Springer Berlin Heidelberg |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Quantum computers will break today's most popular public-key cryptographic systems, including RSA, DSA, and ECDSA. This book introduces the reader to the next generation of cryptographic algorithms, the systems that resistquantum-computer attacks: in particular, post-quantum public-key encryption systems and post-quantum public-key signature systems. Leading experts have joined forces for the first time to explain the state of the art in quantumcomputing, hash-based cryptography, code-based cryptogra phy, lattice-based cryptography, and multivariate cryptography. Mathematical foundations and implementation issues are included. This book is an essential resource for studentsand researchers who want to contribute to the field of post-quantum cryptograph y |
Note: | Springer eBooks |
Contents: | to post |
quantum cryptography | |
Quantum computing | |
Hash | |
based Digital Signature Schemes | |
Code | |
based cryptography | |
Lattice | |
based Cryptography | |
Multivariate Public Key Cryptography | |
ISBN: | 9783540887027 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data encryption (Computer science) , Information theory , Computer science , Number theory , Engineering mathematics |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2008-9783540740780:ONLINE Show nearby items on shelf |
Title: | Random Curves [electronic resource] : Journeys of a Mathematician |
Author(s): |
Neal Koblitz |
Date: | 2008 |
Publisher: | Berlin, Heidelberg : Springer Berlin Heidelberg |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | These autobiographical memoirs of Neal Koblitz, coinventor of one of the two most popular forms of encryption and digital signature, cover many topics besides his own personal career in mathematics and cryptography - travels tothe Soviet Union, Latin America, Vietnam and elsewhere, political activism, and academic controversies relating to math education, the C. P. Snow two-culture problem, and mistreatment of women in academia. The stories speak forthemselves and reflect the experiences of a student and later a scientist caught up in the tumultuous events of his generation |
Note: | Springer eBooks |
Contents: | Early Years |
Harvard | |
SDS | |
The Army | |
Spring of 1972 | |
Academics | |
The Soviet Union | |
Racism and Apartheid | |
Vietnam. Part I | |
Vietnam. Part II | |
Nicaragua and Cuba | |
El Salvador | |
Two Cultures | |
Cryptography | |
Education | |
Arizona | |
Index | |
ISBN: | 9783540740780 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data structures (Computer science) , Data encryption (Computer science) , Mathematics_$xHistory , Number theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2008-9781848002739:ONLINE Show nearby items on shelf |
Title: | Codes: An Introduction to Information Communication and Cryptography [electronic resource] |
Author(s): |
N.L Biggs |
Date: | 2008 |
Publisher: | London : Springer London |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Information is an important feature of the modern world. Mathematical techniques underlie the devices that we use to handle it, for example, mobile phones, digital cameras, and personal computers. This book is an integratedintroduction to the mathema tics of coding, that is, replacing information expressed in symbols, such as a natural language or a sequence of bits, by another message using (possibly) different symbols. There are three main reasons fordoing this: economy, reliability, and security, a nd each is covered in detail. Only a modest mathematical background is assumed, the mathematical theory being introduced at a level that enables the basic problems to be statedcarefully, but without unnecessary abstraction. Other features include: clear a nd careful exposition of fundamental concepts, including optimal coding, data compression, and public-key cryptography concise but complete proofs ofresults coverage of recent advances of practical interest, for example in encryption standards, authentica tion schemes, and elliptic curve cryptography numerous examples and exercises, and a full solutions manual available tolecturers from www.springer.com This modern introduction to all aspects of coding is suitable for advanced undergraduate or postgraduate courses in mathematics, computer science, electrical engineering, or informatics. It is alsouseful for researchers and practitioners in related areas of science, engineering and economics |
Note: | Springer eBooks |
Contents: | Coding and its uses |
Prefix | |
free codes | |
Economical coding | |
Data compression | |
Noisy channels | |
The problem of reliable communication | |
The noisy coding theorems | |
Linear codes | |
Algebraic coding theory | |
Coding natural languages | |
The development of cryptography | |
Cryptography in theory and practice | |
The RSA cryptosystem | |
Cryptography and calculation | |
Elliptic curve cryptography | |
Answers to odd | |
numbered exercises | |
Index | |
ISBN: | 9781848002739 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Springer Undergraduate Mathematics Series, 1615-2085 |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data structures (Computer science) , Coding theory , Combinatorics , Number theory , Telecommunication |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2008-9780387779942:ONLINE Show nearby items on shelf |
Title: | An Introduction to Mathematical Cryptography [electronic resource] |
Author(s): |
J.H Silverman Jill Pipher Jeffrey Hoffstein |
Date: | 2008 |
Publisher: | New York, NY : Springer New York |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing themathematical tools needed for the construction and security analysis of diverse cryptosystems. Only basic linear algebra is required of the reader techniques from algebra, number theory, and probability are introduced and developed asrequired. The book covers a variety of topics that are considered central to mathematical cryptography. Key topics include: * classical cryptographic constructions, such as Diffie-Hellmann key exchange, discrete logarithm-basedcryptosystems, the RSA cryptosystem, and digital signatures * fundamental mathemat ical tools for cryptography, including primality testing, factorization algorithms, probability theory, information theory, and collision algorithms *an in-depth treatment of important recent cryptographic innovations, such as elliptic curves, elliptic cu rve and pairing-based cryptography, lattices, lattice-based cryptography, and the NTRU cryptosystem. This book is an idealintroduction for mathematics and computer science students to the mathematical foundations of modern cryptography. The book includes an extensive bibliography and index supplementary materials are available online |
Note: | Springer eBooks |
Contents: | An Introduction to Cryptography |
Discrete Logarithms and Diffie | |
Hellman | |
Integer Factorization and RSA | |
Probability Theory and Information Theory | |
Elliptic Curves and Cryptography | |
Lattices and Cryptography | |
Digital Signatures | |
Additional Topics in Cryptology | |
ISBN: | 9780387779942 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Undergraduate Texts in Mathematics, 0172-6056 |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data structures (Computer science) , Data encryption (Computer science) , Algebra , Number theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2007-9783540463689:ONLINE Show nearby items on shelf |
Title: | Binary Quadratic Forms [electronic resource] : An Algorithmic Approach |
Author(s): |
Johannes Buchmann Ulrich Vollmer |
Date: | 2007 |
Publisher: | Berlin, Heidelberg : Springer Berlin Heidelberg |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | The book deals with algorithmic problems related to binary quadratic forms, such as finding the representations of an integer by a form with integer coefficients, finding the minimum of a form with real coefficients and decidingequivalence of two for ms. In order to solve those problems, the book introduces the reader to important areas of number theory such as diophantine equations, reduction theory of quadratic forms, geometry of numbers and algebraic numbertheory. The book explains applications to cryptography. It requires only basic mathematical knowledge |
Note: | Springer eBooks |
Contents: | 1 Binary Quadratic Forms |
2 Equivalence of Forms | |
3 Constructing Forms | |
4 Forms, Bases, Points, and Lattices | |
5 Reduction of Positive Definite Forms | |
6 Reduction of Indefinite Forms | |
7 Multiplicative Lattices | |
8 Quadratic Number Fields | |
9 Class Groups | |
10 Infrastructure | |
11 Subexponential Algorithms | |
12 Cryptographic Applications | |
Appendix | |
Bibliography | |
References | |
Subject Index | |
Index | |
ISBN: | 9783540463689 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Algorithms and Computation in Mathematics, 1431-1550 : v20 |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data encryption (Computer science) , Computer science , Algebra , Number theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2007-9781402053344:ONLINE Show nearby items on shelf |
Title: | Topics in Geometry, Coding Theory and Cryptography [electronic resource] |
Author(s): |
Arnaldo Garcia Henning Stichtenoth |
Date: | 2007 |
Publisher: | Dordrecht : Springer Netherlands |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | The theory of algebraic function fields over finite fields has its origins in number theory. However, after Goppa`s discovery of algebraic geometry codes around 1980, many applications of function fields were found in differentareas of mathematics an d information theory, such as coding theory, sphere packings and lattices, sequence design, and cryptography. The use of function fields often led to better results than those of classical approaches. This bookpresents survey articles on some of these new developments. Most of the material is directly related to the interaction between function fields and their various applications in particular the structure and the number of rationalplaces of function fields are of great significance. The topics focus o n material which has not yet been presented in other books or survey articles. Wherever applications are pointed out, a special effort has been made to present somebackground concerning their use |
Note: | Springer eBooks |
ISBN: | 9781402053344 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Algebra and Applications : v6 |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data encryption (Computer science) , Coding theory , Geometry, algebraic , Number theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2006-9780387280011:ONLINE Show nearby items on shelf |
Title: | Optical Imaging Sensors and Systems for Homeland Security Applications [electronic resource] |
Author(s): |
Bahram Javidi |
Date: | 2006 |
Publisher: | New York, NY : Springer New York |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Optical and photonic systems and devices have significant potential for homeland security. Optical Imaging Sensors and Systems for Homeland Security Applications presents original and significant technical contributions fromleaders of industry, gover nment, and academia in the field of optical and photonic sensors, systems and devices for detection, identification, prevention, sensing, security, verification and anti-counterfeiting. The chapters haverecent and technically significant results, ample il lustrations, figures, and key references. This book is intended for engineers and scientists in the relevant fields, graduate students, industry managers, university professors,government managers, and policy makers. Advanced Sciences and Technologies for Security Applications focuses on research monographs in the areas of -Recognition and identification (including optical imaging, biometrics, authentication,verification, and smart surveillance systems) -Biological and chemical threat detection (including biosensors, aerosols, materials detection and forensics), and -Secure information systems (including encryption, and optical andphotonic systems). The series is intended to give an overview at the highest research level of the frontier of research in the physical sciences |
Note: | Springer eBooks |
Contents: | Three |
Dimensional Object Reconstruction and Recognition Techniques Based on Digital Holography | |
Compression of Encrypted Digital Holograms using Artificial Neural Networks | |
Digital Hoplography: Recent Advancements and Prospective Improvements for Applications in Microscopy | |
Hybrid Optical Encryption of a 3D Object by Use of a Digital Holographic Technique | |
3D Object Recognition using Gabor Feature Extraction and PCA | |
FLD Projections of Holographically Sensed Data | |
Distortion | |
tolerant 3D Volume Recognition Using X | |
ray Imaging | |
Three | |
dimensional Imaging and Recognition of Bacteria usi | |
ISBN: | 9780387280011 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Advanced Sciences and Technologies for Security Applications, 1613-5113 : v2 |
Series: | Physics and Astronomy (Springer-11651) |
Keywords: | Laser physics , Physical optics , Microwaves |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2005-9783540276920:ONLINE Show nearby items on shelf |
Title: | Introduction to Modern Number Theory [electronic resource] : Fundamental Problems, Ideas and Theories |
Author(s): |
Yuri Ivanovic Manin Alexei A Panchishkin |
Date: | 2005 |
Edition: | 2 |
Publisher: | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
Size: | 1 online resource |
Note: | Springer e-book platform |
Note: | Springer 2013 e-book collections |
Note: | Introduction to Modern Number Theory surveys from a unified point of view both the modern state and the trends of continuing development of various branches of number theory. Motivated by elementary problems, the centralideas of modern theories are e xposed. Some topics covered include non-Abelian generalizations of class field theory, recursive computability and Diophantine equations, zeta- and L-functions. This substantially revised and expanded newedition contains several new sections, such as Wile s' proof of Fermat's Last Theorem, and relevant techniques coming from a synthesis of various theories. Moreover, the authors have added a part dedicated to arithmetical cohomology andnoncommutative geometry, a report on point counts on varieties with man y rational points, the recent polynomial time algorithm for primality testing, and some others subjects. From the reviews of the 2nd edition: For my part, Icome to praise this fine volume. This book is a highly instructive read the quality, knowledge, a nd expertise of the authors shines through. The present volume is almost startlingly up-to-date ... (A. van der Poorten,Gazette, Australian Math. Soc. 34 (1), 2007) |
Note: | Springer eBooks |
Contents: | Problems and Tricks |
Number Theory | |
Some Applications of Elementary Number Theory | |
Ideas and Theories | |
Induction and Recursion | |
Arithmetic of algebraic numbers | |
Arithmetic of algebraic varieties | |
Zeta Functions and Modular Forms | |
Fermats Last Theorem and Families of Modular Forms | |
Analogies and Visions | |
Introductory survey to part III: motivations and description | |
Arakelov Geometry and Noncommutative Geometry (daprs C. Consani and M. Marcolli, [CM]) | |
ISBN: | 9783540276920 |
Series: | e-books |
Series: | SpringerLink (Online service) |
Series: | Encyclopaedia of Mathematical Sciences, 0938-0396 : v49 |
Series: | Mathematics and Statistics (Springer-11649) |
Keywords: | Mathematics , Data encryption (Computer science) , Geometry, algebraic , Logic, Symbolic and mathematical , Number theory , Mathematical physics |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2004-9781441990037:ONLINE Show nearby items on shelf |
Title: | Introduction to Cryptography |
Author(s): |
Johannes A Buchmann |
Date: | 2004 |
Edition: | Second Edition |
Size: | 1 online resource (338 p.) |
Note: | 10.1007/978-1-4419-9003-7 |
Contents: | 1 Integers -- 2 Congruences and Residue Class Rings -- 3 Encryption -- 4 Probability and Perfect Secrecy -- 5 DES -- 6 AES -- 7 Prime Number Generation -- 8 Public-Key Encryption -- 9 Factoring -- 10 Discrete Logarithms -- 11 |
Cryptographic Hash Functions -- 12 Digital Signatures -- 13 Other Systems -- 14 Identification -- 15 Secret Sharing -- 16 Public-Key Infrastructures -- Solutions of the exercises -- References | |
ISBN: | 9781441990037 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Mathematics , Data structures (Computer science) , Number theory , Mathematics , Number Theory , Data Structures, Cryptology and Information Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2003-9783034880374:ONLINE Show nearby items on shelf |
Title: | Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness |
Author(s): | |
Date: | 2003 |
Size: | 1 online resource (414 p.) |
Note: | 10.1007/978-3-0348-8037-4 |
Contents: | I Preliminaries -- 1 Basic Notation and Definitions -- 2 Polynomials and Recurrence Sequences -- 3 Exponential Sums -- 4 Distribution and Discrepancy -- 5 Arithmetic Functions -- 6 Lattices and the Hidden Number Problem -- 7 |
Complexity Theory -- II Approximation and Complexity of the Discrete Logarithm -- 8 Approximation of the Discrete Logarithm Modulop -- 9 Approximation of the Discrete Logarithm Modulop -1 -- 10 Approximation of the Discrete Logarithm | |
by Boolean Functions -- 11 Approximation of the Discrete Logarithm by Real Polynomials -- III Approximation and Complexity of the Diffie-Hellman Secret Key -- 12 Polynomial Approximation and Arithmetic Complexity of the -- | |
Diffie-Hellman Secret Key -- 13 Boolean Complexity of the Diffie-Hellman Secret Key -- 14 Bit Security of the Diffie-Hellman Secret Key -- IV Other Cryptographic Constructions -- 15 Security Against the Cycling Attack on the RSA and | |
Timed-release Crypto -- 16 The Insecurity of the Digital Signature Algorithm with Partially Known Nonces -- 17 Distribution of the ElGamal Signature -- 18 Bit Security of the RSA Encryption and the Shamir Message Passing Scheme -- 19 | |
Bit Security of the XTR and LUC Secret Keys -- 20 Bit Security of NTRU -- 21 Distribution of the RSA and Exponential Pairs -- 22 Exponentiation and Inversion with Precomputation -- V Pseudorandom Number Generators -- 23 RSA and | |
Blum-Blum-Shub Generators -- 24 Naor-Reingold Function -- 25 1/M Generator -- 26 Inversive, Polynomial and Quadratic Exponential Generators -- 27 Subset Sum Generators -- VI Other Applications -- 28 Square-Freeness Testing and Other | |
Number-Theoretic Problems -- 29 Trade-off Between the Boolean and Arithmetic Depths of ModulopFunctions -- 30 Polynomial Approximation, Permanents and Noisy Exponentiation in Finite Fields -- 31 Special Polynomials and Boolean | |
Functions -- VII Concluding Remarks and Open Questions | |
ISBN: | 9783034880374 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Progress in Computer Science and Applied Logic : 22 |
Keywords: | Mathematics , Data encryption (Computer science) , Applied mathematics , Engineering mathematics , Number theory , Mathematics , Number Theory , Data Encryption , Applications of Mathematics |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2003-9780387217123:ONLINE Show nearby items on shelf |
Title: | Beyond Fear Thinking Sensibly About Security in an Uncertain World |
Author(s): |
Bruce Schneier |
Date: | 2003 |
Size: | 1 online resource (296 p.) |
Note: | 10.1007/b97547 |
Contents: | Sensible Security -- All Security Involves Trade-offs -- Security Trade-offs Are Subjective -- Security Trade-offs Depend on Power and Agenda -- How Security Works -- Systems and How They Fail -- Knowing the Attackers -- Attackers |
Never Change Their Tunes, Just Their Instruments -- Technology Creates Security Imbalances -- Security Is a Weakest-Link Problem -- Brittleness Makes for Bad Security -- Security Revolves Around People -- Detection Works Where | |
Prevention Fails -- Detection Is Useless Without Response -- Identification, Authentication, and Authorization -- All Countermeasures Have Some Value, But No Countermeasure Is Perfect -- Fighting Terrorism -- The Game of Security -- | |
Negotiating for Security -- Security Demystified | |
ISBN: | 9780387217123 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Physics , Data encryption (Computer science) , Coding theory , System safety , Popular works , Medicine , Health , Social work , Physics , Security Science and Technology , Social Work , Popular Science in Medicine and Health , Popular Science, general , Data Encryption , Coding and Information Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2002-9783642594359:ONLINE Show nearby items on shelf |
Title: | Finite Fields with Applications to Coding Theory, Cryptography and Related Areas Proceedings of the Sixth International Conference on Finite Fields and Applications, held at Oaxaca, México, May 21–25, 2001 |
Author(s): | |
Date: | 2002 |
Size: | 1 online resource (335 p.) |
Note: | 10.1007/978-3-642-59435-9 |
Contents: | Commutative Semifields of Rank 2 Over Their Middle Nucleus -- A Rao-Nam like Cryptosystem with Product Codes -- Pseudorandom Sequences from Elliptic Curves -- On Cryptographic Complexity of Boolean Functions -- On Divisibility of |
Exponential Sums over Finite Fields of Characteristic 2 -- Value Sets of Polynomials over Finite Fields -- Bounds for Completely Decomposable Jacobians -- Twin Irreducible Polynomials over Finite Fields -- Invariants of Finite Groups | |
over Finite Fields: Recent Progress and New Conjectures -- The Group Law on Elliptic Curves on Hesse form -- On Curves with Many Rational Points over Finite Fields -- VHDL Specification of a FPGA to Divide and Multiply in GF(2m) -- | |
Distribution of Irreducible Polynomials over F2 -- Arithmetic on a Family of Picard Curves -- New Quantum Error-Correcting Codes from Hermitian Self-Orthogonal Codes over GF(4) -- A Note on the Counter-Example of Patterson—Wiedemann -- | |
Continued Fractions for Certain Algebraic Power Series over a Finite Field -- Linear Complexity and Polynomial Degree of a Function Over a Finite Field -- Primitive Roots in Cubic Extensions of Finite Fields -- On Polynomial Families | |
in n Indeterminates over Finite Prime Fields Coming from Planar Functions -- Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves -- Differential and Linear Distributions of Substitution | |
Boxes for Symmetric-Key Cryptosystems -- Exponential Sures and Lattice Reduction: Applications to Cryptography -- An Alternate Construction of the Berlekamp Subalgebra -- On the Fp-Linearity of the Generalized Gray Map Image of a | |
$${Z_{{p^{k + 1}}}}$$ -Linear Code -- Construction of Modular Curves and Computation of Their Cardinality over Fp -- Asymptotic Properties of Global Fields -- Author Index | |
ISBN: | 9783642594359 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Mathematics , Data structures (Computer science) , Data encryption (Computer science) , Algebra , Computer mathematics , Combinatorics , Mathematics , Combinatorics , Data Structures, Cryptology and Information Theory , Algebra , Computational Mathematics and Numerical Analysis , Data Encryption |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2002-9781461201250:ONLINE Show nearby items on shelf |
Title: | Foundations of Logic and Mathematics Applications to Computer Science and Cryptography |
Author(s): |
Yves Nievergelt |
Date: | 2002 |
Size: | 1 online resource (415 p.) |
Note: | 10.1007/978-1-4612-0125-0 |
Contents: | A Theory -- 0 Boolean Algebraic Logic -- 1 Logic and Deductive Reasoning -- 2 Set Theory -- 3 Induction, Recursion, Arithmetic, Cardinality -- 4 Decidability and Completeness -- B Applications -- 5 Number Theory and Codes -- 6 |
Ciphers, Combinatorics, and Probabilities -- 7 Graph Theory | |
ISBN: | 9781461201250 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Mathematics , Data encryption (Computer science) , Applied mathematics , Engineering mathematics , Mathematical logic , Number theory , Mathematics , Mathematical Logic and Foundations , Data Encryption , Applications of Mathematics , Number Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2001-9783642567551:ONLINE Show nearby items on shelf |
Title: | Finite Fields and Applications Proceedings of The Fifth International Conference on Finite Fields and Applications F q 5, held at the University of Augsburg, Germany, August 2–6, 1999 |
Author(s): | |
Date: | 2001 |
Size: | 1 online resource (490 p.) |
Note: | 10.1007/978-3-642-56755-1 |
Contents: | Projective Generalized Reed-Muller Codes over p-adic Numbers and Finite Rings -- Towards a Basis for the Space of Regular Functions in a Tower of Function Fields Meeting the Drinfeld-Vladut Bound -- Self-Dual Normal Bases and Related |
Topics -- Permutations amongst the Dembowski-Ostrom Polynomials -- Associative Rational Functions in Two Variables -- A Note on the Minimal Polynomial of the Product of Linear Recurring Sequences -- Gelfond-Gramain’s Theorem for | |
Function Fields -- On Generalized Bent and q-ary Perfect Nonlinear Functions -- Divisible Designs Admitting, as an Automorphism Group, an Orthogonal Group or a Unitary Group. -- A Permutation of a Small Infinite Field -- Almost Perfect | |
Nonlinear Power Functions on GF(2n): A New Case for n Divisible by 5 -- On Non-Abelian Semi-Regular Relative Difference Sets -- Applications of Arithmetical Geometry to Cryptographic Constructions -- Gauß Periods in Finite Fields -- | |
Constructions of Orthomorphisms of ?2n -- Period Polynomials for $$ {F_{{{p^{2}}}}} $$ of Fixed Small Degree -- Universal Generators for Primary Closures of Galois Fields -- Irreducible Polynomials Generated by Decimations -- Decoding | |
Reed-Muller Codes beyond Half the Minimum Distance -- On Binary Cyclic Codes With Few Weights -- Mac Williams Identities for Linear Codes over Finite Frobenius Rings -- Cyclotomic Function Fields with Many Rational Places -- On the | |
Siamese Twin Designs -- On the Brauer Monoid for Finite Fields -- Algorithms for Factoring Polynomials over Finite Fields -- Gauss Sums over Quasi-Frobenius Rings -- On the Early History of Galois Fields -- Linear Blocking Sets: a | |
Survey -- Comparison of Techniques on Divisibility Properties of Exponential Sums and Applications -- On the Rank of Appearance and the Number of Zeros of the Lucas Sequences over Fq -- A Permutation Problem for Finite Fields -- The | |
L-Function of Gold Exponential Sum -- On Permutation Polynomials and Derivable Translation Planes -- Pure L-Functions from Algebraic Geometry over Finite Fields -- Incomplete Additive Character Sums and Applications -- Applications of | |
Algebraic Curves to Constructions of Codes and Almost Perfect Sequences -- Author Index | |
ISBN: | 9783642567551 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Mathematics , Data structures (Computer science) , Data encryption (Computer science) , Algebra , Computer mathematics , Discrete mathematics , Combinatorics , Mathematics , Discrete Mathematics , Combinatorics , Data Structures, Cryptology and Information Theory , Algebra , Computational Mathematics and Numerical Analysis , Data Encryption |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2001-9783034882958:ONLINE Show nearby items on shelf |
Title: | Cryptography and Computational Number Theory |
Author(s): | |
Date: | 2001 |
Size: | 1 online resource (378 p.) |
Note: | 10.1007/978-3-0348-8295-8 |
Contents: | Computational Number Theory -- On the Dimension and the Number of Parameters of a Unirational Variety -- On Elements of High Order in Finite Fields -- Counting the Number of Points on Affine Diagonal Curves -- Small Values of the |
Carmichael Function and Cryptographic Applications -- Density Estimates Related to Gauss Periods -- Distribution of the Coefficients of Primitive Polynomials over Finite Fields -- The Distribution of the Quadratic Symbol in Function | |
Fields and a Faster Mathematical Stream Cipher -- Rational Groups of Elliptic Curves Suitable for Cryptography -- Effective Determination of the Proportion of Split Primes in Number Fields -- Algorithms for Generating, Testing and | |
Proving Primes: A Survey -- Elliptic Curve Factorization Using a “Partially Oblivious” Function -- The Hermite-Serret Algorithm and 122 + 332 -- Applications of Algebraic Curves to Constructions of Sequences -- Cryptography -- | |
Designated 2-Verifier Proofs and their Application to Electronic Commerce -- Divide and Conquer Attacks on Certain Irregularly Clocked Stream Ciphers -- New Results on the Randomness of Visual Cryptography Schemes -- Authentication — | |
Myths and Misconceptions -- A Survey of Bit-security and Hard Core Functions -- On the Security of Diffie—Hellman Bits -- Polynomial Rings and Efficient Public Key Authentication II -- Security of Biased Sources for Cryptographic Keys | |
-- Achieving Optimal Fairness from Biased Coinflips -- The Dark Side of the Hidden Number Problem: Lattice Attacks on DSA -- Distribution of Modular Sums and the Security of the Server Aided Exponentiation -- A General Construction for | |
Fail-Stop Signatures using Authentication Codes -- Robust Additive Secret Sharing Schemes over Zm -- RSA Public Key Validation | |
ISBN: | 9783034882958 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Progress in Computer Science and Applied Logic : 20 |
Keywords: | Computer science , Data encryption (Computer science) , Number theory , Computer Science , Data Encryption , Number Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2001-9781468404968:ONLINE Show nearby items on shelf |
Title: | Introduction to Cryptography |
Author(s): |
Johannes A Buchmann |
Date: | 2001 |
Size: | 1 online resource (7 p.) |
Note: | 10.1007/978-1-4684-0496-8 |
Contents: | 1 Integers -- 1.1 Basics -- 1.2 Divisibility -- 1.3 Representation of Integers -- 1.4 O- and ?-Notation -- 1.5 Cost of Addition, Multiplication, and Division with Remainder -- 1.6 Polynomial Time -- 1.7 Greatest Common Divisor -- 1.8 |
Euclidean Algorithm -- 1.9 Extended Euclidean Algorithm -- 1.10 Analysis of the Extended Euclidean Algorithm -- 1.11 Factoring into Primes -- 1.12 Exercises -- 2 Congruences and Residue Class Rings -- 2.1 Congruences -- 2.2 Semigroups | |
-- 2.3 Groups -- 2.4 Residue Class Rings -- 2.5 Fields -- 2.6 Division in the Residue Class Ring -- 2.7 Analysis of Operations in the Residue Class Ring -- 2.8 Multiplicative Group of Residues -- 2.9 Order of Group Elements -- 2.10 | |
Subgroups -- 2.11 Fermat’s Little Theorem -- 2.12 Fast Exponentiation -- 2.13 Fast Evaluation of Power Products -- 2.14 Computation of Element Orders -- 2.15 The Chinese Remainder Theorem -- 2.16 Decomposition of the Residue Class Ring | |
-- 2.17 A Formula for the Euler ?-Function -- 2.18 Polynomials -- 2.19 Polynomials over Fields -- 2.20 Structure of the Unit Group of Finite Fields -- 2.21 Structure of the Multiplicative Group of Residues mod a Prime Number -- 2.22 | |
Exercises -- 3 Encryption -- 3.1 Encryption Schemes -- 3.2 Symmetric and Asymmetric Cryptosystems -- 3.3 Cryptanalysis -- 3.4 Alphabets and Words -- 3.5 Permutations -- 3.6 Block Ciphers -- 3.7 Multiple Encryption -- 3.8 Use of Block | |
Ciphers -- 3.9 Stream Ciphers -- 3.10 Affine Cipher -- 3.11 Matrices and Linear Maps -- 3.12 Affine Linear Block Ciphers -- 3.13 Vigenère, Hill, and Permutation Ciphers -- 3.14 Cryptanalysis of Affine Linear Block Ciphers -- 3.15 | |
Exercises -- 4 Probability and Perfect Secrecy -- 4.1 Probability -- 4.2 Conditional Probability -- 4.3 Birthday Paradox -- 4.4 Perfect Secrecy -- 4.5 Vernam One-Time Pad -- 4.6 Random Numbers -- 4.7 Pseudorandom Numbers -- 4.8 | |
Exercises -- 5 DES -- 5.1 Feistel Ciphers -- 5.2 DES Algorithm -- 5.3 An Example -- 5.4 Security of DES -- 5.5 Exercises -- 6 Prime Number Generation -- 6.1 Trial Division -- 6.2 Fermat Test -- 6.3 Carmichael Numbers -- 6.4 | |
Miller-Rabin Test -- 6.5 Random Primes -- 6.6 Exercises -- 7 Public-Key Encryption -- 7.1 Idea -- 7.2 RSA Cryptosystem -- 7.3 Rabin Encryption -- 7.4 Diffie-Hellman Key Exchange -- 7.5 ElGamal Encryption -- 7.6 Exercises -- 8 Factoring | |
-- 8.1 Trial Division -- 8.2 p — 1 Method -- 8.3 Quadratic Sieve -- 8.4 Analysis of the Quadratic Sieve -- 8.5 Efficiency of Other Factoring Algorithms -- 8.6 Exercises -- 9 Discrete Logarithms -- 9.1 DL Problem -- 9.2 Enumeration -- | |
9.3 Shanks Baby-Step Giant-Step Algorithm -- 9.4 Pollard ?-Algorithm -- 9.5 Pohlig-Hellman Algorithm -- 9.6 Index Calculus -- 9.7 Other Algorithms -- 9.8 Generalization of the Index Calculus Algorithm -- 9.9 Exercises -- 10 | |
Cryptographic Hash Functions -- 10.1 Hash Functions and Compression Functions -- 10.2 Birthday Attack -- 10.3 Compression Functions from Encryption Functions -- 10.4 Hash Functions from Compression Functions -- 10.5 Efficient Hash | |
Functions -- 10.6 An Arithmetic Compression Function -- 10.7 Message Authentication Codes -- 10.8 Exercises -- 11 Digital Signatures -- 11.1 Idea -- 11.2 RSA Signatures -- 11.3 Signatures from Public-Key Systems -- 11.4 ElGamal | |
Signature -- 11.5 Digital Signature Algorithm (DSA) -- 11.6 Exercises -- 12 Other Groups -- 12.1 Finite Fields -- 12.2 Elliptic Curves -- 12.3 Quadratic Forms -- 12.4 Exercises -- 13 Identification -- 13.1 Passwords -- 13.2 One-Time | |
Passwords -- 13.3 Challenge-Response Identification -- 13.4 Exercises -- 14 Public-Key Infrastructures -- 14.1 Personal Security Environments -- 14.2 Certification Authorities -- 14.3 Certificate Chains -- References -- Solutions to | |
the Exercises | |
ISBN: | 9781468404968 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Mathematics , Data structures (Computer science) , Number theory , Mathematics , Number Theory , Data Structures, Cryptology and Information Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-2000-9783642596636:ONLINE Show nearby items on shelf |
Title: | Coding Theory and Cryptography From Enigma and Geheimschreiber to Quantum Theory |
Author(s): | |
Date: | 2000 |
Size: | 1 online resource (256 p.) |
Note: | 10.1007/978-3-642-59663-6 |
Contents: | Reminiscences and Reflections of a Codebreaker -- FISH and I -- Sturgeon, The FISH BP Never Really Caught -- ENIGMA and PURPLE: How the Allies Broke German and Japanese Codes During the War -- The Geheimschreiber Secret -- The RSA |
Public Key Cryptosystem -- Number Theory and Cryptography (using Maple) -- A Talk on Quantum Cryptography or How Alice Outwits Eve -- The Rigidity Theorems of Hamada and Ohmori, Revisited -- Counting Prime Divisors on Elliptic Curves | |
and Multiplication in Finite Fields -- On Cyclic MDS-Codes -- Computing Roots of Polynomials over Function Fields of Curves -- Remarks on codes from modular curves: MAPLE applications | |
ISBN: | 9783642596636 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Mathematics , Data structures (Computer science) , Data encryption (Computer science) , Coding theory , Number theory , Combinatorics , Mathematics , Combinatorics , Coding and Information Theory , Number Theory , Data Encryption , Data Structures, Cryptology and Information Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-1999-9783662125212:ONLINE Show nearby items on shelf |
Title: | Modern Cryptography, Probabilistic Proofs and Pseudorandomness |
Author(s): |
Oded Goldreich |
Date: | 1999 |
Size: | 1 online resource (183 p.) |
Note: | 10.1007/978-3-662-12521-2 |
Contents: | 1. The Foundations of Modern Cryptography -- 2. Probabilistic Proof Systems -- 3. Pseudorandom Generators -- A. Background on Randomness and Computation -- A.1 Probability Theory — Three Inequalities -- A.2 Computational Models and |
Complexity Classes -- A.2.1 P, NP, and More -- A.2.2 Probabilistic Polynomial-Time -- A.2.3 Non-Uniform Polynomial-Time -- A.2.4 Oracle Machines -- A.2.5 Space Bounded Machines -- A.2.6 Average-Case Complexity -- A.3 Complexity Classes | |
— Glossary -- A.4 Some Basic Cryptographic Settings -- A.4.1 Encryption Schemes -- A.4.2 Digital Signatures and Message Authentication -- A.4.3 The RSA and Rabin Functions -- B. Randomized Computations -- B.1 Randomized Algorithms -- | |
B.1.1 Approx. Counting of DNF Satisfying Assignments -- B.1.2 Finding a Perfect Matching -- B.1.3 Testing Whether Polynomials Are Identical -- B.1.4 Randomized Rounding Applied to MaxSAT -- B.1.5 Primality Testing -- B.1.6 Testing | |
Graph Connectivity via a Random Walk -- B.1.7 Finding Minimum Cuts in Graphs -- B.2 Randomness in Complexity Theory -- B.2.1 Reducing (Approximate) Counting to Deciding -- B.2.2 Two-sided Error Versus One-sided Error -- B.2.3 The | |
Permanent: Worst-Case vs Average Case -- B.3 Randomness in Distributed Computing -- B.3.1 Testing String Equality -- B.3.2 Routing in Networks -- B.3.3 Byzantine Agreement -- B.4 Bibliographic Notes -- C. Two Proofs -- C.1 Parallel | |
Repetition of Interactive Proofs -- C.2 A Generic Hard-Core Predicate -- C.2.1 A Motivating Discussion -- C.2.2 Back to the Formal Argument -- D. Related Surveys by the Author | |
ISBN: | 9783662125212 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Algorithms and Combinatorics: 17 |
Keywords: | Mathematics , Data encryption (Computer science) , Computers , Computer science , Probabilities , Combinatorics , Mathematics , Combinatorics , Data Encryption , Probability Theory and Stochastic Processes , Mathematics of Computing , Theory of Computation |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-1999-9783034886642:ONLINE Show nearby items on shelf |
Title: | Number Theoretic Methods in Cryptography Complexity lower bounds |
Author(s): |
Igor Shparlinski |
Date: | 1999 |
Size: | 1 online resource (182 p.) |
Note: | 10.1007/978-3-0348-8664-2 |
Contents: | I Preliminaries -- 1 Introduction -- 2 Basic Notation and Definitions -- 3 Auxiliary Results -- II Approximation and Complexity of the Discrete Logarithm -- 4 Approximation of the Discrete Logarithm Modulo p -- 5 Approximation of the |
Discrete Logarithm Modulo p — 1 -- 6 Approximation of the Discrete Logarithm by Boolean Functions -- 7 Approximation of the Discrete Logarithm by Real and Complex Polynomials -- III Complexity of Breaking the Diffie-Hellman | |
Cryptosystem -- 8 Polynomial Approximation and Arithmetic Complexity of the Diffie-Hellman Key -- 9 Boolean Complexity of the Diffie-Hellman Key -- IV Other Applications -- 10 Trade-off between the Boolean and Arithmetic Depths of | |
Modulo p Functions -- 11 Special Polynomials and Boolean Functions -- 12 RSA and Blum-Blum-Shub Generators of Pseudo-Random Numbers -- V Concluding Remarks -- 13 Generalizations and Open Questions -- 14 Further Directions | |
ISBN: | 9783034886642 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Progress in Computer Science and Applied Logic : 17 |
Keywords: | Mathematics , Data structures (Computer science) , Data encryption (Computer science) , Computers , Number theory , Mathematics , Number Theory , Data Encryption , Theory of Computation , Data Structures, Cryptology and Information Theory |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-1998-9783662036426:ONLINE Show nearby items on shelf |
Title: | Algebraic Aspects of Cryptography |
Author(s): |
Neal Koblitz |
Date: | 1998 |
Size: | 1 online resource (206 p.) |
Note: | 10.1007/978-3-662-03642-6 |
Contents: | 1. Cryptography -- §1. Early History -- §2. The Idea of Public Key Cryptography -- §3. The RSA Cryptosystem -- §4. Diffie-Hellman and the Digital Signature Algorithm -- §5. Secret Sharing, Coin Flipping, and Time Spent on Homework -- |
§6. Passwords, Signatures, and Ciphers -- §7. Practical Cryptosystems and Useful Impractical Ones -- 2. Complexity of Computations -- §1. The Big-O Notation -- §2. Length of Numbers -- §3. Time Estimates -- §4. P, NP, and | |
NP-Completeness -- §5. Promise Problems -- §6. Randomized Algorithms and Complexity Classes -- §7. Some Other Complexity Classes -- 3. Algebra -- §1. Fields -- §2. Finite Fields -- §3. The Euclidean Algorithm for Polynomials -- §4. | |
Polynomial Rings -- §5. Gröbner Bases -- 4. Hidden Monomial Cryptosystems -- § 1. The Imai-Matsumoto System -- §2. Patarin’s Little Dragon -- §3. Systems That Might Be More Secure -- 5. Combinatorial-Algebraic Cryptosystems -- §1. | |
History -- §2. Irrelevance of Brassard’s Theorem -- §3. Concrete Combinatorial-Algebraic Systems -- §4. The Basic Computational Algebra Problem -- §5. Cryptographic Version of Ideal Membership -- §6. Linear Algebra Attacks -- §7. | |
Designing a Secure System -- 6. Elliptic and Hyperelliptic Cryptosystems -- § 1. Elliptic Curves -- §2. Elliptic Curve Cryptosystems -- §3. Elliptic Curve Analogues of Classical Number Theory Problems -- §4. Cultural Background: | |
Conjectures on Elliptic Curves and Surprising Relations with Other Problems -- §5. Hyperelliptic Curves -- §6. Hyperelliptic Cryptosystems -- §1. Basic Definitions and Properties -- §2. Polynomial and Rational Functions -- §3. Zeros | |
and Poles -- §4. Divisors -- §5. Representing Semi-Reduced Divisors -- §6. Reduced Divisors -- §7. Adding Reduced Divisors -- Exercises -- Answers to Exercises. | |
ISBN: | 9783662036426 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Algorithms and Computation in Mathematics: 3 |
Keywords: | Computer science , Data structures (Computer science) , Data encryption (Computer science) , Computers , Number theory , Combinatorics , Computer Science , Theory of Computation , Number Theory , Data Structures, Cryptology and Information Theory , Combinatorics , Data Encryption |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-1997-9781461554899:ONLINE Show nearby items on shelf |
Title: | Selected Areas in Cryptography |
Author(s): | |
Date: | 1997 |
Size: | 1 online resource (104 p.) |
Note: | 10.1007/978-1-4615-5489-9 |
Contents: | On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption -- MD2 is not Secure Without the Checksum Byte -- On Weaknesses of Non-surjective Round Functions -- Resistance of a CAST-Like Encryption Algorithm |
to Linear and Differential Cryptanalysis -- Constructing Symmetric Ciphers Using the CAST Design Procedure | |
ISBN: | 9781461554899 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Keywords: | Mathematics , Data encryption (Computer science) , Coding theory , Computer science , Applied mathematics , Engineering mathematics , Information theory , Mathematics , Applications of Mathematics , Data Encryption , Coding and Information Theory , Discrete Mathematics in Computer Science , Information and Communication, Circuits |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-1995-9783662080054:ONLINE Show nearby items on shelf |
Title: | Number Theory I Fundamental Problems, Ideas and Theories |
Author(s): | |
Date: | 1995 |
Size: | 1 online resource (306 p.) |
Note: | 10.1007/978-3-662-08005-4 |
Contents: | I. Problems and Tricks -- 1. Elementary Number Theory -- 2. Some Modern Problems of Elementary Number Theory -- II. Ideas and Theories -- 1. Induction and Recursion -- 2. Arithmetic of Algebraic Numbers -- 3. Arithmetic of Algebraic |
Varieties -- 4. Zeta Functions and Modular Forms -- References | |
ISBN: | 9783662080054 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Encyclopaedia of Mathematical Sciences: 49 |
Keywords: | Mathematics , Data encryption (Computer science) , Algebraic geometry , Mathematical logic , Number theory , Physics , Mathematics , Number Theory , Algebraic Geometry , Mathematical Logic and Foundations , Mathematical Methods in Physics , Numerical and Computational Physics , Data Encryption |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | SPRINGER-1982-9789400977600:ONLINE Show nearby items on shelf |
Title: | New Advances in Distributed Computer Systems Proceedings of the NATO Advanced Study Institute held at Bonas,France, June 15–26, 1981 |
Author(s): | |
Date: | 1982 |
Size: | 1 online resource (415 p.) |
Note: | 10.1007/978-94-009-7760-0 |
Contents: | 1. Network Development -- Introductory Survey -- Data Communication in Israel — Present and Future -- Datanet 1 of the Netherlands’ PTT -- of Radio-based Air/Ground Data Links into the SITA Network -- Presentation of the NADIR |
Pilot-Project -- AUTOFLOOD — A Flexible Test System for Packet Switched Networks -- Integrated Non-voice Services in the Electronic Office -- 2. Network Design -- Open System Interconnection and the Integrated Services Digital Network | |
-- Design Issues for High Speed Local Network Protocols -- Directory Systems for Computer Mail in Internetworking Environments -- Modeling and Verification of End-to-End Protocols -- Why Usual Transmission Protocols are not appropriate | |
for High Speed Satellite Transmission -- 3. Local Area Networks -- RESER, A Local Area Network Using a Fiber-Optic Ring -- SESNET — Local Area Networks for Software Engineering Development -- The Interconnection of Local Area Networks | |
via a Satellite Network -- Report on the Local Area Networks FFM-MCS and MICON -- The Cambridge Ring -- Distributed System Activities at the Institute of Cybernetics of the University of Milan -- 4. Mathematical Development -- An | |
Introduction to a Calculus of Communicating Systems -- Modelling of Distributed Computing Systems -- 5. Security and Encryption -- Data Security in Distributed Computing Systems -- The Data Encryption Standard and its Modes of Use -- | |
Standardisation and Implementation of Data Encryption -- Public Key Cryptosystems, Authentication and Signatures -- 6. Parallel Computing Architecture -- Synchronization of Concurrent Processes without Globality Assumptions -- Parallel | |
Processing Architecture and Parallel Algorithms -- Parallel Non-Linear Algorithms -- Microcomputer Networks for Process Control -- List of Participants | |
ISBN: | 9789400977600 |
Series: | eBooks |
Series: | SpringerLink (Online service) |
Series: | Springer eBooks |
Series: | Nato Advanced Study Institutes Series, Series C - Mathematical and Physical Sciences: 80 |
Keywords: | Engineering , Automotive engineering , Engineering , Automotive Engineering |
Availability: | Click here to see Library holdings or inquire at
Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Full Text: | Click here |
Location: | ONLINE |
Call number: | QA76.9.D314C64::2011 Show nearby items on shelf |
Title: | Expert Oracle and Java security : programming secure Oracle database applications with Java |
Author(s): |
David. Coffin |
Date: | 2011 |
Publisher: | New York : Apress |
Size: | 442 p |
Contents: | Oracle Database Security, Secure Java Development Concepts, Java Stored Procedures, Adding Public Key Encryption, Adding Secret Password Encryption, A Working Model for Data Encryption in Transit, Implementing Single Sign On, Implementing Two-Factor Authentication, Application Identification and Authorization, Enhancing Our Security, Administration of This Security System |
ISBN: | 9781430238317 |
Keywords: | Database security. , Java (Computer program language) , Data encryption (Computer science) , Data protection |
Availability: | Click
here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please. |
More info: | Amazon.com |
More info: | Barnes and Noble |
Location: | MAIN |
Return to the Fermilab Library catalog