Home / Journals American Journal of Neural Networks and Applications / Advances in Cellular Automata Applications with Cryptography
Advances in Cellular Automata Applications with Cryptography
Submission DeadlineDec. 20, 2019

Submission Guidelines: http://www.sciencepublishinggroup.com/journal/guideforauthors?journalid=339

Lead Guest Editor
G Kumaresan
National Institute of Technology, Tiruchirappalli, Tamil Nadu, India
Guest Editors
  • R Mohan
    National Institute of Technology, Tiruchirappalli, Tamil Nadu, India
  • Fasel Qadir
    Department of Computer Science, University of Kashmir, Srinagar, India
  • Alaa Eddine Belfedhal
    Mascara University, Mascara, Algeria
  • Anand Prakash Shukla
    Krishna Institute of Engineering and Technology, Ghaziabad, India
  • Vetri Selvi
    K. Ramakrishnan College of Technology, Tiruchirappalli, India
  • P Rajakumar
    Jayaram College of Engineering and Technology, Tiruchirappalli, India
  • Derdus M Kenga
    Faculty of Information Technology of Strathmore University, Nairobi, Kenya
  • Siva Sankar
    Department of Computer Applications, National Institute of Technology, Tiruchirappalli, India
  • Sivaiah Bellamkonda
    Department of Computer Applications, National Institute of Technology, Tiruchirappalli, India
  • Satya Narayana
    Department of Computer Applications, National Institute of Technology, Tiruchirappalli, India
  • Dhava Kumar
    Department of Computer Science and Engineering, Periyar Maniammai Institute of Science and Technology, Thanjavur, India
  • Sathish Kumar
    Department of Computer Applications, National Institute of Technology, Tiruchirappalli, India
Introduction
Cellular automata (CA) as a fully parallel modern computational model have been widely used and successfully applied to different and interdisciplinary scientific fields. It is basically local in their nature, CA have been proven perfect schemes in many cases since they can capture the essential features of these systems where global behaviour arises from the combined effect of simple components which interrelate locally.
While most of these situation and systems are also continuous in their nature, examining their inherent characteristics in a discrete manner does shrink the quality of the provided CA application modeling and simulation solutions. In addition, parallelism and locality features of CA allow a simple parallelization, an extremely significant and desirable property given the current scenario of hardware architectures. In spite of the already achieved results, advances in theory and computational properties of the CA methods and applications of CA to interdisciplinary scientific fields are continuously proposed by various research groups all over the world to overcome CA applications in cryptography field difficulties and to produce enhanced performance for the resulted methods.
This special issue aims at dealing with the aforementioned issues and challenges that providing a forum for the discussion and presentation of CA as theoretical models in cryptography and existing solutions to various problems in different field.
Aims and Scope:
  1. Complex systems and networks
  2. Neural networks
  3. Cloud computing
  4. Image processing
  5. Cryptography
  6. Random number generation
  7. Natural computing
  8. Parallelism
  9. Dynamical systems
Guidelines for Submission
Manuscripts should be formatted according to the guidelines for authors
(see: http://www.sciencepublishinggroup.com/journal/guideforauthors?journalid=339).

Please download the template to format your manuscript.

ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186