Cube-Type Algebraic Attacks on Wireless Encryption Protocols

Formally evaluating the strengths of a given cryptosystem will ensure that no flaws have crept into the application. During our investigation, we adopted Armknecht and Krause's approach to model the E0 encryption function, which does not depend on memory bits and will hold for every clock tick....

Full description

Saved in:
Bibliographic Details
Published in:Computer (Long Beach, Calif.) Calif.), 2009-10, Vol.42 (10), p.103-105
Main Authors: Petrakos, N., Dinolt, G.W., Michael, J.B., Stanica, P.
Format: Article
Language:English
Subjects:
Algebra
Clocks
Computer simulation
Cryptography
Cube-type algebraic attacks
Data encryption
Encryption
Linear-feedback shift registers
Mathematical analysis
Mathematical models
Polynomials
Security
Ticks
Wireless application protocol
Wireless-encryption protocols
World Wide Web
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Formally evaluating the strengths of a given cryptosystem will ensure that no flaws have crept into the application. During our investigation, we adopted Armknecht and Krause's approach to model the E0 encryption function, which does not depend on memory bits and will hold for every clock tick. We devised a polynomial of degree four consisting of 20 variables, 16 considered unknown and four known. We then created an automated tool in the Maple 12 environment (www. maplesoft.com) that finds all the maxterms and their corresponding linear-coefficient superpolys for the E0 encryption function.
ISSN:0018-9162
1558-0814
DOI:10.1109/MC.2009.318