Algebraic Cryptanalysis and Polynomial Systems of Equations
Time and place
1 PM on Thursday, March 11th, 2010; NAC 6113
Gregory Bard (Fordham University)
Abstract
Algebraic Cryptanalysis is the two-step process of converting a cipher system (usually a block cipher or a stream cipher) into a polynomial system of equations over a finite field; next one solves the system of equations to find the secret key of the cipher. I will use as an extended example of this the block cipher Keeloq, used in the remote keyless entry of nearly all automobiles until recently, which I broke in the opening chapter of my dissertation.
But there are applications of finite fields other than code-breaking. I will also present some other motivating examples, background and techniques. Parts of the talk will be suitable for undergraduate math majors who are familiar with modular arithmetic.
