<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/CINECAstyle.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T12:40:09Z</responseDate><request verb="GetRecord" identifier="oai:iris.unitn.it:11572/367817" metadataPrefix="oai_dc">https://iris.unitn.it/oai/request</request><GetRecord><record><header><identifier>oai:iris.unitn.it:11572/367817</identifier><datestamp>2026-04-03T00:47:39Z</datestamp><setSpec>com_11572_237821</setSpec><setSpec>com_11572_101871</setSpec><setSpec>col_11572_237822</setSpec><setSpec>ou_ou00013</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>On algebraic and statistical properties of AES-like ciphers</dc:title>
<dc:creator>Rimoldi, Anna</dc:creator>
<dc:contributor>Rimoldi, Anna</dc:contributor>
<dc:contributor>Sala, Massimiliano</dc:contributor>
<dc:subject>Settore MAT/02 - Algebra</dc:subject>
<dc:description>The Advanced Encryption Standard (AES) is nowadays the most widespread block cipher in commercial applications. It represents the state-of-art in block cipher design and provides an unparalleled level of assurance against all known cryptanalytic techniques, except for its reduced versions. &#xd;
Moreover, there is no known efficient way to distinguish it from a set of random permutations. &#xd;
&#xd;
The AES (and other modern block ciphers) presents a highly algebraic structure, which led researchers to exploit it for novel algebraic attacks. &#xd;
These tries have been unsuccessful, except for academic reduced versions.&#xd;
&#xd;
Starting from an intuition by I. Toli, we have developed a mixed algebraic-statistical attack. Using the internal algebraic structure of any AES-like cipher, we build an algebraic setting where a related-key (statistical) distinguishing attack can be mounted. Our data reveals a significant deviation of the full AES-128 from a set of random permutations. &#xd;
Although there are recent successful related-key attacks on the full AES-192 and the full AES-256 (with non-practical complexity), our attack would be the first-ever practical distinguishing attack on the full AES-128 (to the best of our knowledge).</dc:description>
<dc:date>2009</dc:date>
<dc:type>info:eu-repo/semantics/doctoralThesis</dc:type>
<dc:identifier>https://hdl.handle.net/11572/367817</dc:identifier>
<dc:identifier>http://dx.doi.org/10.15168/11572_367817</dc:identifier>
<dc:identifier>10.15168/11572_367817</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>firstpage:1</dc:relation>
<dc:relation>lastpage:130</dc:relation>
<dc:relation>numberofpages:130</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:publisher>Università degli studi di Trento</dc:publisher>
<dc:publisher>place:TRENTO</dc:publisher>
<dc:rights>license:Tutti i diritti riservati (All rights reserved)</dc:rights>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>