You are here

FAU Collections » FAU Research Repository » FAU Theses and Dissertations

algebraic attack on block ciphers

Download pdf | Full Screen View

Date Issued:
2010
Summary:
The aim of this work is to investigate an algebraic attack on block ciphers called Multiple Right Hand Sides (MRHS). MRHS models a block cipher as a system of n matrix equations Si := Aix = [Li], where each Li can be expressed as a set of its columns bi1, . . . , bisi . The set of solutions Ti of Si is dened as the union of the solutions of Aix = bij , and the set of solutions of the system S1, . . . , Sn is dened as the intersection of T1, . . . , Tn. Our main contribution is a hardware platform which implements a particular algorithm that solves MRHS systems (and hence block ciphers). The case is made that the platform performs several thousand orders of magnitude faster than software, it costs less than US$1,000,000, and that actual times of block cipher breakage can be calculated once it is known how the corresponding software behaves. Options in MRHS are also explored with a view to increase its efficiency.
Title: An algebraic attack on block ciphers.
215 views
113 downloads
Name(s): Matheis, Kenneth.
Charles E. Schmidt College of Science
Department of Mathematical Sciences
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 2010
Publisher: Florida Atlantic University
Physical Form: electronic
Extent: xiv, 163 p. : ill.
Language(s): English
Summary: The aim of this work is to investigate an algebraic attack on block ciphers called Multiple Right Hand Sides (MRHS). MRHS models a block cipher as a system of n matrix equations Si := Aix = [Li], where each Li can be expressed as a set of its columns bi1, . . . , bisi . The set of solutions Ti of Si is dened as the union of the solutions of Aix = bij , and the set of solutions of the system S1, . . . , Sn is dened as the intersection of T1, . . . , Tn. Our main contribution is a hardware platform which implements a particular algorithm that solves MRHS systems (and hence block ciphers). The case is made that the platform performs several thousand orders of magnitude faster than software, it costs less than US$1,000,000, and that actual times of block cipher breakage can be calculated once it is known how the corresponding software behaves. Options in MRHS are also explored with a view to increase its efficiency.
Identifier: 702127762 (oclc), 2976444 (digitool), FADT2976444 (IID), fau:3579 (fedora)
Note(s): by Kenneth Matheis.
Thesis (M.S.C.S.)--Florida Atlantic University, 2010.
Includes bibliography.
Electronic reproduction. Boca Raton, Fla., 2010. Mode of access: World Wide Web.
Subject(s): Ciphers
Cryptography
Data encryption (Computer science)
Computer security
Coding theory
Integrated circuits -- Design and construction
Held by: FBoU FAUER
Persistent Link to This Record: http://purl.flvc.org/FAU/2976444
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU