An algebraic framework for cipher embeddings

Authors:
C. Cid;S. Murphy;M. J. B. Robshaw
Affiliations:
Information Security Group, Royal Holloway, University of London, Egham, Surrey, U.K.;Information Security Group, Royal Holloway, University of London, Egham, Surrey, U.K.;France Télécom Research and Development, Issy les Moulineaux, France
Venue:
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Year:
2005

Citing 6
Cited 2

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
The Design of Rijndael

The Design of Rijndael
Essential Algebraic Structure within the AES

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
In How Many Ways Can You Write Rijndael?

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm

Fast Software Encryption, Cambridge Security Workshop

Projective aspects of the AES inversion

Designs, Codes and Cryptography
Nonlinear equivalence of stream ciphers

FSE'10 Proceedings of the 17th international conference on Fast software encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the idea of block cipher embeddings and consider a natural algebraic framework for such constructions. In this approach we regard block cipher state spaces as algebras and study some properties of cipher extensions on larger algebras. We apply this framework to some well-known examples of AES embeddings.