2026-09-19T02:30:18Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1015822022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Vinod Vaikuntanathan.
Chen, Cheng, S.M. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-03-03T21:10:22Z
2016-03-03T21:10:22Z
2015
2015
http://hdl.handle.net/1721.1/101582
940970010
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).
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.
by Cheng Chen.
S.M.
44 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Security of substitution-permutation network
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="bec8525d-7fd2-4593-943e-68b0d23f4803">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Security of substitution-permutation network</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2015</PublicationDate>
<Authors>
<Author>
<DisplayName>Chen, Cheng, S.M. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>