Abstract
It is shown that synchronous stream ciphers based on keystream generators can be used for efficient and secure encryption/decryption of random access files if the underlying next-state function satisfies an associativity condition. In particular, secure designs based on combining different types of linearity in the next-state function are proposed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
