Algebra, Codes and Cryptology PDF Download

Author: Cheikh Thiecoumba Gueye
Publisher: Springer Nature
ISBN: 303036237X
Category : Computers
Languages : en
Pages : 246

View

Book Description
This book presents refereed proceedings of the First International Conference on Algebra, Codes and Cryptology, A2C 2019, held in Dakar, Senegal, in December 2019. The 14 full papers were carefully reviewed and selected from 35 submissions. The papers are organized in topical sections on non-associative and non-commutative algebra; code, cryptology and information security.

Author: Ruud Pellikaan
Publisher: Cambridge University Press
ISBN: 1108547826
Category : Mathematics
Languages : en
Pages :

View

Book Description
This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.

Author: Darel W. Hardy
Publisher: CRC Press
ISBN: 1420071432
Category : Mathematics
Languages : en
Pages : 426

View

Book Description
Using mathematical tools from number theory and finite fields, Applied Algebra: Codes, Ciphers, and Discrete Algorithms, Second Edition presents practical methods for solving problems in data security and data integrity. It is designed for an applied algebra course for students who have had prior classes in abstract or linear algebra. While the content has been reworked and improved, this edition continues to cover many algorithms that arise in cryptography and error-control codes. New to the Second Edition A CD-ROM containing an interactive version of the book that is powered by Scientific Notebook®, a mathematical word processor and easy-to-use computer algebra system New appendix that reviews prerequisite topics in algebra and number theory Double the number of exercises Instead of a general study on finite groups, the book considers finite groups of permutations and develops just enough of the theory of finite fields to facilitate construction of the fields used for error-control codes and the Advanced Encryption Standard. It also deals with integers and polynomials. Explaining the mathematics as needed, this text thoroughly explores how mathematical techniques can be used to solve practical problems. About the Authors Darel W. Hardy is Professor Emeritus in the Department of Mathematics at Colorado State University. His research interests include applied algebra and semigroups. Fred Richman is a professor in the Department of Mathematical Sciences at Florida Atlantic University. His research interests include Abelian group theory and constructive mathematics. Carol L. Walker is Associate Dean Emeritus in the Department of Mathematical Sciences at New Mexico State University. Her research interests include Abelian group theory, applications of homological algebra and category theory, and the mathematics of fuzzy sets and fuzzy logic.

Author: Harald Niederreiter
Publisher: Princeton University Press
ISBN: 140083130X
Category : Mathematics
Languages : en
Pages : 272

View

Book Description
This textbook equips graduate students and advanced undergraduates with the necessary theoretical tools for applying algebraic geometry to information theory, and it covers primary applications in coding theory and cryptography. Harald Niederreiter and Chaoping Xing provide the first detailed discussion of the interplay between nonsingular projective curves and algebraic function fields over finite fields. This interplay is fundamental to research in the field today, yet until now no other textbook has featured complete proofs of it. Niederreiter and Xing cover classical applications like algebraic-geometry codes and elliptic-curve cryptosystems as well as material not treated by other books, including function-field codes, digital nets, code-based public-key cryptosystems, and frameproof codes. Combining a systematic development of theory with a broad selection of real-world applications, this is the most comprehensive yet accessible introduction to the field available. Introduces graduate students and advanced undergraduates to the foundations of algebraic geometry for applications to information theory Provides the first detailed discussion of the interplay between projective curves and algebraic function fields over finite fields Includes applications to coding theory and cryptography Covers the latest advances in algebraic-geometry codes Features applications to cryptography not treated in other books

Author: Harald Niederreiter
Publisher: World Scientific
ISBN: 981448766X
Category : Mathematics
Languages : en
Pages : 460

View

Book Description
The inaugural research program of the Institute for Mathematical Sciences at the National University of Singapore took place from July to December 2001 and was devoted to coding theory and cryptology. As part of the program, tutorials for graduate students and junior researchers were given by world-renowned scholars. These tutorials covered fundamental aspects of coding theory and cryptology and were designed to prepare for original research in these areas. The present volume collects the expanded lecture notes of these tutorials. The topics range from mathematical areas such as computational number theory, exponential sums and algebraic function fields through coding-theory subjects such as extremal problems, quantum error-correcting codes and algebraic-geometry codes to cryptologic subjects such as stream ciphers, public-key infrastructures, key management, authentication schemes and distributed system security. Contents:Extremal Problems of Coding Theory (A Barg)Analysis and Design Issues for Synchronous Stream Ciphers (E Dawson & L Simpson)Quantum Error-Correcting Codes (K Feng)Public Key Infrastructures (D Gollmann)Computational Methods in Public Key Cryptology (A K Lenstra)Detecting and Revoking Compromised Keys (T Matsumoto)Algebraic Function Fields Over Finite Fields (H Niederreiter)Authentication Schemes (D Y Pei)Exponential Sums in Coding Theory, Cryptology and Algorithms (I E Shparlinski)Distributed Authorization: Principles and Practice (V Varadharajan)Introduction to Algebraic Geometry Codes (C P Xing) Readership: Graduate students and researchers in number theory, discrete mathematics, coding theory, cryptology and IT security. Keywords:Coding Theory;Cryptology;Number Theory;Algebraic-Geometry Codes;Public-Key Infrastructures;Error-Correcting Codes

Author: Lindsay N. Childs
Publisher: Springer
ISBN: 303015453X
Category : Mathematics
Languages : en
Pages : 351

View

Book Description
This text presents a careful introduction to methods of cryptology and error correction in wide use throughout the world and the concepts of abstract algebra and number theory that are essential for understanding these methods. The objective is to provide a thorough understanding of RSA, Diffie–Hellman, and Blum–Goldwasser cryptosystems and Hamming and Reed–Solomon error correction: how they are constructed, how they are made to work efficiently, and also how they can be attacked. To reach that level of understanding requires and motivates many ideas found in a first course in abstract algebra—rings, fields, finite abelian groups, basic theory of numbers, computational number theory, homomorphisms, ideals, and cosets. Those who complete this book will have gained a solid mathematical foundation for more specialized applied courses on cryptology or error correction, and should also be well prepared, both in concepts and in motivation, to pursue more advanced study in algebra and number theory. This text is suitable for classroom or online use or for independent study. Aimed at students in mathematics, computer science, and engineering, the prerequisite includes one or two years of a standard calculus sequence. Ideally the reader will also take a concurrent course in linear algebra or elementary matrix theory. A solutions manual for the 400 exercises in the book is available to instructors who adopt the text for their course.

Author: Cheikh Thiecoumba Gueye
Publisher:
ISBN: 9783030362386
Category : Computer networks
Languages : en
Pages : 237

View

Book Description
This book presents refereed proceedings of the First International Conference on Algebra, Codes and Cryptology, A2C 2019, held in Dakar, Senegal, in December 2019. The 14 full papers were carefully reviewed and selected from 35 submissions. The papers are organized in topical sections on non-associative and non-commutative algebra; code, cryptology and information security.

Author: G. Longo
Publisher: Springer
ISBN:
Category : Computers
Languages : en
Pages : 248

View

Book Description
The general problem studied by information theory is the reliable transmission of information through unreliable channels. Channels can be unreliable either because they are disturbed by noise or because unauthorized receivers intercept the information transmitted. In the first case, the theory of error-control codes provides techniques for correcting at least part of the errors caused by noise. In the second case cryptography offers the most suitable methods for coping with the many problems linked with secrecy and authentication. Now, both error-control and cryptography schemes can be studied, to a large extent, by suitable geometric models, belonging to the important field of finite geometries. This book provides an update survey of the state of the art of finite geometries and their applications to channel coding against noise and deliberate tampering. The book is divided into two sections, "Geometries and Codes" and "Geometries and Cryptography". The first part covers such topics as Galois geometries, Steiner systems, Circle geometry and applications to algebraic coding theory. The second part deals with unconditional secrecy and authentication, geometric threshold schemes and applications of finite geometry to cryptography. This volume recommends itself to engineers dealing with communication problems, to mathematicians and to research workers in the fields of algebraic coding theory, cryptography and information theory.

Author: Alko R. Meijer
Publisher: Springer
ISBN: 3319303961
Category : Mathematics
Languages : en
Pages : 301

View

Book Description
This textbook provides an introduction to the mathematics on which modern cryptology is based. It covers not only public key cryptography, the glamorous component of modern cryptology, but also pays considerable attention to secret key cryptography, its workhorse in practice. Modern cryptology has been described as the science of the integrity of information, covering all aspects like confidentiality, authenticity and non-repudiation and also including the protocols required for achieving these aims. In both theory and practice it requires notions and constructions from three major disciplines: computer science, electronic engineering and mathematics. Within mathematics, group theory, the theory of finite fields, and elementary number theory as well as some topics not normally covered in courses in algebra, such as the theory of Boolean functions and Shannon theory, are involved. Although essentially self-contained, a degree of mathematical maturity on the part of the reader is assumed, corresponding to his or her background in computer science or engineering. Algebra for Cryptologists is a textbook for an introductory course in cryptography or an upper undergraduate course in algebra, or for self-study in preparation for postgraduate study in cryptology.

Author: M. Welleda Baldoni
Publisher: Springer Science & Business Media
ISBN: 3540692002
Category : Mathematics
Languages : en
Pages : 522

View

Book Description
In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and coding theory. Both cryptography and codes have crucial applications in our daily lives, and they are described here, while the complexity problems that arise in implementing the related numerical algorithms are also taken into due account. Cryptography has been developed in great detail, both in its classical and more recent aspects. In particular public key cryptography is extensively discussed, the use of algebraic geometry, specifically of elliptic curves over finite fields, is illustrated, and a final chapter is devoted to quantum cryptography, which is the new frontier of the field. Coding theory is not discussed in full; however a chapter, sufficient for a good introduction to the subject, has been devoted to linear codes. Each chapter ends with several complements and with an extensive list of exercises, the solutions to most of which are included in the last chapter. Though the book contains advanced material, such as cryptography on elliptic curves, Goppa codes using algebraic curves over finite fields, and the recent AKS polynomial primality test, the authors' objective has been to keep the exposition as self-contained and elementary as possible. Therefore the book will be useful to students and researchers, both in theoretical (e.g. mathematicians) and in applied sciences (e.g. physicists, engineers, computer scientists, etc.) seeking a friendly introduction to the important subjects treated here. The book will also be useful for teachers who intend to give courses on these topics.