"Coding Theory-Based Cryptopraphy: McEliece Cryptosystems in Sage" by Christopher Roering
 

Honors Theses, 1963-2015

Document Type

Thesis

Publication Date

2013

Disciplines

Computer Sciences | Mathematics

Abstract

Unlike RSA encryption, McEliece cryptosystems are considered secure in the presence of quantum computers. McEliece cryptosystems leverage error-correcting codes as a mechanism for encryption. The open-source math software Sage provides a suitable environment for implementing and exploring McEliece cryptosystems for undergraduate research. Using our Sage implementation, we explored Goppa codes, McEliece cryptosystems, and Stern’s attack against a McEliece cryptosystem.

Comments

Approved by: Sunil Chetty, Lynn Ziegler, Bret Benesh, Robert Campbell, Robert Hesse, James Schnepf, Anthony Cunningham

Plum Print visual indicator of research metrics
PlumX Metrics
  • Usage
    • Downloads: 5263
    • Abstract Views: 298
  • Social Media
    • Shares, Likes & Comments: 1
see details

Share

COinS