Commutative algebra and cryptography by Robert Christian Subroto(.PDF)
File Size: 10 MB
Commutative algebra and symmetric cryptography by Robert Christian Subroto
Requirements: .ePUB, .PDF reader, 10 MB
Overview: In this thesis, I present a deeper relationship between symmetric cryptography and commutative algebra, which at first glace seems to be unrelated concepts. More specifically between the permutation of bits and modules over group algebras. This relationship provides a deeper mathematical understanding of linear functions which are constructed using these bit permutations. These functions are a popular choice for designing symmetric cryptographic schemes. This new connection helps us understand certain behaviour of these linear functions, and can be used to construct new functions which ommit certain cryptographic weaknesses.
Cryptography is a subfield of Computer Science focussing on achieving secure communications. It can roughly speaking be split into two categories: symmetric cryptography and public-key cryptography. This thesis only discusses symmetric cryptography, which covers cryptographic techniques for encryption, data authentication and authenticated encryption where the sender and receiver share a single secret key. A cryptographic scheme consists of a set of functions and protocols enabling (one of) these cryptographic techniques. Let us go into these cryptographic techniques in more detail.
Genre: Non-Fiction > Educational
Free Download links: