02 Number Conserving Cellular Automata Rules and Integral Value Transformations

 Abstract: In this lecture I will discuss some of our results on number conservation and Density classification problem. Though simple in nature, they are considered to be  hard in the field of Cellular Automata (CA).

Additive CA over finite abelian groups and Cryptography

 Dear All, 

You may remember, last year, during the first wave of the pandemic, when virtual classrooms and online meetings have become the new normal, we started the first webinar series on cellular automata where eminent scientists and experts over the globe in this field shared their research findings and engaged in lively discussions with the audience. We have also conducted a memorial series "A Tribute to John Conway: A Lecture Series on the Memory of Prof. John Horton Conway" on the month of April 2021 to honor the first death anniversary of Prof. John Horton Conway. Thank you all for making those programs successful.

We are pleased to inform you that, during this ongoing second wave also, we have planned to share a virtual podium where we can get to know each other's work, meet and interact with experts and pioneering scientists of our domain. With this thought, we are resuming our webinar series on Cellular Automata to engage us in a creative discourse on a common platform with likeminded people.

Our first session of this second webinar series is to be held on 19-JUN-2021.

Title of the Talk: Additive CA over finite abelian groups and Cryptography"

Speaker:  Prof. Enrico Formenti,  University of Nice Sophia Antipolis, France
Date: Saturday, 19 June · 7:00 – 8:30 pm IST

The meeting link for this event will be shared though Google Calender soon. 

Please participate with us in this series again making it highly enlightening and interactive events.

Best regards,

Kamalika and Sukanta

On behalf of 
Cellular Automata India Research Group    

--
Dr. Kamalika Bhattacharjee, Assistant Professor, Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli,
Tamilnadu, India
and
Dr. Sukanta Das, Associate Professor and Head, Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, West Bengal, India

Nonlinear Cellular Automata: A Better Cryptographic Primitive

Speaker: Prof. Dipanwita Roy Chowdhury

Brief Bio of the Speaker: Prof. Roy Chowdhury has received her B.Tech and M.Tech degrees in Computer Science from University of Calcutta in 1987 and 1989 respectively, and the PhD degree from the Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur in 1994. She is a Professor in the Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India. Prof. Roy Chowdhury is the recipient of INSA Young Scientist Award and Associate of Indian Academy of Science and is the fellow of Indian National Academy of Engineers (INAE). She is also a member of IEEE and a life member of CRSI (Cryptology Research Society of India). Her current research interests are in the field of Cellular Automata, Cryptography & Security, Error Correcting Code, and VLSI & Embedded Systems. She has published more than 250 technical papers in renowned International Journals and Conferences.

Formal Logic of Cellular Automata

Speaker: Prof. Sukanta Das, Associate Professor and Head, Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, India

This talk on "Formal Logic of Cellular Automata", a work by Prof. Sukanta Das and Prof. Mihir K. Chakraborty, was first delivered to AUTOMATA 2020 on 10-AUG-2020. On our request, Prof. Das gave a seminar on the same topic as the first session of our Webinar Series on Cellular Automata.