Results 271 to 280 of about 15,702 (332)
Some of the next articles are maybe not open access.
2008
A variety of different clock-controlled stream ciphers and attacks on them have been described in a number of papers. However, few word-oriented algorithms with an irregular clocking mechanism have been proposed. This paper proposes a new design of irregular clocking for word-oriented stream ciphers that is dynamic feedback control and show analysis ...
Shinsaku Kiyomoto +2 more
openaire +1 more source
A variety of different clock-controlled stream ciphers and attacks on them have been described in a number of papers. However, few word-oriented algorithms with an irregular clocking mechanism have been proposed. This paper proposes a new design of irregular clocking for word-oriented stream ciphers that is dynamic feedback control and show analysis ...
Shinsaku Kiyomoto +2 more
openaire +1 more source
2015
It is desirable that both the encryption and decryption functions be public knowledge and so the secrecy of the message, given the ciphertext, depends totally on the secrecy of the secret key k. Although this well-established principle, called Kerckhoffs’ principle, has been known since the mid-1800s some companies still ignore it and choose to deploy ...
openaire +1 more source
It is desirable that both the encryption and decryption functions be public knowledge and so the secrecy of the message, given the ciphertext, depends totally on the secrecy of the secret key k. Although this well-established principle, called Kerckhoffs’ principle, has been known since the mid-1800s some companies still ignore it and choose to deploy ...
openaire +1 more source
2015
We can interpret a pseudo-random function as a stream cipher. Let {F k } K be a PRF family with codomain C of bitstrings of length l. The PRF family immediately defines a stream cipher for messages of length l bits.
openaire +1 more source
We can interpret a pseudo-random function as a stream cipher. Let {F k } K be a PRF family with codomain C of bitstrings of length l. The PRF family immediately defines a stream cipher for messages of length l bits.
openaire +1 more source
2009
Stream ciphers are essential tools for encrypting sensitive data. While having the limitation that a single key may never be used twice, they are often very fast and can offer a valuable alternative to block ciphers in many applications. In this contribution we describe a novel stream cipher based on discrete Kolmogorov systems.
openaire +1 more source
Stream ciphers are essential tools for encrypting sensitive data. While having the limitation that a single key may never be used twice, they are often very fast and can offer a valuable alternative to block ciphers in many applications. In this contribution we describe a novel stream cipher based on discrete Kolmogorov systems.
openaire +1 more source