A stream cipher is an encryption algorithm which encrypts arbitrary length plain text, using a (fixed length) key. Some stream ciphers generate a key stream from only the key, which is then XOR-combined with the plain text, others feed back plain text or cryptotext into the algorithm to create the ...

learn more… | top users | synonyms

1
vote
0answers
37 views

chacha20-poly1305 padding and length encoding

The AEAD construction for chacha20-poly1305 described in the IETF proposal [1] encodes message lengths into the text that is to be hashed. The newer proposal [2] goes further and pads associated data ...
1
vote
2answers
105 views

What cryptanalysis is possible against two independent keystreams XORed against plaintext?

If a wise person was unsure about which commercial cryptography standards are truly secure from the fascist powers that be, it would seem the obvious option for companies and individuals is to now use ...
1
vote
2answers
61 views

Combining a keystream generator with a block cipher

I understand that: A stream cipher's security is diluted if the same key is used more than once. This is fixed by using an additional initialization vector in the keystream's computation. A block ...
0
votes
2answers
45 views

Where are the ChaCha20 test vectors/examples?

I see in the Salsa20 specification there are test examples throughout the document to help an implementer make sure every function works as designed. Consequently the whole algorithm would work ...
0
votes
1answer
37 views

How to implement the Salsa20 hash function?

I am currently implementing Salsa20 from the specification as an exercise in learning and self-flagellation. I have Sections 1-7 passing the test examples provided. I am now stuck on Section 8, The ...
-1
votes
1answer
79 views

Is a Combined Linear Congruential Generator secure for cryptography? [closed]

I learnt that a Combined Linear Congruential Generator (cLCG) has better properties than a Linear Congruential Generator (LCG). For those who don't know what a cLCG is, here are three links that might ...
0
votes
2answers
94 views

Is my method symmetric encryption?

To obfuscate data I made up this method on the spot without planning since the goal wasn't real encryption. At first I though this cannot be real encryption but after revisiting the code and reading ...
1
vote
1answer
146 views

Attack an stream cypher using 2 XORed LFSRs

We know that the Key were generated by 2 16Bit LFSRs (output of both is XORed together -> key) I already extracted a 64 Bit key sequence, but how can I calculate the polynom of the LFSRs (and the ...
2
votes
1answer
73 views

Diffusion in Stream Cipher

The diffusion property of a cipher defined by Shannon refers to the ability of a cipher to cause a lot off bits in the cipher text to be modified, when even a single bit in the plaintext is flips. ...
-2
votes
0answers
47 views

Example related to Algorithm to invert VMPC function

I am new with VMPC one way function. I understood the concept from vmpcfunction.com. But I can not understand algorithm of inverting VMPC function.I am not getting any example of it with detailed ...
4
votes
1answer
123 views

Dancing confusion with Daniel J. Bernstein's stream ciphers

I know of Salsa20 which won the ESTREAM competition. This is dated of 25 Dec 2007. There is also the ChaCha20 stream cipher (cr.yp.to/chacha.html). This claims to increase the amount of diffusion ...
7
votes
2answers
317 views

Streaming API to authenticated encryption

In regards to NaCl, I asked DJB he had any intent to add a streaming API to an authenticated cipher. His response was obvious in retrospect, that one should never release a decrypted plaintext before ...
3
votes
3answers
215 views

Stream cipher with Diffie-Hellman and Cryptographic Hash Function? [duplicate]

I know: Never do your own crypto. But this question is just theoretical. Assume you do a Diffie-Hellman Key Exchange with a server to produce a shared secret $x$. Then use a cryptographic hash ...
2
votes
0answers
48 views

Are all binary-additive stream ciphers reciprocal?

I'm writing a thesis focused on Maurer's provably-secure stream cipher. Long story short, this cipher works by expanding a short key into a long keystream and then XORring this keystream with the ...
1
vote
2answers
37 views

Condition on Vector Boolean Function to be Bijective

Suppose the vector boolean function be $$\begin{align} f:F^n_2 \longrightarrow F_2^n \\ (x_1,\dots ,x_n) \longrightarrow (x_2,\dots x_n,g) \\ \\ g:F^n_2 \longrightarrow F_2 \\ (x_1,\dots ,x_n) ...
1
vote
1answer
62 views

Is SEAL 3.0 broken?

I'll like to know if SEAL 3.0 (cf http://web.cs.ucdavis.edu/~rogaway/papers/seal.pdf) is broken. I stumbled on Bernstein's website that claimed that SEAL 3.0 has been broken. (cf ...
0
votes
0answers
29 views

How good is middle cube method with jumbled digits?

I had to make my own prng for a stream cipher for an inter school science project (I am mentioning that a lot). So I thought of cubing the seed instead of squaring it (like in the middle square ...
0
votes
0answers
37 views

symmetric encryption A5/1 and A5/2 algorithms

where does the key (Kc) used to generate the keystream comes from and also where does the 22bits counter comes from
0
votes
1answer
58 views

How can a good encryptor be made?

I am making an encryptor software for a stream cipher with my own PRNG as a project for an inter school science competition. How can I make one so that after it generates the pseudo random nos. it can ...
1
vote
1answer
154 views

How can a good pseudo-random number generator be made?

I am trying to make a pseudo-random number generator so that I can use it in a synchronous stream cipher for encrypting plain text. I want it to generate numbers which are as random as possible. What ...
1
vote
0answers
345 views

Stream Cipher : Never use stream cipher key more than once [duplicate]

Possible Duplicate: Taking advantage of one-time pad key reuse? How does one attack a two-time pad (i.e. one time pad with key reuse)? Denote C is cipher text, m is message, and PRG(k) is ...
0
votes
1answer
64 views

Why develop new stream ciphers when block ciphers can be trivally made into streams?

I've just been reading about a new drop-in replacement for the RC4 stream cipher, but why develop new stream ciphers when AES can be made into a stream with a little XORing?
11
votes
4answers
934 views

Can you make a hash out of a stream cipher?

A comment on another question made me wonder about something: Assume you're on a rather constrained platform — say, a low-end embedded device — with no built-in crypto capabilities, ...
5
votes
1answer
453 views

What do you call one time pad where pseudo-random numbers are used?

What is the encryption method called when pseudo-random numbers are used instead of true random numbers?
2
votes
1answer
147 views

Understanding Pseudo Random Generators

I've been taking a crypto course online. I have a good idea how PRG's and Stream Ciphers work, but I'd love to get some input to help visualize what is actually happening. I understand a seed is used, ...
0
votes
1answer
58 views

Encrypt a file for random access but only after an initial read of the whole file

I'm symmetrically encrypting a file (using a random salt and a user supplied password with PKCS5S2, i.e., nothing special) and I need to be able to access it randomly. Therefore I'm using a stream ...
6
votes
1answer
293 views

Security analysis of Spritz?

Recently, a new cipher called Spritz has been released by Ronald L. Rivest and Jacob Schuldt. It should be a "drop-in replacement" for RC4. There are many differences to RC4, Spritz is "spongy" and ...
-1
votes
1answer
89 views

Block Cipher Modes

I have a question here asking the following: Why do block ciphers need the use of blocking modes? To encrypt messages larger than the size of the block. To avoid having the same block ...
2
votes
2answers
155 views

Skein or Keccak stream cipher construction

I am wondering if using Skein or the Keccak hash algorithm in this construction (as a stream cipher) is secure: $H$ = Keccak or Skein hash with a 256 bit output $K$ = The main 256 bit random key, ...
1
vote
1answer
140 views

Message encrypted with a LFSR based stream cipher

I am learning about LFSR sequence and I came across this question: A 16-bit message consists of two ASCII characters. This message was encrypted with a one-time pad, and the key for the one-time pad ...
0
votes
1answer
73 views

stream cipher computation cost [closed]

With AES-CTR the computation time to encrypt a message of lengh $n$ blocks is $n$ computations of the block cipher. What is the running time to encrypt a message of $n$ bits using a stream cipher, ...
2
votes
1answer
137 views

Is this correct way to generate stream cipher using AES CTR mode?

We are implementing searchable encryption techniques proposed by Song et al in Java for a paper[1]. The schemes need a Stream Cipher for achieving search over encrypted data. The stream of random bits ...
1
vote
1answer
103 views

What is the most secure key expansion routine?

I am looking at G now, but is there a better, (in terms of security and speed), means by which a byte array can be expanded that doesn't involve another cipher, just a simple algorithm? I need to ...
-1
votes
1answer
113 views

What's the best packet cipher mode for use with UDP for example? Advantages or disadvantages of any alternatives?

Cipher modes typically assume data is streamed or read from a reliable channel with guaranteed ordering. However, many communication transports, such as UDP, are not reliable and don't guarantee order ...
2
votes
2answers
331 views

Can I construct a feasible stream cipher out of HMAC and a secure hash algorithm?

I have constructed a stream cipher from a secure hash algorithm and a HMAC. Here is a brief description of the algorithm: Let: (Actually Objective-C styled pseudo code) ...
11
votes
2answers
353 views

Can I use HMAC-SHA1 in counter mode to make a stream cipher?

Say I have an embedded device which is only capable of doing HMAC-SHA1 transformations (that device is, in fact, a YubiKey). Would it be secure to feed it like a block cipher in counter mode to get a ...
3
votes
0answers
72 views

Streaming mode of operation that is more resistant against nonce reuse

Is it possible to create a streaming mode of operation where the reuse of a nonce does not destroy confidentiality? In this question it would be allowed for the streaming mode to leak if ciphertexts ...
1
vote
1answer
185 views

Building a stream-cipher out of a hash function?

I've already read this: Is it feasible to build a stream cipher from a cryptographic hash function? However, my proposed construction differs… Suppose the hash generates N bits. These bits are split ...
2
votes
1answer
103 views

How to only encrypt a subset of the plaintext

I was wondering if there is a smart way for a user to only encrypt a subset of a plaintext. I'll try to be more specific. Let's suppose the user U wants to use a special cipher such that given a ...
3
votes
1answer
275 views

True Random Number Generator by milliseconds per keystroke (TRNG-Kms)

The simplest way to generate truly random numbers for OTP keys is to measure the time in milliseconds between each keystroke on a keyboard. The randomness depends on the user typing in various speeds. ...
0
votes
1answer
121 views

Is MAC-then-encrypt with stream ciphers secure?

While thinking about this recent question about a hash-then encrypt design, I reread the MAC-encrypt vs. encrypt-MAC question and noticed this answer quoting a paper showing that MAC-then-encrypt is ...
4
votes
2answers
95 views

Advantages of making streamcipher stream depend on plaintext?

Most descriptions that explain how streamciphers work (like the one on Wikipedia), tend to describe a model that boils down to a simple “$ciphertext = plaintext \oplus stream$”, where the stream is ...
3
votes
4answers
399 views

Is there a way to generate sound one-time pads out of public information?

Is there a way to 'mangle' a public data-source (for example, the current date in YYYYMMDD or the top New York Times headline) to form a one-time pad that will sufficiently hide the pad's source? ...
5
votes
1answer
210 views

Determine LFSR phase quickly?

I know it's possible with work backwards from the output bits of an LFSR to determine its feedback polynomial in a O(n) fashion. I'm also curious if, given an LFSR state and polynomial, is it ...
8
votes
2answers
544 views

What are the methods to construct a primitive binary nonlinear feedback shift register (NLFSR)?

Given a binary shift register of $n$ bits, a primitive binary nonlinear feedback shift register will generate a sequence with a period of $2^n - 1$. While I am unable to find a paper which directly ...
4
votes
4answers
553 views

Why isn't the alternating step generator used more often?

According to the Wikipedia entry for the Alternating Step pseudorandom number generator, there is no public cryptanalysis for this device since it was invented back in 1987 by C.G. Gunther. I have ...
2
votes
1answer
185 views

How to prove this LFSR equation?

I am having difficulty solving part (ii) of Excercise 5.17 from Becker's Cipher Systems. Exercise 5.17 $\quad$If $f(x),g(x)$ are any two polynomials over $GF(2)$ with $f(0)=g(0)=1$ show that ...
1
vote
1answer
132 views

Weak Stream Cipher cryptanalysis

Hi I have a stream cipher which uses a keystream of: F(r) || F(r+1) || F(r+2) || ... Suppose F(r) is the RSA encryption algorithm: ...
0
votes
1answer
178 views

Partially-known-plaintext attack of a stream cipher based on modular arithmetic

I have a function called $F$, using modular arithmetic as does RSA, defined as $$x\mapsto F(x) = g^x\bmod p$$ where $p$ is a 1024-bit prime and $g$ is a generator of $\mathbb Z_p^*$. A secret key $r$ ...
0
votes
0answers
19 views

Vernam Cipher with Repeating Key [duplicate]

I'm doing a piece of coursework for Uni and the task is to break a Vernam Cipher. So we have a randomly generated key which is as long as the message. It gets used for all the messages sent from that ...