Multi Asymmetric Cryptographic RSA Scheme
Students: Andrew Davis and Matthew Wagner
We propose a version of RSA encryption that uses the Chinese Remainder Theorem (CRT) for the purpose of concealing multiple plain-texts in one cipher-text. We prove the algorithm mathematically. Furthermore, we prove our algorithm secure against the chosen plaintext (CPA) attack. We also compare textbook RSA against our algorithm and show the security and size advantages. The new algorithm can also take advantage of current methods that speed up the decryption process of RSA. This scheme will become a basis for further one to many public key cryptosystems.
Securing Safety Messages in VANETs
Students: Kevin Miller and Yakeen Alwishah
Vehicular Ad-hoc Networks are an anticipated mobile ad-hoc system that allows communication between vehicles and roadside infrastructure to increase safety on the road. It is essential that this system is able to send fast and secure messages to prevent accidents. We apply the Ambiguous Multi-Symmetric Cryptographic primitive in four models to vehicular ad-hoc networks for encryption and decryption of safety messages. Finally, we implement AMSC using a mobile Android application. We experiment with multiple Android devices using mobile ad-hoc Bluetooth communication. Furthermore, we examine the time and overhead of this implementation in Android.