Algorithmic Strategies for Solving Complex Problems in Cryptography

Balasubramanian, Kannan‏ · Rajakani, M.‏

أغسطس 2017 · IGI Global

معلومات عن هذا الكتاب الإلكتروني

Cryptography is a field that is constantly advancing, due to exponential growth in new technologies within the past few decades. Applying strategic algorithms to cryptic issues can help save time and energy in solving the expanding problems within this field.

Algorithmic Strategies for Solving Complex Problems in Cryptography is an essential reference source that discusses the evolution and current trends in cryptology, and it offers new insight into how to use strategic algorithms to aid in solving intricate difficulties within this domain. Featuring relevant topics such as hash functions, homomorphic encryption schemes, two party computation, and integer factoring, this publication is ideal for academicians, graduate students, engineers, professionals, and researchers interested in expanding their knowledge of current trends and techniques within the cryptology field.

نبذة عن المؤلف

Dr. Kannan Balasubramanian received a Ph.D degree in Computer Science from University of California, Los Angeles, and the M.Tech degree in computer Science and Engineering from IIT Bombay India and his Msc(Tech) degree in Computer Science from BITS, Pilani, India. He is a Professor at Mepco Schlenk Engineering College, Sivakasi, India. His research interests include Network Security, Network protocols, applications and performance.

Mr. M. Rajakani is currently an Assistant Professor in the Department of Computer Science and Engineering at Mepco Schlenk Engineering College, Sivakasi. His interests are in Information Security and Data mining. [Editor]