Algorithmic Strategies for Solving Complex Problems in Cryptography

Algorithmic Strategies for Solving Complex Problems in Cryptography

Indexed In: SCOPUS
Release Date: August, 2017|Copyright: © 2018 |Pages: 302
DOI: 10.4018/978-1-5225-2915-6
ISBN13: 9781522529156|ISBN10: 1522529152|EISBN13: 9781522529163
Hardcover:
Available
$245.00
TOTAL SAVINGS: $245.00
Benefits
  • Printed-On-Demand (POD)
  • Usually ships one day from order
Hardcover:
Available
$245.00
TOTAL SAVINGS: $245.00
Benefits
  • Printed-On-Demand (POD)
  • Usually ships one day from order
E-Book:
Available
$245.00
TOTAL SAVINGS: $245.00
Benefits
  • Multi-user license (no added fee)
  • Immediate access after purchase
  • No DRM
  • PDF download
E-Book:
Available
$245.00
TOTAL SAVINGS: $245.00
Benefits
  • Immediate access after purchase
  • No DRM
  • PDF download
  • Receive a 10% Discount on eBooks
Hardcover +
E-Book:
Available
$295.00
TOTAL SAVINGS: $295.00
Benefits
  • Printed-On-Demand (POD)
  • Usually ships one day from order
  • Multi-user license (no added fee)
  • Immediate access after purchase
  • No DRM
  • PDF download
Hardcover +
E-Book:
Available
$295.00
TOTAL SAVINGS: $295.00
Benefits
  • Printed-On-Demand (POD)
  • Usually ships one day from order
  • Immediate access after purchase
  • No DRM
  • PDF download
Article Processing Charge:
Available
$800.00
TOTAL SAVINGS: $800.00
OnDemand:
(Individual Chapters)
Available
$37.50
TOTAL SAVINGS: $37.50
Benefits
  • Purchase individual chapters from this book
  • Immediate PDF download after purchase or access through your personal library
Description & Coverage
Description:

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.

Coverage:

The many academic areas covered in this publication include, but are not limited to:

  • Digital Signature Algorithms
  • Hash Functions
  • Homomorphic Encryption Schemes
  • Integer Factoring
  • Multiparty Computation
  • Multiprecision Algorithms
  • Public Key Encryption
  • Quadratic Sieve Algorithm
  • Two Party Computation
Table of Contents
Search this Book:
Reset
Media
Videos:
Editor/Author Biographies
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.
Abstracting & Indexing
Archiving
All of IGI Global's content is archived via the CLOCKSS and LOCKSS initiative. Additionally, all IGI Global published content is available in IGI Global's InfoSci® platform.