Discrete Mathematics with Cryptographic Applications (45 results)

Hardcover. Condition: Very Good.

Paperback. Condition: new. Paperback. A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features: Suitable for a variety of courses for students in both Mathematics and Computer Science.Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematicsConcise, clear and uncluttered presentation with numerous examples.Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study. A concise yet rigorous introduction to logic and discrete mathematics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

hardcover. Condition: Very Good. First Edition. Name stamp inside endpages and outer text block. Otherwise, appears free of markings. Boards & binding VG, square, light edge, corner and shelf wear. No rips, tears, stains. Photos of book you will receive. B&W Illustrations. From personal collection of former Computer, Engineering & Electrical Dept. Professor. Vintage Science / Math Textbook/ Cryptology Textbook. Ships quickly and with care.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This introduction to cryptography employs a programming-oriented approach to study the most important cryptographic schemes in current use and the main cryptanalytic attacks against them. Discussion of the theoretical aspects, emphasizing precise security definitions based on methodological tools such as complexity and randomness, and of the mathematical aspects, with emphasis on number-theoretic algorithms and their applications to cryptography and cryptanalysis, is integrated with the programming approach, thus providing implementations of the algorithms and schemes as well as examples of realistic size. A distinctive feature of the author's approach is the use of Maple as a programming environment in which not just the cryptographic primitives but also the most important cryptographic schemes are implemented following the recommendations of standards bodies such as NIST, with many of the known cryptanalytic attacks implemented as well. The purpose of the Maple implementations is to let the reader experiment and learn, and for this reason the author includes numerous examples. The book discusses important recent subjects such as homomorphic encryption, identity-based cryptography and elliptic curve cryptography. The algorithms and schemes which are treated in detail and implemented in Maple include AES and modes of operation, CMAC, GCM/GMAC, SHA-256, HMAC, RSA, Rabin, Elgamal, Paillier, Cocks IBE, DSA and ECDSA. In addition, some recently introduced schemes enjoying strong security properties, such as RSA-OAEP, Rabin-SAEP, Cramer--Shoup, and PSS, are also discussed and implemented. On the cryptanalysis side, Maple implementations and examples are used to discuss many important algorithms, including birthday and man-in-the-middle attacks, integer factorization algorithms such as Pollard's rho and the quadratic sieve, and discrete log algorithms such as baby-step giant-step, Pollard's rho, Pohlig--Hellman and the index calculus method.This textbookis suitable for advanced undergraduate and graduate students of computer science, engineering and mathematics, satisfying the requirements of various types of courses: a basic introductory course; a theoretically oriented course whose focus is on the precise definition of security concepts and on cryptographic schemes with reductionist security proofs; a practice-oriented course requiring little mathematical background and with an emphasis on applications; or a mathematically advanced course addressed to students with a stronger mathematical background. The main prerequisite is a basic knowledge of linear algebra and elementary calculus, and while some knowledge of probability and abstract algebra would be helpful, it is not essential because the book includes the necessary background from these subjects and, furthermore, explores the number-theoretic material in detail. The book is also a comprehensive reference and is suitable for self-study by practitioners and programmers.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This introduction to cryptography employs a programming-oriented approach to study the most important cryptographic schemes in current use and the main cryptanalytic attacks against them. Discussion of the theoretical aspects, emphasizing precise security definitions based on methodological tools such as complexity and randomness, and of the mathematical aspects, with emphasis on number-theoretic algorithms and their applications to cryptography and cryptanalysis, is integrated with the programming approach, thus providing implementations of the algorithms and schemes as well as examples of realistic size. A distinctive feature of the author's approach is the use of Maple as a programming environment in which not just the cryptographic primitives but also the most important cryptographic schemes are implemented following the recommendations of standards bodies such as NIST, with many of the known cryptanalytic attacks implemented as well. The purpose of the Maple implementations is to let the reader experiment and learn, and for this reason the author includes numerous examples. The book discusses important recent subjects such as homomorphic encryption, identity-based cryptography and elliptic curve cryptography. The algorithms and schemes which are treated in detail and implemented in Maple include AES and modes of operation, CMAC, GCM/GMAC, SHA-256, HMAC, RSA, Rabin, Elgamal, Paillier, Cocks IBE, DSA and ECDSA. In addition, some recently introduced schemes enjoying strong security properties, such as RSA-OAEP, Rabin-SAEP, Cramer--Shoup, and PSS, are also discussed and implemented. On the cryptanalysis side, Maple implementations and examples are used to discuss many important algorithms, including birthday and man-in-the-middle attacks, integer factorization algorithms such as Pollard's rho and the quadratic sieve, and discrete log algorithms such as baby-step giant-step, Pollard's rho, Pohlig--Hellman and the index calculus method.This textbookis suitable for advanced undergraduate and graduate students of computer science, engineering and mathematics, satisfying the requirements of various types of courses: a basic introductory course; a theoretically oriented course whose focus is on the precise definition of security concepts and on cryptographic schemes with reductionist security proofs; a practice-oriented course requiring little mathematical background and with an emphasis on applications; or a mathematically advanced course addressed to students with a stronger mathematical background. The main prerequisite is a basic knowledge of linear algebra and elementary calculus, and while some knowledge of probability and abstract algebra would be helpful, it is not essential because the book includes the necessary background from these subjects and, furthermore, explores the number-theoretic material in detail. The book is also a comprehensive reference and is suitable for self-study by practitioners and programmers.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Modern cryptography depends heavily on number theory, with primality test ing, factoring, discrete logarithms (indices), and elliptic curves being perhaps the most prominent subject areas. Since my own graduate study had empha sized probability theory, statistics, and real analysis, when I started work ing in cryptography around 1970, I found myself swimming in an unknown, murky sea. I thus know from personal experience how inaccessible number theory can be to the uninitiated. Thank you for your efforts to case the transition for a new generation of cryptographers. Thank you also for helping Ralph Merkle receive the credit he deserves. Diffie, Rivest, Shamir, Adleman and I had the good luck to get expedited review of our papers, so that they appeared before Merkle's seminal contribu tion. Your noting his early submission date and referring to what has come to be called 'Diffie-Hellman key exchange' as it should, 'Diffie-Hellman-Merkle key exchange', is greatly appreciated. It has been gratifying to see how cryptography and number theory have helped each other over the last twenty-five years. :'-Jumber theory has been the source of numerous clever ideas for implementing cryptographic systems and protocols while cryptography has been helpful in getting funding for this area which has sometimes been called 'the queen of mathematics' because of its seeming lack of real world applications. Little did they know! Stanford, 30 July 2001 Martin E. Hellman Preface to the Second Edition Number theory is an experimental science.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Modern cryptography depends heavily on number theory, with primality test ing, factoring, discrete logarithms (indices), and elliptic curves being perhaps the most prominent subject areas. Since my own graduate study had empha sized probability theory, statistics, and real analysis, when I started work ing in cryptography around 1970, I found myself swimming in an unknown, murky sea. I thus know from personal experience how inaccessible number theory can be to the uninitiated. Thank you for your efforts to case the transition for a new generation of cryptographers. Thank you also for helping Ralph Merkle receive the credit he deserves. Diffie, Rivest, Shamir, Adleman and I had the good luck to get expedited review of our papers, so that they appeared before Merkle's seminal contribu tion. Your noting his early submission date and referring to what has come to be called 'Diffie-Hellman key exchange' as it should, 'Diffie-Hellman-Merkle key exchange', is greatly appreciated. It has been gratifying to see how cryptography and number theory have helped each other over the last twenty-five years. :'-Jumber theory has been the source of numerous clever ideas for implementing cryptographic systems and protocols while cryptography has been helpful in getting funding for this area which has sometimes been called 'the queen of mathematics' because of its seeming lack of real world applications. Little did they know! Stanford, 30 July 2001 Martin E. Hellman Preface to the Second Edition Number theory is an experimental science.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - A variety of modern research in analysis and discrete mathematics is provided in this book along with applications in cryptographic methods and information security, in order to explore new techniques, methods, and problems for further investigation. Distinguished researchers and scientists in analysis and discrete mathematics present their research. Graduate students, scientists and engineers, interested in a broad spectrum of current theories, methods, and applications in interdisciplinary fields will find this book invaluable.

Buch. Condition: Neu. Neuware -A variety of modern research in analysis and discrete mathematics is provided in this book along with applications in cryptographic methods and information security, in order to explore new techniques, methods, and problems for further investigation. Distinguished researchers and scientists in analysis and discrete mathematics present their research. Graduate students, scientists and engineers, interested in a broad spectrum of current theories, methods, and applications in interdisciplinary fields will find this book invaluable.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 536 pp. Englisch.

Hardcover. Condition: new. Hardcover. Group theoretic problems have propelled scientific achievements across a wide range of fields, including mathematics, physics, chemistry, and the life sciences. Many cryptographic constructions exploit the computational hardness of group theoretical problems, and the area is viewed as a potential source of quantum-resilient cryptographic primitives for the future. Group Theoretic Cryptography supplies an ideal introduction to cryptography for those who are interested in group theory and want to learn about the possible interplays between the two fields. Assuming an undergraduate-level understanding of linear algebra and discrete mathematics, it details the specifics of using non-Abelian groups in the field of cryptography. Moreover, the book evidences how group theoretic techniques help us gain new insight into well known, seemingly unrelated, cryptographic constructions, such as DES. The book starts with brief overviews of the fundamentals of group theory, complexity theory, and cryptography. Part two is devoted to public-key encryption, including provable security guarantees, public-key encryption in the standard model, and public-key encryption using infinite groups. The third part of the book covers secret-key encryption. It examines block ciphers, like the Advanced Encryption Standard, and cryptographic hash functions and message authentication codes. The last part delves into a number of cryptographic applications which are nowadays as relevant as encryptionidentification protocols, key establishment, and signature schemes are covered.The book supplies formal security analyses and highlights potential vulnerabilities for cryptographic constructions involving group theory. Summaries and references for further reading, as well as exercises, are included at the end of each chapter. Selected solutions for exercises are provided in the back of the book. Group theoretic problems appear to be the most promising source of hard computational problems for deploying cryptographic constructions. This title focuses on the specifics of using nonabelian groups in the field of cryptography. It provides an introduction to cryptography with emphasis on group theoretic constructions. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Softcover. Condition: New. Dust Jacket Condition: no dj. First. Discrete Mathematics in Network Security Protocols provides an in-depth examination of how discrete structures underpin the design and analysis of security mechanisms. The book covers essential topics such as cryptographic algorithms, graph theory applications, and combinatorial techniques that safeguard digital communications. It emphasizes the importance of discrete mathematics in constructing secure protocols resistant to various attack vectors. With a focus on practical implementation, this work offers valuable insights into the mathematical foundations that ensure data integrity, confidentiality, and authentication in modern network security systems. Publication Year: 2025. SHIPPING TERMS - Depending on your location we may ship your book from the following locations: France, United Kingdom, India, Australia, Canada or the USA. This item is printed on demand.

Softcover. Condition: New. Dust Jacket Condition: no dj. First. Cybersecurity is a critical concern in today's digital age, with discrete mathematics playing a crucial role in the development of secure protocols and algorithms. 'Discrete Mathematics in Cybersecurity Protocols' provides a comprehensive examination of the mathematical principles underlying cybersecurity, including cryptographic protocols, secure communication, and access control. By applying mathematical techniques from graph theory, combinatorics, and number theory, this book reveals the intricate patterns and structures that underlie secure protocols, shedding light on their applications in cryptography, coding theory, and more. Publication Year: 2025. SHIPPING TERMS - Depending on your location we may ship your book from the following locations: France, United Kingdom, India, Australia, Canada or the USA. This item is printed on demand.

Softcover. Condition: New. Dust Jacket Condition: no dj. First. Discrete Mathematics in Modern Blockchain Technology offers a comprehensive exploration of the intricate relationships between discrete mathematics and modern blockchain technology. By examining the underlying mathematical structures and principles, this book provides a deeper understanding of the cryptographic techniques and algorithms that underpin blockchain systems. The author presents a detailed analysis of the role of group theory, number theory, and combinatorics in ensuring the security and integrity of blockchain transactions. With its unique blend of mathematical rigor and practical applications, this book is an essential resource for researchers, developers, and practitioners seeking to harness the full potential of blockchain technology. Through a series of in-depth case studies and examples, the book demonstrates how discrete mathematics can be leveraged to create more efficient, secure, and scalable blockchain systems. Publication Year: 2025. SHIPPING TERMS - Depending on your location we may ship your book from the following locations: France, United Kingdom, India, Australia, Canada or the USA. This item is printed on demand.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Once the privilege of a secret few, cryptography is now taught at universities around the world. Introduction to Cryptography with Open-Source Software illustrates algorithms and cryptosystems using examples and the open-source computer algebra system of Sage. The author, a noted educator in the field, provides a highly practical learning experience by progressing at a gentle pace, keeping mathematics at a manageable level, and including numerous end-of-chapter exercises.Focusing on the cryptosystems themselves rather than the means of breaking them, the book first explores when and how the methods of modern cryptography can be used and misused. It then presents number theory and the algorithms and methods that make up the basis of cryptography today. After a brief review of 'classical' cryptography, the book introduces information theory and examines the public-key cryptosystems of RSA and Rabin's cryptosystem. Other public-key systems studied include the El Gamal cryptosystem, systems based on knapsack problems, and algorithms for creating digital signature schemes. The second half of the text moves on to consider bit-oriented secret-key, or symmetric, systems suitable for encrypting large amounts of data. The author describes block ciphers (including the Data Encryption Standard), cryptographic hash functions, finite fields, the Advanced Encryption Standard, cryptosystems based on elliptical curves, random number generation, and stream ciphers. The book concludes with a look at examples and applications of modern cryptographic systems, such as multi-party computation, zero-knowledge proofs, oblivious transfer, and voting protocols. 462 pp. Englisch.

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research. -Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scientists with a needed reference for the use of Boolean functions in cryptography -Addresses the issues of cryptographic Boolean functions theory and applications in one concentrated resource. -Organized logically to help the reader easily understand the topic 248 pp. Englisch.

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Lawrence C. WashingtonLike its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. With ad.