We describe Heraclitus as an example of a stream cipher that uses a 128 bit index string to specify the structure of each instance in real time: each instance of Heraclitus will be a stream cipher based on mutually clocked shift registers. Ciphers with key-dependent structures have been investigated and are generally based on Feistel networks. Heraclitus, however, is based on mutually clocked shift registers. Ciphers of this type have been extensively analysed, and published attacks on them will be infeasible against any instance of Heraclitus. The speed and security of Heraclitus makes it suitable as a session cipher, that is, an instance is generated at key exchange and used for one session.
History
Event
International Conference on Communications and Signal Processing (2011 : Kerala, India)
Pagination
141 - 145
Publisher
IEEE
Location
Kerala, India
Place of publication
Piscataway, N.J.
Start date
2011-02-10
End date
2011-02-12
ISBN-13
9781424497980
Language
eng
Publication classification
E1 Full written paper - refereed
Copyright notice
2011, IEEE
Title of proceedings
ICCSP 2011 - International Conference on Communications and Signal Processing