3
votes
0answers
58 views

Is OCB the state of the art in authenticated encryption modes of operation for block ciphers?

OCB mode seems to represent the state of the art in authenticated encryption modes, largely due to its speed – it is faster than GCM even when GCM has hardware support. Its only drawbacks seem ...
1
vote
1answer
51 views

Huffman coding is a prefix code, proof [closed]

How would you prove that Huffman coding $C$ is a prefix code, i.e $$\forall x,y \in C,\ \forall z \in \lbrace 0,1\rbrace^*,\ x\not=y||z$$ Using induction according to the number of items to code? ...
4
votes
1answer
42 views

How does order-preserving encryption work on string?

I have read “How does order-preserving encryption work?”. After that, I completed order-preserving encryption on integer data. Now, I have four questions in this subject: Is it possible to apply ...
-2
votes
3answers
534 views

How to reverse this hash function?

I have a function that takes an $m$ byte inputs $x_i$ and maps it a 32 byte outputs $y_j$. The hash function is defined as: $$y_j = \sum_{i=1}^{m} (x_i)^{i-1} \pmod {127}$$ The input is restricted ...
3
votes
3answers
71 views

Are there any hash functions that use integers of arbitrary bit size (e.g., int63)?

More precisely, I am looking for hash functions where the internal state can be decomposed as a vector of integers of size 63. That is, machine integers where one of the bits is fixed and unusable.
1
vote
0answers
16 views

Sigma protocol: witness hiding

I am working on an assignment and I am stuck with the last part of proving witness hiding for the protocol. I have previously proved it is witness indistinguishable, and it has q (primer number ...
1
vote
2answers
98 views

Understanding Hash function notations

I am implementing a Certificateless Cryptography Algorithm by referencing the paper An Efficient Certificateless Encryption for Secure Data Sharing in Public Clouds. In this paper on page no. 4 during ...
0
votes
1answer
34 views

Calculating characters from the sum of ASCII pairs

I have a series of messages (limited to only a-z and A-Z) that are encoded such that the sum is taken of every two ASCII values and concatenated. For instance, the message ...
5
votes
1answer
202 views

How does Microsoft's BitLocker Recovery Code work?

I don't trust Microsoft BitLocker because it is closed source, which makes it so people can't audit it. But now I'm really interested in how its recovery code works. In my own knowledge, encrypted ...
18
votes
0answers
49 views

Is there a key for AES-128, 256 etc, where cleartext equals ciphertext? [duplicate]

Is there a key for AES-128, 256 etc, where cleartext equals ciphertext? (regardless of modes like chaining or ctr-cbc)
3
votes
1answer
45 views

Using AES-CTR to generate AES subkeys from a master key and nonce

Suppose I would like to encrypt some data using AES-GCM because it has hardware support on my processor and it is secure. Unfortunately, I don't like the 96-bit nonce size, because I want to randomly ...
6
votes
1answer
69 views

Does “double RC4” exhibit the same weaknesses as standard RC4?

I know that RC4 is weak. However, I don't know if two RC4 streams XORed with each other can be attacked in the same way that one can, especially if $n$ bytes are dropped. Assume keys and IVs are ...
0
votes
2answers
99 views

What is the strength and attack vectors of this simple scheme?

Let's say that Alice wants to communicate some secret value $S$ to Bob through a public channel in a way that other people don't know what the value was. To do this, Alice publishes that secret value ...
0
votes
0answers
34 views

How common are non-RSA digital certificates?

Is there a statistic available that shows just how common are DSA or ECC certificates amongst webservers? I know that RSA-based certificates are the most common, however I'd like to know, if there is ...
0
votes
1answer
71 views

Reducing the probability that a password will be guessed

In a file users' password hashes are stored. There are 2 approaches to reduce the probability that the password is guessed. Increase the size of the salt from 12 bits to 24 bits. Increase the length ...
0
votes
0answers
38 views

Non-repudiation in classical cryptosystem

How can we modify classical cryptography system to provide non-repudiation? I want to ensure non-repudiation in symmetric key cryptography so that we can find out who is sender of a particular ...
-2
votes
0answers
22 views

Interpreting a set S subset of {1,2,3,…,N} to a N-bits String

If I have a set S which is a subset of {1, 2, . . ., N} and I want to interpret S as a N- bits string. Is it possible to do so? If possible then how?
0
votes
0answers
31 views

Can we use more than one irreducible polynomial in AES?

I understand that the irr. poly is used to form the s-box (and inv. s-box), the key schedule and the mix columns. But could we use a different irr. poly for the mix columns and another for the key ...
8
votes
2answers
1k views

Why is the permutation in AES (and other ciphers) not random?

If the permutation in AES (or other ciphers) were random, would it not be stronger against differential attacks? If this is so, then might we need fewer rounds for the same level of security?
0
votes
0answers
24 views

Are there any holes in my stateless encryption protocol?

I want to create a reasonably secure protocol to allow a bunch of machines within a datacenter to securely communicate to one another. Specifically as a kind of tunnel. I want to avoid building up ...
1
vote
1answer
66 views

A simple client/server authentication protocol

Some days ago I asked for a help to find and correct the problems of an authentication protocol. I closed the post because I was convinced I can correct it but, unfortunately I'm having some troubles. ...
-1
votes
1answer
51 views

Comparison of RSA and DRSA scheme using SageMath

I am trying to compare the encryption and decryption speed of the RSA and the DRSA scheme with same public key $(n, e)$ and private key $d$ (using SageMath). For $1024$ bits long $n$, I got the ...
2
votes
2answers
57 views

What's the appeal of using ChaCha20 instead of AES?

I read about ChaCha20 being used in TLS by Google, SSH, and towards standardization in general. What's the appeal of using something other than AES, what with AES receiving dedicated CPU instructions ...
1
vote
1answer
37 views

security of a block cipher mode of operation

Consider the following block cipher mode of operation: \begin{align} tag_0 &= mac\:key\\ plaintext_0' &= plaintext_0 \oplus iv\\ E(tag_0 | plaintext_0') = C_0 &= tag_1 | ciphertext_0\\ ...
0
votes
1answer
30 views

Secret construction

Given set of random strings $w =\{s_1, s_2, s_3 ... s_n\}$ are there any algorithms to construct single master secret $S$ from them? Subsequently we should be able to deconstruct the $S$ back to ...
3
votes
0answers
25 views

Does length prepending fix the key reuse problems with CBC and CBC-MAC?

As I hope everybody is well-aware, re-using the key for CBC-MAC and CBC is a really bad idea. Now, there's also the paradigm to prepend the message length to the CBC-MAC (as "associated data") to ...
6
votes
2answers
334 views

Nonce encryption with Poly1305-Chacha20

I have seen that a couple of companies (like Google, Apple HomeKit) are adding "ChaCha20-Poly1305" as an encryption option. Poly1305 requires algorithm to encrypt the nonce. The Poly1305-AES ...
1
vote
1answer
51 views

Calculate if a digital signature is valid

In the book An Introduction to Mathematical Cryptography, it mentions a section on digital signatures and a theoretical example. I am having difficulty understanding the book and I was wondering if ...
0
votes
0answers
38 views

ISIS as a one-way function

The usual formulation of the ISIS problem is the following: Given uniform $A$ and $u$, find a short $e$ such that $Ae = u \bmod q$. A different definition (call it ISIS-OWF) is to let $f_A(e) = Ae ...
5
votes
1answer
55 views

What is the security strength of an n-bit HMAC?

HMACs depend on preimage resistance, or so I have read. The security strength of hash function with an $n$-bit output against collision attacks is $2^{\frac{n}{2}}$. Against preimage attacks, it is ...
1
vote
1answer
23 views

What is the starting point of Hellman's TMTO method?

I understand what is happening and how the endpoint is computed but I'm still a bit unsure of where "SP" (Staring Point) came from. Are the starting points, randomly selected keys from the key-space ...
14
votes
2answers
221 views

Is GCM still recommended?

I stumbled across a forum thread where a security researcher seemed to have negative feelings towards GCM. I had always thought from prior readings that GCM was the current gold standard for ...
1
vote
1answer
35 views

Do I need to use null bytes and \x80 in hash length extension attack?

Say I want to perform a hash length extension attack. All the tools I have used use \x00 and \x80 to pad hashes (hlextend and hashpump). But is it necessary to use these bytes? Based on my ...
0
votes
0answers
24 views

Composing hash functions

Suppose there is a cryptographic hash function $H : \{0,1\}^* \to \mathbb G$. Now, we want to define a hash function $H' : \{0,1\}^* \to \mathbb G \times \mathbb G $. My first idea is to define $H'$ ...
3
votes
1answer
71 views

Schnorr signature security level as compared to AES/RSA

As per the Schnorr's original paper (1991), The Security Complexity $2^t$: We wish to choose the parameters $p$, $q$ so that forging a signature or an authentication requires about $2^t$ steps by ...
1
vote
1answer
51 views

Disk encryption using AES-CBC: is reliance on previous block data a downside?

I have seen drives that boast that they use AES with CBC mode, which doesn't really make sense in my opinion, sure it's more secure than ECB (but actually, leaving security aside, ECB is better suited ...
0
votes
2answers
74 views

Brute force knowing a part of the password

So here is the problem, my brother forgot about the eight digit numeric part of his password, he is using Ubuntu 15.04 default whole disk encryption To make it clear, this was his password (example) ...
0
votes
0answers
30 views

Length extension attacks or prefix attacks on HMAC

Why HMACs are not vulnerable to length extension attacks or prefix attacks? (As commented by @codesinchaos, That's a different construction. So it's related, but no duplicate of Why is ...
0
votes
1answer
42 views

PRNG that takes input a $n$-bit string and gives output a $2n$-bit string?

Recently, I'm reading one paper of Boneh and Zhandry. They have mentioned a pseudo random number generator that takes input a $n$-bit string and gives a $2n$-bit string as output. They just used it as ...
3
votes
0answers
33 views

Is an instruction similar to PCLMULQDQ valuable in post quantum key exchange?

This paper describes a Quantum Key Exchange based on the Ring Learning With Errors problem. When used with ECC, there is only a slight performance impact. Assuming this is the popularized approach ...
4
votes
1answer
32 views

Rainbow Table - Number of Chains and Chain Length

Is there a difference between having 10,000 of chains (with 1,000 chain length) and 10,000 chain length (with 1,000 of chains)? How does it affect the success rate of the rainbow table? I understand ...
1
vote
0answers
29 views

Generating cryptographic-quality 1/f noise

Can anyone suggest how I'd generate cryptographic quality 1/f noise: aka 'pink noise', where the PSD follows 1/f. I'd be happy to derive the pink noise from white noise (e.g. /dev/urandom), but I ...
-1
votes
1answer
86 views

RSA encryption with private key, decryption with public key (again)

First of all let me point out that I am aware of all the theory behind asymmetric encryption and signing, and other related areas like signcryption, etc. It seems that mathematically it is possible to ...
5
votes
1answer
88 views

Find collision in Ajtai's hash function using short vector

Background What is Ajtai's hash function? Given a matrix $A \hookleftarrow U(\mathbb{Z}_q^{n \times m})$ and a column vector $\vec{m} \in \mathbb{Z}_d^m$, the hash of the message $\vec{m}$ is given ...
0
votes
1answer
98 views

Large Volumes of Asymmetric Encryption

First of all, I apologize in advance if I use any incorrect terminology. I am just getting my feet wet when it comes to cryptography and there is a lot to learn. For the past 12 months we have been ...
3
votes
2answers
117 views

Cryptography survey as an undergrad

Is cryptography so specialized that taking a survey class is a waste of time? I'm not the type of person who can do logs in my head or has a deep mathematical aptitude, but cryptography is certainly ...
1
vote
2answers
75 views

Block cipher block and key sizes

Is there any point in making block size less than key size in block cipher? For example, Russian GOST symmetric cipher uses 256-bit keys to encrypt 64-bit blocks. That means there are many keys which ...
5
votes
2answers
370 views

Does the SHA-256 sum of a 256-bit key help you crack it?

If I have the SHA-256 sum of a 256-bit AES key, can I determine the key any faster than if I merely had a ciphertext and the corresponding plaintext?
0
votes
0answers
8 views

How AES/GCM deals with data smaller than block size? [migrated]

I am using bouncy castle library for encryption and decryption in c# and I was wondering how to deal with plain text smaller than block size? here is what I have done so far: ...
0
votes
0answers
17 views

Is there a German word for computationally secure? [migrated]

This is mainly intended for German cryptographers and I think since the topic is really specific it's more relevant to ask this here than in a German language section. Cryptography is mainly based ...

15 30 50 per page