UP	Paper 1825	US-M-O	DOWN
Public Key Cryptographic System using Mandelbrot Sets
Kumar,Suthikshn		PESIT
Mandelbrot sets are very popular infinitely complex fractals. Mandelbrot sets have been used for generating colorful images, melodious music etc. In this paper, authors propose the use of Mnadelbrot sets for public key cryptography. In the past, RSA and Elliptic curve cryptography have been used successfully. RSA uses the modular exponentiation concept from Number theory to generate the public key and private key pairs. The proposed system generates public key and private key pairs using Mandelbrot sets. It is also demonstareted using examples on how it is infeasible to compute private key by using the public key. It is well known fact that colorful Mandelbrot plots can be generated by Mandelbrot equations. Since Mandelbrot plots are infinitely complex, the public key crytpographic system can be built using this principle.
Dr. Suthikshn Kumar has 15+ years of experience in research and industry. He has worked in leading institutes and multinationals such as Philips Semiconductor, Infineon Technologies, L&T Infotech, University of Melbourne, IIT Chennai, Telstra Research Labs, Bangalore University. Prof Kumar has won several awards for innovation and quality. Dr Kumar has worked in countries such as Australia, France, Germany, Netherlands, UK and India. His pioneering contributions to computing field include "Lateral Computing", "Smart Volume control", "Fractal Ring Tone Generator". Dr Kumar has presented 23+ research papers in leading international conferences/conventions/journals. He has worked on several cutting edge projects on Mobile communication, VLSI design automation, Parallel Computing etc. Dr Kumar has served as general chair and technical program chair of several international conferences and workshops such as WCLC 2005, WCLC 2004, WoSCo, ICEMC2 2006 etc. Currently, he is the professor at PESIT and Director of MCNC.