Abstract

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.

Publication Date

2008

Document Type

Master's Project

Student Type

Graduate

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Bischof, Hans-Peter

Advisor/Committee Member

Radziszowski, Stanislaw

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2013.

Additional Files
BPadalinoProposal2007.pdf (81 kB)

Campus

RIT – Main Campus

Download

Additional files available below

Share

COinS