[Cryptography] Call for Book chapters

[Kannan Balasubramanian]

Call for Chapters: Algorithmic Strategies for Solving Complex Problems in
Cryptography
[image: Facebook Send]
<http://www.igi-global.com/publish/call-for-papers/submit/2071>
Editors
Kannan Balasubramanian,Mepco Schlenk Engineering College, Sivakasi

Call for Chapters
Proposals Submission Deadline: February 28, 2016
Full Chapters Due: June 30, 2016
Submission Date: October 30, 2016

Introduction
The progress in the development of information and communication
technologies has enabled the growth of digital applications that have
changed the way users store and process data. The traditional methods of
centralized computing have given way to newer ways of distributed computing
where clusters of computers together attempt to solve a computationally
difficult problem. A number of problems have been identified that have
defied easy solutions using computers. Some of these problems in
cryptography include factoring large numbers into its prime factors and
finding very large prime numbers which are required in the RSA
Cryptosystem.

Other hard problems in cryptography are the variants of the Diffie-Hellman
and Discrete Logarithm problems. A number of public key cryptosystems exist
which require computation for the choice of parameters. Many cryptanalytic
methods involve guessing the key given a large number of
plaintext-ciphertext pairs. Efficient algorithms are also required for
digital signature generation and verification. The solutions for these
problems should consider the time and space complexity of the algorithms.

Different algorithmic strategies used in the solutions of these problems
include techniques such as Greedy strategy, Divide and Conquer, Brute Force
Search, Dynamic Programming, Branch and Bound, Randomized algorithms and
Heuristics. A commonly used technique used in distributed computing is to
divide a given a problem into a number of subtasks and combine the results
from the different subtasks to obtain the final solution. An example is a
search problem where different tasks corresponding to different subtrees
may be assigned to different computers and the result from these computers
may be combined to obtain the final optimal solution. Search based
algorithms are inefficient since they have to search among a very large
number of solutions. Cryptographic algorithms aim at computing the correct
solution and not an approximate solution. Many of the cryptographic
algorithms include a verification step which necessitates correct
implementation of the solutions.

This book looks to discuss and address the challenges in providing
efficient solutions for one or more of the above problems. The editor seeks
chapters that address techniques for solving the problem and the
performance results of the technique in terms of time taken and storage
capacity used. Experience gained using techniques from evolutionary
computing in solving cryptography problems are also welcomed. Chapters
making efficient use of memory organization can also yield quicker
solutions to the problems.

Objective
This publication aims to be an essential reference source, building on the
available literature in the solution for the difficult problems while
providing for further research opportunities in this field. It is hoped
that this edited book will provide the resources necessary for
Cryptographers, Cryptanalysts, Developers and information technology
managers to adopt and implement techniques for solving Complex problems in
Cryptography.

Target Audience
Computer Programmers, academicians, researchers, advanced-level students,
software developers, and government officials will find this book useful in
furthering their research exposure to pertinent topics in problem solving
techniques in Cryptography and to assist in furthering their own research
efforts in this field

Recommended Topics
Contributors are welcome to submit chapters on the following topics
relating to algorithms and implementations for solving computationally
Difficult problems in:

- Finding very large prime numbers.
- Factorization of a number into its Prime factors.
- Heuristic and Randomized algorithms for Cryptanalytic algorithms.
- Efficient algorithms for Public key Cryptography and Key exchange
protocols.
- Efficient Implementation of Digital Signature Algorithms.
- Sequential and Parallel processing of the Cryptography Algorithms.
- Computational methods for Complex problems in Cryptography.
- Programming Languages and tools for Cryptography and Cryptanalysis
- Evolutionary computing techniques for Cryptography Algorithms
- Efficient Memory Organization for solving Complex problems in
Cryptography
And Cryptanalysis

Submission Procedure
Researchers and practitioners are invited to submit on or before *February
28, 2016*, a 2-3 page chapter proposal clearly explaining the mission and
concerns of his or her proposed chapter. Authors of accepted proposals will
be notified by *March 30, 2016* about the status of their proposals and
will be sent chapter guidelines. Full chapters are expected to be submitted
by *June 30, 2016*.

Publisher
This book is scheduled to be published by IGI Global (formerly Idea Group
Inc.), publisher of the "Information Science Reference" (formerly Idea
Group Reference), "Medical Information Science Reference," "Business
Science Reference," and "Engineering Science Reference" imprints. For
additional information regarding the publisher, please visit
www.igi-global.com. This publication is anticipated to be released in 2017.

Important Dates
*February 28, 2016:* Proposal Submission Deadline
*March 30, 2016:* Notification of Acceptance
*June 30, 2016:* Full Chapter Submission
*August 30, 2016:* Review Results Returned
*September 30, 2016:* Revised Chapter Submission
*October 30, 2016:* Final Chapter Submission

Inquiries
kannanbala at mepcoeng.ac.in

Propose a chapter for this book
<http://www.igi-global.com/publish/call-for-papers/submit/2071>

-- 
Dr. Kannan Balasubramanian
Professor, Dept of CSE,
Mepco Schlenk Engineering College,
Sivakasi-626005
Tel: (04562)235367
Mobile: 9442378500
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20160109/16e38b33/attachment.html>