Recent Projects: Projects for MIPP (Melbourne India Postgraduate Program)

Coding for Flash Memories and Distributed Storage

Efficient Information Hiding schemes for Images and Video streaming using Error Correcting codes

Synchronization Waveforms for Modern Radar and Cognitive Radio

Provably Secure Cryptographic Access Control

Existing Projects

Secure E-mail

Electronic mail, usually referred as E-mail, has emerged as a basic communication means on today's computer networks. As the proliferation of Internet and related technologies expand, more need is felt in securing this basic network communication tool. The project involves using the state of the art cryptographic techniques for E-mail security. There is a version of E-mail security package written in Java developed by previous honour students. An ample scope for research in E-mail security exists both in theoretical and developmental aspects.

Contact: Udaya Parampalli

Public key Infra-structure for Network Security

There is a growing interest in applications of cryptographic techniques to Internet and other networks. Public key which was invented in 70's can make tremendous impact on the way business transactions are done on the Internet. The project aims to build an elaborate public key infrastructure for various communication scenario. Special techniques from Elliptic curve theory will be utilized to build new public key algorithms. Again there is a scope for research in development of new software, development of cryptographic protocols and mathematical aspects.

Contact: Udaya Parampalli

Algebraic Coding

Coding theory began its modern journey in late forties with the work of Hamming, Shannon and Golay. The theory virtually dragged abstract mathematics like Algebra and Number theory, then considered as pure mathematics subjects, into the realm of engineering. In its mathematical treatment, algebraic coding theory used properties of discrete structures like finite fields. Algebraic codes are used in error control schemes for transmission of digital signals protecting them against noise, fading and jamming. Basically, these codes add {\it redundant} information to the digital messages so that it is easy to extract the message information even though they are subjected to aberrations like noise, fading and jamming. There are many interesting problems ( for example arithmetic coding, coding for data storage) which are relevant to computers and communication. Those interested can

Contact: Udaya Parampalli.

Quantum Error correcting codes

Quantum error-correcting codes ($q$-codes)are important in protecting transmission of quantum information which is tipped as a communication method of the future. Some of the problems in finding $q$-codes can be converted to the problem of finding classical error-correcting codes over certain alphabets. Those interested can contact

Contact: Udaya Parampalli.

Efficient algorithms for stream cipher

Cryptosystems are generally classified into two categories:secret-key or private key or symmetric systems and public-key or asymmetric systems. In symmetric key crypto systems, sender and receiver share a secret key before using encryption and decryption. Some of the known symmetric key cryptosystems are DES, IDEA and RC4. The platforms where these algorithms are used vary depending on the type of communication. Fast algorithms for stream ciphers are essential if they need to be used for practical purposes. There are many algorithmic issues for development and analysis of stream ciphers. Also, good stream cipher design leads to good message digest algorithms. There are interesting issues related to applicability of stream ciphers to message digest algorithms.

Contact: Udaya Parampalli.