A Panorama on Classical Cryptography; Designing, Implementing, Breaking, Verifying, and Standardizing Cryptography

Abstract

In this thesis we cover a large part of the classical cryptography world: we examine the design of new symmetric primitive; we explore implementation strategies of lightweight schemes; we analyze a new high performance algorithm; we use formal verification to prove the correctness of Elliptic Curve Cryptography implementations; and finally we describe one of the way algorithms are standardized.