Introduction to Cryptography

• Main Authors: Padhye, Sahadeo, Sahu, Rajeev Anand, Saraswat, Vishal
• Format: eBook
• Language: English
• Published: Milton CRC Press 2018; Taylor & Francis Group
• Edition: 1
• Subjects: Algorithms; asymmetric cryptosystems; Authentication and hash functions; big data security; Cloud security; Combinatorics; communication security; COMPUTERSCIENCEnetBASE; cryptanalysi; cryptanalysis; cryptographic algorithms; cryptographic constructions; Cryptography; Cryptography-Mathematics; Cryptology; Digital signature and certificates; Information security; INFORMATIONSCIENCEnetBASE; InfoSECURITYnetBASE; MATHnetBASE; Number theory; Quantum and post-quantum cryptography; SCI-TECHnetBASE; STMnetBASE; OFB Mode; Elliptic Curve; ElGamal Signature; DLP; Affine Cipher; Diffie Hellman Key Exchange Protocol; Irreducible Polynomial; Homomorphic Encryption; Extended Euclidean Algorithm; Private Key; Public Key; Ciphertext Block; Hash Function; Secret Key; Stream Cipher; Field GF; ElGamal Cryptosystem; Plaintext Block; PKC; Secret Sharing Schemes; CFB Mode; Vigenere Cipher; Block Cipher; Cbc Mode; Galois Field GF
• ISBN: 1138071536; 9781138071537; 9780367781019; 0367781018
• DOI: 10.1201/9781315114590

Electronic communication and financial transactions have assumed massive proportions today. But they come with high risks. Achieving cyber security has become a top priority, and has become one of the most crucial areas of study and research in IT. This book introduces readers to perhaps the most effective tool in achieving a secure environment, i.e. cryptography. This book offers more solved examples than most books on the subject, it includes state of the art topics and discusses the scope of future research. Preface Overview of Cryptography Introduction Goals of Cryptography Classification of Cryptosystem Practically Useful Cryptosystem Cryptanalysis Basic Algebra Group Ring Field Exercise Number Theory Introduction Prime Numbers Cardinality of Primes Extended Euclidean Algorithm Primality Testing Factorization and Algorithms for it Congruences Quadratic Congruence Exponentiation and Logarithm Discrete Logarithm Problem and Algorithms for it Exercise Probability and Perfect Secrecy Basic Concept of Probability Birthday Paradox Perfect Secrecy Vernam One Time Pad Random Number Generation Pseudo-random Number Generator Exercise Complexity Theory Running Time and Size of Input Big-O Notation Types of algorithm Complexity Classes Exercise Classical Cryptosystems Classification of Classical Cryptosystem Block Cipher Stream Cipher Cryptanalysis of Cryptosystems Exercise 　 Block Ciphers Introduction Modes of Operation Padding Design Considerations Data Encryption Standard Advanced Encryption Standard Exercise Hash Function Compression and Hash Functions Hash function for cryptography Random Oracle Model Cryptographic Hash Functions Exercise Public Key Cryptosystem Introduction Diffie-Hellman Key Exchange Protocol RSA Cryptosystem Rabin Cryptosystem ElGamal Cryptosystem Elliptic Curve Cryptosystem Exercises Digital Signature Formal Definitions Attack Goals for Digital Signature Digital Signature in Practice Some Popular Digital Signatures Exercises Research Directions in Cryptography Pairing-Based Cryptography Zero-knowledge Proof System Authenticated Group Key Exchange Attribute-Based Cryptography Homomorphic Encryption Secure Multi-party Computation Secret Sharing Post-Quantum Cryptography Side-Channel Analysis References Index Sahadeo Padhye has a doctorate in Cryptography, and currently working as Associate Professor at Department of Mathematics, Motilal Nehru National Institute of Technology Allahabad, India. His research interests include Public key Cryptography, Elliptic Curve Cryptography, Digital Signatures, Lattice Based Cryptography. He has published many research papers in reputed international journals and conferences in Cryptography. Rajeev A Sahu has a doctorate in Cryptography and currently working as a Post-Doctoral Researcher at Université Libre de Bruxelles, Belgium. He has also worked as an Assistant Professor at C.R. Rao Advanced Institute of Mathematics Statistics & Computer Science, Hyderabad, India. His research interests are Identity-Based Cryptography, Elliptic Curve Cryptography, Digital Signature, Searchable Encryption, Post-Quantum Cryptography on which he has published over two dozen research papers in reputed international journals and conferences in Computer Science and Cryptography. Vishal Saraswat received his Ph.D. in Cryptography from University of Minnesota, Minneapolis, USA and has held regular and visiting positions at a variety of institutions, including IIT Jammu, IIT Hyderabad, ISI Kolkata, Univ. of Hyderabad and AIMSCS, Hyderabad. His research interests include anonymity and privacy, searchable encryption, postquantum crypto, and active and passive cryptanalysis, topics on which he has published several papers in reputed international journals and conferences.