Faculty Advisor

Martin, William J.

Abstract

Error correcting codes, such as Reed-Solomon codes, can be used to create authentication codes based on orthogonal arrays. These codes are provably secure up to a certain number of uses; however, as the number of desired uses goes up, so does the keylength. This project researches the security of a code whose messages (which function as private keys) have specific form that allows them to be represented in a more compact fashion. Specifically, messages with low Hamming weight are considered.

Publisher

Worcester Polytechnic Institute

Date Accepted

January 2002

Major

Computer Science

Project Type

Major Qualifying Project

Accessibility

Restricted-WPI community only

Advisor Department

Mathematical Sciences

Share

COinS