1
vote
1answer
59 views

Why does UMAC encrypt the output of universal hash function?

UMAC uses a key to choose a random hash function from a family of universal hash functions. The value of the hash function is always encrypted using yet another key, and the resulting ciphertext ...
1
vote
1answer
98 views

On countermeasures for replay attacks. Does this one require plaint text password storage?

I was reading this wiki section on the countermeasures against replay attacks and it basically suggests that: If Bob wants to confirm Alice's identity he can send a one-time token (I think it should ...
1
vote
1answer
126 views

Cryptanalysis of Marvin32 compared to SipHash

So I am curious about the security analysis of Marvin32, the randomized hash algorithm used in .NET (to prevent hash-table DoS). I found the source code here: ...
1
vote
1answer
106 views

Encryption through multiplication of encoded key [closed]

Yesterday I finished programming my own encryption program. It is using an input and a key. Here are all the steps it is going through. For an example, let say the ...
1
vote
1answer
195 views

Can AES in CBC mode be parallelized?

Is there any way to parallelize AES running in CBC mode? (The plan is to parallelize it using OpenMP)
1
vote
1answer
123 views

poodle padding multiple blocks?

I'm quite new to the topic and read a bit about poodle and padding oracle. I quite understand the "regular" padding oracle attack, substituting the last byte of block(n-1) to determine the last byte ...
1
vote
2answers
129 views

Is it practical to use a stream cipher in a block cipher mode?

My idea is to use a stream cipher encrypting 16 bytes at a time as a primative block cipher in a mode of operation such as CBC mode. Is this practical or useful in any way?
1
vote
2answers
110 views

Does this chat protocol exist?

I want to implement a secure chat via mobile. I´ld like to know if the following protocol for key agreement – which can use any asymmetric encryption – exists. Suppose Alice and Bob are two clients ...
1
vote
1answer
85 views

Chosen-plaintext attack

Let F be a block cipher with 128-bit block length. Consider the following encryption scheme for 256-bit messages: to encrypt message $M=m_1∥m_2$ using key $k$ (where $|m_1|=|m_2|=128$), choose random ...
1
vote
2answers
87 views

Negilible Function $\frac{1}{n!}$

Is $\frac{1}{n!}$ a negligible function where $n$ is a security parameter? Application: I have a vector of n>100 elements. I permute it and give it to an adversary. The adversary can break it if it ...
1
vote
1answer
110 views

AES process candidates implementations and usages

There were fifteen candidates in the AES selection and I suppose that Rijndael wasn't the single good algorithm. I know that Camellia is an evolution of E2 candidate and can be used as symetric ...
1
vote
2answers
102 views

Reciprocal block ciphers

I'm interested in the property of involution in block ciphers and how one would go about constructing one. Creating a cipher where $E_K(E_K(M))=M$ for any $M$ and $K$ isn't an obvious task and the use ...
1
vote
1answer
112 views

Turning data into seemingly random noise

I am currently working on a python script that does image steganography, altering the least significant bit on each channel of the image. Now imagine encrypting a file with a bunch of null bytes, or ...
1
vote
1answer
42 views

Question about discrete log - why can one attacker not solve for g but two colluders can?

I'm reading about the broadcast encryption described in Fiat and Naor's paper, I screen grabbed the relevant part below. My question is essentially: If there's a secret: $g^{abc}$ $mod$ $A$ (where ...
1
vote
1answer
93 views

Bilinear pairing arithmetic

Is this $e(g^x,g^yH^z) = e(g^x,g^y)e(g^x,H^z)$ expression is true? where $ g$ is the generator and $ H \in G $
1
vote
1answer
277 views

How to create a PEM file for storing an RSA key?

I have an RSA private key $\{d,n\}$ and a public key $\{e,n\}$, where $n$ is the modulus, and I also have the prime factors $p$ and $q$ of $n$. I want to create a PEM file containing this ...
1
vote
1answer
78 views

Encoding a message to a point of curve y^2=x^3+7 and Bitcoin Core

Where should I look at in Bitcoin Core source code to figure out how the signature process trasform a message in a curve point? To sign a transaction (message) in Bitcoin system, you need to encode ...
1
vote
1answer
117 views

Given an encrypted file, what are possible ways to find its encryption algorithm?

Given an encrypted file, what are possible ways to find its encryption algorithm? Heuristic ways are okay as well.
1
vote
1answer
68 views

What is a good way to handle longer strings using FPE?

While experimenting with this FPE based on FE1 http://botan.randombit.net/manual/fpe.html (well actually a port of it in C#) I found when the string length gets too long (number of characters N) ...
1
vote
1answer
133 views

What is the “Walsh Function” about?

I'm currently dealing on the so called “Walsh Function” (WF) that is written like: $$f^W(a)=\sum_{x\in{F^n_2}}(-1)^{f(x)+(a,x)}$$ What I know is that this function is used to approximate an arbitrary ...
1
vote
1answer
70 views

Can Winternitz be easily converted to a many-time encryption scheme?

The Winternitz scheme is typically cited as being an OTS scheme. Can it also be used as a one-time encryption scheme? If it can be used as a one-time encryption scheme, then is it possible to easily ...
1
vote
1answer
26 views

Key iteration count while using random keyfile larger than master key

If I were to have a 4096-bit file of random data (/dev/random) used as a keyfile for LUKS, would there be any benefit to having a key iteration count higher than 1? My reasoning is that the attacker ...
1
vote
1answer
282 views

RSA: Why must e be relative prime to phi(n) [duplicate]

I've got a question concerning fields used in RSA: Let's use the following symbols for my example: {p,q} = primes {e,n} = public key {d,n] = private key I learnt that an inverse element exists if a ...
1
vote
1answer
122 views

What is SHA-256 in Conjunctive Normal Form?

What is the conjunctive normal form (CNF) representation of $\text{SHA-256}(m)=h$, where $m$ is of fixed (or bounded) size and $h$ is 256 bit?
1
vote
2answers
238 views

Attribute-based encryption for cloud storage

I'm trying to understand attribute-based encryption schemes. Almost all articles describe that they are designed for cloud storage, but as I understand, almost all computing (encryption & ...
1
vote
1answer
68 views

Combining cascaded encryption keys into one key

Is there an encryption algorithm where it's possible to combine multiple encryption keys into one, so that: $E_{AB}(Data) = E_A(E_B(Data))$ KeyAB should be computable from KeyA and KeyB, but it must ...
1
vote
1answer
52 views

Is authentication length always a subset of encryption length?

Do in all the use cases, if I have to encrypt and authenticate, encrypt-then-authenticate or authenticate-then-encrypt, like in IPSEC, SSL or SSH or others, if I were to do these operations to a ...
1
vote
1answer
298 views

Vigenère, auto-correlation vs Kasiski examination

What are the differences between 'Kasiski examination' and 'auto-correlation' ? In Cryptool site, they state that autocorrelation analysis is more efficient and clearer than the Friedman or Kasiski ...
1
vote
1answer
88 views

Prove there is PRG that is not necessarily one-to-one

We assume that there is at least one PRG .Now prove there is a PRG like $G:\{0,1\}^{n} \rightarrow \{0,1\}^{l(n)} $ such that it is not necessarily one-to-one.
1
vote
1answer
59 views

Using similar passwords and salts for PBKDF2

I'm trying to generate a bunch of pseudo-random keys for AES using PBKDF2, where the AES ciphers will be used in CTR mode as pseudo-random number generators. My goal is to create a 2-dimensional ...
1
vote
1answer
329 views

Creating unique keys with md5

The project I'm working on requires me to find a way to create a unique key based on data stored in a table. The table in question consists of x columns and y rows. In order to create the key I want ...
1
vote
1answer
119 views

Replay Attack in Stream Cipher

Stream ciphers are vulnerable to replay attack if the same key k is used. If E() is a stream cipher and an attacker intercepts the message m that's being transmitted at time t, how can the attacker ...
1
vote
3answers
733 views

Decrypt AES-encrypted data with another key

Here is a plain question, all filled with pseudo-real data :) We have a string: "hello" and two keys for AES: GoodKey and BadKey. We encrypt our string with GoodKey, and receive something like ...
1
vote
1answer
120 views

Authentication using a one-time pad

I am building a small embedded system of two nodes that communicate wirelessly. The microcontrollers I'm using are very limited: they only have 256 bytes of RAM. I would like to be able to ...
1
vote
1answer
132 views

How are RSA and ElGamal compatible in PGP?

I'm starting to play with PGP and I don't understand how if your key pair is RSA you can encrypt a message for someone whose key is for example ElGamal. How does the asymmetric key exchange work if ...
1
vote
1answer
206 views

Replacing the PRF in PBKDF2 with Keccak

I am unable to find a reliable, tested library for a decent password based key derivation function e.g. Scrypt in the programming language I am using, but I have a reliable library for PBKDF2 (which ...
1
vote
1answer
126 views

HMAC tag to verify the key (verification in the reverse direction)

A quick question. Are there any problems with the following HMAC use-case: We have two entities ($A$ and $B$), both of them have a secret ($A$ has $S_0$ and $B$ has $S_1$) $A$ generates a random ...
1
vote
3answers
141 views

Deciphering text encrypted with a changing cipher

I know there are many ways to crack basic ciphers were each letter is mapped to some other letter, but what ways are there to decode something that was encrypted using a cipher that changed after ...
1
vote
1answer
108 views

RSA padding confusion attacks

Server A produces signed messages on request. You can tell server A what type of RSA padding to use in the signature (either RSASSA-PKCS1v1_5 or RSASSA-PSS). Either way, the message will be signed ...
1
vote
1answer
214 views

How do SignRecover and VerifyRecover work?

In PKCS#11, there are the SignRecover and VerifyRecover methods, where the data can be recovered from the signature. How do these methods work? Can I implement signrecover and verifyrecover with ...
1
vote
1answer
149 views

Performing differential cryptanalysis for randomly generated S-boxes

As far as I know, performing differential or linear cryptanalysis always requires a knowledge of the S-boxes' content and order. Yet in Bruce Schneier's Applied Cryptography, it is stated that random ...
1
vote
1answer
115 views

What would a backdoor in symmetric key cipher look like? [duplicate]

Pretty much what the title says. DES was suspected of having one, but I couldn't imagine what it could possibly look like if only the NSA knew how to use it. Dual_EC_DRBG's backdoor is asymmetric, but ...
1
vote
1answer
336 views

Drawback of ElGamal encryption

I am trying to find out some disadvantages of ElGamal cryptography but I'm not able to figure out what's wrong with the algorithm. The only one I found is that a known-plain text attack is possible in ...
1
vote
2answers
139 views

ECDSA Public key randomness

If I have a 256bit ECDSA public key how likely is it that the same public key will be generated by another person. Will it take on average 2^256 tries to generate same public key? If I xor the first ...
1
vote
1answer
100 views

What is the polynomial to use in the Massey-Omura cryptosystem?

The Massey-Omura cryptosystem uses "multiplication over the finite field $GF(2^n)$. I'm just starting understand the idea of multiplying polynomials and I've searched for online calculators to use for ...
1
vote
2answers
175 views

How to show that a function is not a PRP?

So I have to answer these questions, but I honestly have no idea what I am doing or where to begin. Can I get some advice on how to tackle these? Consider a PRP candidate function $f$ on $K = X = ...
1
vote
2answers
265 views
1
vote
1answer
175 views

3DES Modes EED orEDE?

Can we use EED with 2 keys (K1 K1 K3) rather than EDE (k1,k2,k1) ? We measure the strength of DES by the effort (in term of number of tries) in finding some K1 & K2 to match a known plaintext and ...
1
vote
1answer
114 views

Finding $x$'s parity in the discrete log problem

Suppose $p$ is prime, and $g, a\in\mathbb F_p$ are given elements with $g$ a primitive root. The discrete log problem poses the task of finding an integer $x$ such that $g^x=a$. Show that even if $x$ ...
1
vote
1answer
333 views

Additional Data in AEAD (Chacha20-poly1305 libsodium)

I have recently been playing with Chacha20-Poly1305 with libsodium, and all of the examples state the additional data portion of the tag is stored in plaintext when encrypted. But from what I can tell ...

15 30 50 per page