Paper 2008/386 Original: eprint.iacr.org/2008/386 ↗
Shared Key Encryption by the State Machine with Two-Dimensional Random Look-up Table
Abstract
This paper describes a new approach to creation of fast encryption methods with symmetric (shared) key. The result solution is intermediate one between block and stream ciphers. The main advantages of both types of ciphers are realized, while most of disadvantages are eliminated. The new approach combines encryption with built-in calculation of the hash for the data integrity, pseudo-random generator, and option for dual shared keys. These properties are pivotal for secure applications. These new methods may be designed for different size of shared secret key. Both software and hardware implementations of the new methods are fast and simple and may be used in various security applications. Presented cryptanalysis proves basic features and gives an option to design actual provable security methods.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2008-09-15: last updated
- 2008-09-15: published
- Short URL
- https://ia.cr/2008/386
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/386,
author = {Michael Lifliand},
title = {Shared Key Encryption by the State Machine with Two-Dimensional Random Look-up Table},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/386},
year = {2008},
url = {https://eprint.iacr.org/2008/386}
}