Results 281 to 290 of about 28,041 (324)
Some of the next articles are maybe not open access.
Spectrum Analysis of the Stream Cipher
Applied Mechanics and Materials, 2012Classical cryptography theory holds that the true random sequence is better than any pseudorandom sequence on the security of stream cipher. So people prefer the pseudorandom sequence with long-period to the pseudorandom sequence with short-period. In this paper, it is proved through power spectrum analysis that the pseudorandom sequence with long ...
Lei Zhang, Xin Li, Dai Mao Lin
openaire +3 more sources
2008
The stream cipher Rabbit was first presented at FSE 2003 [3], and no attacks against it have been published until now. With a measured encryption/decryption speed of 3.7 clock cycles per byte on a Pentium III processor, Rabbit does also provide very high performance.
Erik Zenner +2 more
openaire +2 more sources
The stream cipher Rabbit was first presented at FSE 2003 [3], and no attacks against it have been published until now. With a measured encryption/decryption speed of 3.7 clock cycles per byte on a Pentium III processor, Rabbit does also provide very high performance.
Erik Zenner +2 more
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Stream ciphers for GSM networks
2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2001With the advance of wireless communications technology, mobile communications has become more convenient than ever. However, because of the openness of wireless communications, how to protect the privacy between communicating parties is becoming a very important issue. In this paper, we focus on the security of transferring voice messages on the Global
Chi-Chun Lo, Yu-Jen Chen
openaire +3 more sources
Applications to Stream Ciphers
2016In this chapter, after some general observations on stream ciphers and block ciphers and on the fundamental concept of entropy as defined in Information Theory, we apply our ideas of finite fields to linear feedback shift registers (LFSRs), a frequent component of stream cipher designs.
openaire +2 more sources
Stream Ciphers and Correlation
1999One important area where sequences find application is cryptography. In the modern electronic era information is stored, processed and transmitted encoded as binary sequences. The automated business environment places great value on this information and it is vital that it is protected. This is often best done by cryptographic means and one such method
K. Brincat, F. C. Piper, P. R. Wild
openaire +2 more sources
2008
CryptMT version 3 (CryptMT3) is a stream cipher obtained by combining a large LFSR and a nonlinear filter with memory using integer multiplication. Its period is proved to be no less than 219937? 1, and the 8-bit output sequence is at least 1241-dimensionally equidistributed.
Takuji Nishimura +3 more
openaire +1 more source
CryptMT version 3 (CryptMT3) is a stream cipher obtained by combining a large LFSR and a nonlinear filter with memory using integer multiplication. Its period is proved to be no less than 219937? 1, and the 8-bit output sequence is at least 1241-dimensionally equidistributed.
Takuji Nishimura +3 more
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
2012
Synchronous stream ciphers are commonly used in applications with high throughput requirements or on hardware devices with restricted resources. Well known stream ciphers are A5/1, used in GSM, RC4, used in SSL, or E0 as specified in Bluetooth, but also some block cipher modes of operation.
openaire +2 more sources
Synchronous stream ciphers are commonly used in applications with high throughput requirements or on hardware devices with restricted resources. Well known stream ciphers are A5/1, used in GSM, RC4, used in SSL, or E0 as specified in Bluetooth, but also some block cipher modes of operation.
openaire +2 more sources