Ad-hoc networks are on the forefront of technological advances as more embedded devices allow for wireless communications without necessarily requiring a network infrastructure to connect to. One of the larger problems associated with such ad-hoc networks is the lack of being able to access a PKI to create individual secure sessions for these groups being created. For this project, an implementation generating the public and private keys for an RSA public-key protocol has been created on top of the M2MI middleware developed at RIT. In this implementation, as originally described by Dan Boneh, all parties help contribute to the generation of the RSA public modulus, N, without explicitly knowing the factorization of it. It has been shown that this implementation requires, on average, 32689 rounds of the protocol to create a 1024-bit RSA modulus for the group, and has an approximate growth of log2(N) 25 rounds per bit.
Department, Program, or Center
Computer Science (GCCIS)
Padalino, Brian, "A distributed public key creation system for ad-hoc groups" (2008). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2013.