Security of substitution-permutation network
Name
940970010-MIT.pdf
Description
Full printable version
Size
1.55 MB
Format
Adobe PDF
Checksum (MD5)
6a120a32dae64cb5e63f636b4440ad41
Author(s)
Chen, Cheng, S.M. Massachusetts Institute of Technology
Advisor(s)
Vinod Vaikuntanathan.
Date Issued
2015
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis, we study the security of a block cipher design called substitution-permutation network (SPN). We prove that when S-box is chosen uniformly at random as a permutation, the resulting SPN is a strong pseudorandom permutation even against an adversary having oracle access to that S-box. We then examine some special cases of SPN for a fixed S-box and prove two special cases of SPN inspired by AES are 2-wise independent.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 43-44).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
