We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
Abstract— Structured peer-to-peer systems have grown enormously because of their scalability, efficiency and reliability. These systems assign a unique identifier to each user ...
Sunam Ryu, Kevin R. B. Butler, Patrick Traynor, Pa...
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
The College of Engineering and Computer Science at the University of Tennessee at Chattanooga (UTC) requires all undergraduate seniors to participate in a capstone project designe...
Joseph M. Kizza, Li Yang, Andy Novobilski, Kathy W...