eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20080915:112438 of this paper. See the latest version.

Paper 2008/386

Shared Key Encryption by the State Machine with Two-Dimensional Random Look-up Table

Michael Lifliand

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
Published elsewhere. Unknown where it was published
Keywords
secret-key cryptographyfoundationscryptanalysispseudo-randomness
Contact author(s)
mlifliand @ gmail com
History
2008-09-15: received
Short URL
https://ia.cr/2008/386
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.