Student Work

Combinatorial structures in cryptography

Public

Downloadable Content

open in viewer

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.

  • This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
Creator
Publisher
Identifier
  • 02D282M
Advisor
Year
  • 2002
Date created
  • 2002-01-01
Resource type
Major
Rights statement
License

Relations

In Collection:

Items

Items

Permanent link to this page: https://digital.wpi.edu/show/3b591c69x