Resultado de la búsqueda
9 búsqueda de la palabra clave 'encryption'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsquedaPost-Quantum Cryptography / SpringerLink (Online service) ; Daniel J. Bernstein ; Johannes Buchmann ; Erik Dahmen (2009)
Título : Post-Quantum Cryptography Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Daniel J. Bernstein ; Johannes Buchmann ; Erik Dahmen Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2009 Número de páginas: X, 246 p Il.: online resource ISBN/ISSN/DL: 978-3-540-88702-7 Idioma : Inglés (eng) Palabras clave: Mathematics Data encryption (Computer science) Computers Computer science Number theory Applied mathematics Engineering Theory Encryption of Computing Computation Appl.Mathematics/Computational Methods Clasificación: 51 Matemáticas Resumen: 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 resist quantum-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 quantum computing, hash-based cryptography, code-based cryptography, lattice-based cryptography, and multivariate cryptography. Mathematical foundations and implementation issues are included. This book is an essential resource for students and researchers who want to contribute to the field of post-quantum cryptography Nota de contenido: to post-quantum cryptography -- Quantum computing -- Hash-based Digital Signature Schemes -- Code-based cryptography -- Lattice-based Cryptography -- Multivariate Public Key Cryptography En línea: http://dx.doi.org/10.1007/978-3-540-88702-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34045 Post-Quantum Cryptography [documento electrónico] / SpringerLink (Online service) ; Daniel J. Bernstein ; Johannes Buchmann ; Erik Dahmen . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009 . - X, 246 p : online resource.
ISBN : 978-3-540-88702-7
Idioma : Inglés (eng)
Palabras clave: Mathematics Data encryption (Computer science) Computers Computer science Number theory Applied mathematics Engineering Theory Encryption of Computing Computation Appl.Mathematics/Computational Methods Clasificación: 51 Matemáticas Resumen: 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 resist quantum-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 quantum computing, hash-based cryptography, code-based cryptography, lattice-based cryptography, and multivariate cryptography. Mathematical foundations and implementation issues are included. This book is an essential resource for students and researchers who want to contribute to the field of post-quantum cryptography Nota de contenido: to post-quantum cryptography -- Quantum computing -- Hash-based Digital Signature Schemes -- Code-based cryptography -- Lattice-based Cryptography -- Multivariate Public Key Cryptography En línea: http://dx.doi.org/10.1007/978-3-540-88702-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34045 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Prime Numbers and Computer Methods for Factorization Tipo de documento: documento electrónico Autores: Hans Riesel ; SpringerLink (Online service) Editorial: Boston, MA : Birkhäuser Boston Fecha de publicación: 2012 Otro editor: Imprint: Birkhäuser Colección: Modern Birkhäuser Classics, ISSN 2197-1803 Número de páginas: XVIII, 464 p. 20 illus Il.: online resource ISBN/ISSN/DL: 978-0-8176-8298-9 Idioma : Inglés (eng) Palabras clave: Mathematics Data encryption (Computer science) Applied mathematics Engineering Algorithms Number theory Theory Encryption Applications of Mathematics, general Clasificación: 51 Matemáticas Resumen: Published in the mid 1980s, the highly successful first edition of this title investigated the mathematical underpinnings of computer encryption, a discipline drawing heavily on the factorization of large numbers into primes. The book served a broad audience of 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, the approximate 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 in computational prime number theory and factorization, as well as revised and updated tables. With explicit algorithms and computer programs, the author illustrated applications while attempting to discuss many classically important results along with more modern discoveries. Although it has been over a decade since the publication of this second edition, the theory it contained remains still highly relevant, and the particular cryptosystem it addressed (RSA public-key) is ubiquitous. Therefore, in addition to providing a historical perspective on many of the issues in modern prime number theory and data encryption, this soft cover version—which reproduces the second edition exactly as it originally appeared—offers affordable access to a great deal of valuable information. Highly readable for a wide variety of mathematicians, students of applied number theory, and others, this modern classic will be of interest to anyone involved in the study of number theory and cryptography. Reviews: Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfully passes a critical milestone not allowed to many books, viz., a second edition... All in all, this handy volume continues to be an attractive combination of number-theoretic precision, practicality, and theory with a rich blend of computer science. —Zentralblatt MATH The book...is an enthusiastic introduction to some of the ideas concerned with primes and factorization. It should be of interest to anyone who would like to learn about the use of computers in number theory. —Mathematical Reviews Nota de contenido: 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. Multiple-Precision Arithmetic -- Appendix 10. Fast Multiplication of Large Integers -- Appendix 11. The Stieltjes Integral -- Tables -- List of Textbooks -- Index En línea: http://dx.doi.org/10.1007/978-0-8176-8298-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32688 Prime Numbers and Computer Methods for Factorization [documento electrónico] / Hans Riesel ; SpringerLink (Online service) . - Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser, 2012 . - XVIII, 464 p. 20 illus : online resource. - (Modern Birkhäuser Classics, ISSN 2197-1803) .
ISBN : 978-0-8176-8298-9
Idioma : Inglés (eng)
Palabras clave: Mathematics Data encryption (Computer science) Applied mathematics Engineering Algorithms Number theory Theory Encryption Applications of Mathematics, general Clasificación: 51 Matemáticas Resumen: Published in the mid 1980s, the highly successful first edition of this title investigated the mathematical underpinnings of computer encryption, a discipline drawing heavily on the factorization of large numbers into primes. The book served a broad audience of 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, the approximate 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 in computational prime number theory and factorization, as well as revised and updated tables. With explicit algorithms and computer programs, the author illustrated applications while attempting to discuss many classically important results along with more modern discoveries. Although it has been over a decade since the publication of this second edition, the theory it contained remains still highly relevant, and the particular cryptosystem it addressed (RSA public-key) is ubiquitous. Therefore, in addition to providing a historical perspective on many of the issues in modern prime number theory and data encryption, this soft cover version—which reproduces the second edition exactly as it originally appeared—offers affordable access to a great deal of valuable information. Highly readable for a wide variety of mathematicians, students of applied number theory, and others, this modern classic will be of interest to anyone involved in the study of number theory and cryptography. Reviews: Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfully passes a critical milestone not allowed to many books, viz., a second edition... All in all, this handy volume continues to be an attractive combination of number-theoretic precision, practicality, and theory with a rich blend of computer science. —Zentralblatt MATH The book...is an enthusiastic introduction to some of the ideas concerned with primes and factorization. It should be of interest to anyone who would like to learn about the use of computers in number theory. —Mathematical Reviews Nota de contenido: 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. Multiple-Precision Arithmetic -- Appendix 10. Fast Multiplication of Large Integers -- Appendix 11. The Stieltjes Integral -- Tables -- List of Textbooks -- Index En línea: http://dx.doi.org/10.1007/978-0-8176-8298-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32688 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Random Curves : Journeys of a Mathematician Tipo de documento: documento electrónico Autores: Neal Koblitz ; SpringerLink (Online service) Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2008 Número de páginas: IX, 392 p Il.: online resource ISBN/ISSN/DL: 978-3-540-74078-0 Idioma : Inglés (eng) Palabras clave: Mathematics Data structures (Computer science) encryption History Number theory of Mathematical Sciences Structures, Cryptology and Information Theory Encryption Clasificación: 51 Matemáticas Resumen: 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 to the 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 for themselves and reflect the experiences of a student and later a scientist caught up in the tumultuous events of his generation Nota de contenido: 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 and Peru -- Two Cultures -- Cryptography -- Education -- Arizona En línea: http://dx.doi.org/10.1007/978-3-540-74078-0 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34344 Random Curves : Journeys of a Mathematician [documento electrónico] / Neal Koblitz ; SpringerLink (Online service) . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2008 . - IX, 392 p : online resource.
ISBN : 978-3-540-74078-0
Idioma : Inglés (eng)
Palabras clave: Mathematics Data structures (Computer science) encryption History Number theory of Mathematical Sciences Structures, Cryptology and Information Theory Encryption Clasificación: 51 Matemáticas Resumen: 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 to the 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 for themselves and reflect the experiences of a student and later a scientist caught up in the tumultuous events of his generation Nota de contenido: 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 and Peru -- Two Cultures -- Cryptography -- Education -- Arizona En línea: http://dx.doi.org/10.1007/978-3-540-74078-0 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34344 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : An Introduction to Mathematical Cryptography Tipo de documento: documento electrónico Autores: Joseph H. Silverman ; SpringerLink (Online service) ; Jill Pipher ; Jeffrey Hoffstein Editorial: New York, NY : Springer New York Fecha de publicación: 2008 Colección: Undergraduate Texts in Mathematics, ISSN 0172-6056 Número de páginas: XVI, 524 p. 29 illus Il.: online resource ISBN/ISSN/DL: 978-0-387-77994-2 Idioma : Inglés (eng) Palabras clave: Mathematics Data structures (Computer science) encryption Coding theory Algebra Ordered algebraic Information Number Theory and Structures, Cryptology Encryption Communication, Circuits Order, Lattices, Algebraic Structures Clasificación: 51 Matemáticas Resumen: 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 the mathematical 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 as required. 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-based cryptosystems, the RSA cryptosystem, and digital signatures; * fundamental mathematical 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 curve and pairing-based cryptography, lattices, lattice-based cryptography, and the NTRU cryptosystem. This book is an ideal introduction 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 Nota de contenido: An Introduction to Cryptography -- Discrete Logarithms and Diffie Hellman -- Integer Factorization and RSA -- Combinatorics, Probability and Information Theory -- Elliptic Curves and Cryptography -- Lattices and Cryptography -- Digital Signatures -- Additional Topics in Cryptography En línea: http://dx.doi.org/10.1007/978-0-387-77993-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34241 An Introduction to Mathematical Cryptography [documento electrónico] / Joseph H. Silverman ; SpringerLink (Online service) ; Jill Pipher ; Jeffrey Hoffstein . - New York, NY : Springer New York, 2008 . - XVI, 524 p. 29 illus : online resource. - (Undergraduate Texts in Mathematics, ISSN 0172-6056) .
ISBN : 978-0-387-77994-2
Idioma : Inglés (eng)
Palabras clave: Mathematics Data structures (Computer science) encryption Coding theory Algebra Ordered algebraic Information Number Theory and Structures, Cryptology Encryption Communication, Circuits Order, Lattices, Algebraic Structures Clasificación: 51 Matemáticas Resumen: 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 the mathematical 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 as required. 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-based cryptosystems, the RSA cryptosystem, and digital signatures; * fundamental mathematical 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 curve and pairing-based cryptography, lattices, lattice-based cryptography, and the NTRU cryptosystem. This book is an ideal introduction 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 Nota de contenido: An Introduction to Cryptography -- Discrete Logarithms and Diffie Hellman -- Integer Factorization and RSA -- Combinatorics, Probability and Information Theory -- Elliptic Curves and Cryptography -- Lattices and Cryptography -- Digital Signatures -- Additional Topics in Cryptography En línea: http://dx.doi.org/10.1007/978-0-387-77993-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34241 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Attribute-based Credentials for Trust : Identity in the Information Society Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Kai Rannenberg ; Jan Camenisch ; Ahmad Sabouri Editorial: Cham : Springer International Publishing Fecha de publicación: 2015 Otro editor: Imprint: Springer Número de páginas: XV, 391 p. 122 illus Il.: online resource ISBN/ISSN/DL: 978-3-319-14439-9 Idioma : Inglés (eng) Palabras clave: Business Information technology Data processing Computer security encryption (Computer science) E-commerce International law Intellectual property Law and legislation Management IT in Systems Security Media Law, Property Encryption e-Commerce/e-business Clasificación: 658 Empresas. Organización de empresas Resumen: This book addresses the federation and interchangeability of Privacy-ABC technologies. It defines a common, unified architecture for Privacy-ABC systems that allows their respective features to be compared and combined Further, this book presents open reference implementations of selected Privacy-ABC systems and explains how to deploy them in actual production pilots, allowing provably accredited members of restricted communities to provide anonymous feedback on their community or its members. To date, credentials such as digitally signed pieces of personal information or other information used to authenticate or identify a user have not been designed to respect the users’ privacy. They inevitably reveal the identity of the holder even though the application at hand often needs much less information, e.g. only the confirmation that the holder is a teenager or is eligible for social benefits. In contrast, Privacy-ABCs allow their holders to reveal only their minimal information required by the applications, without giving away their full identity information. Privacy-ABCs thus facilitate the implementation of a trustworthy and at the same time privacy-respecting digital society. "The ABC4Trust project as a multidisciplinary and European project, gives a technological response to questions linked to data protection." Viviane Reding (Former Vice-president of the European Commission, Member of European Parliament) Nota de contenido: Introduction -- Architecture for Application Developers -- Architecture for Crypto Developers -- Comparison -- The Soederhamn Pilot -- The Patras Pilot -- Experiences and Feedback from the Pilots -- Annexes En línea: http://dx.doi.org/10.1007/978-3-319-14439-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35571 Attribute-based Credentials for Trust : Identity in the Information Society [documento electrónico] / SpringerLink (Online service) ; Kai Rannenberg ; Jan Camenisch ; Ahmad Sabouri . - Cham : Springer International Publishing : Imprint: Springer, 2015 . - XV, 391 p. 122 illus : online resource.
ISBN : 978-3-319-14439-9
Idioma : Inglés (eng)
Palabras clave: Business Information technology Data processing Computer security encryption (Computer science) E-commerce International law Intellectual property Law and legislation Management IT in Systems Security Media Law, Property Encryption e-Commerce/e-business Clasificación: 658 Empresas. Organización de empresas Resumen: This book addresses the federation and interchangeability of Privacy-ABC technologies. It defines a common, unified architecture for Privacy-ABC systems that allows their respective features to be compared and combined Further, this book presents open reference implementations of selected Privacy-ABC systems and explains how to deploy them in actual production pilots, allowing provably accredited members of restricted communities to provide anonymous feedback on their community or its members. To date, credentials such as digitally signed pieces of personal information or other information used to authenticate or identify a user have not been designed to respect the users’ privacy. They inevitably reveal the identity of the holder even though the application at hand often needs much less information, e.g. only the confirmation that the holder is a teenager or is eligible for social benefits. In contrast, Privacy-ABCs allow their holders to reveal only their minimal information required by the applications, without giving away their full identity information. Privacy-ABCs thus facilitate the implementation of a trustworthy and at the same time privacy-respecting digital society. "The ABC4Trust project as a multidisciplinary and European project, gives a technological response to questions linked to data protection." Viviane Reding (Former Vice-president of the European Commission, Member of European Parliament) Nota de contenido: Introduction -- Architecture for Application Developers -- Architecture for Crypto Developers -- Comparison -- The Soederhamn Pilot -- The Patras Pilot -- Experiences and Feedback from the Pilots -- Annexes En línea: http://dx.doi.org/10.1007/978-3-319-14439-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35571 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar Permalink
PermalinkPermalink
Permalink
