Abstract

XSL (eXtended Sparse Linearization) is a recent algebraic attack aimed at the Advanced Encryption Standard. In order to shed some light into the behavior of the algorithm, which is largely unknown, we have studied XSL on equation systems with variables interpreted either as bits or bytes. The algorithm solves byte-systems much faster than it does bit-systems, which promts us to suggest that if a more compact representation of equation systems can be found, such as one where the variables are 8-byte blocks, or even a more generalized form of 8n-byte blocks, it may be possible to increase the speed of XSL dramatically.

Library of Congress Subject Headings

Computer algorithms--Testing; Data encryption (Computer science)--Standards; Computer security; Computers--Access control

Publication Date

2007

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Radziszowski, Stanislaw - Chair

Advisor/Committee Member

Kaminsky, Alan

Advisor/Committee Member

Agarwal, Anurag

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA76.9.A43 K37 2007

Campus

RIT – Main Campus

Download

Share

COinS