4
votes
3answers
355 views

Can an ephemeral RSA key give forward secrecy?

Suppose party A generates an ephemeral RSA key and sends the public key to B. Party B then generates a symmetric key, encrypts it with Party A's public key and sends the Ciphertext to Party A. Party ...
3
votes
1answer
125 views

Avalanche effect sample size

With a fixed key size – key has 128 bits, while block size is 8 byte – how do I calculate how many different keys and texts I have to test for an cryptanalytic statistics study? Differently worded: ...
2
votes
1answer
93 views

Are there full cycle cryptographic/one-way hash primitives?

I'm looking for behavior similiar to that of LCGs, (i.e. input and output sizes are same). Full cycle of $2^{32}$ different inputs generates full cycle of $2^{32}$ different outputs, distribution of ...
1
vote
1answer
67 views

Inverting One-Way Functions

One of the conditions that a one-way function has to satisfy is the following: $$Pr[A(f(x))\in f^{-1}(f(x))] \leq negl(n)$$ Now, suppose that we have the following function that's not one way: ...
1
vote
1answer
73 views

Encrypt hash using hash of hash?

I wonder what is wrong with this scheme for authentication. Server sends random challenge, C Client returns (C, B(P)) encrypted in H(B(P)) where B(P) is high work factor salted hash of the user ...
2
votes
1answer
54 views

What is the notion of an interactive assumption?

In this paper: Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies the authors sell the paper as the first who propose Aggregate signatures without ...
0
votes
1answer
57 views

PKCS5 having no padding

I am using the javax.crypto.Cipher in Java to do AES/CBC/PKCS5Padding encryption. What I am observing is that, if you try to encrypt a Plaintext with no padding, PKCS5 adds another entire block just ...
7
votes
3answers
309 views

How to protect key in software

I need to encrypt/decrypt data from my software by AES, the problem is how to make the AES key secure, there is no HSM, should I hard code the key in my code? It seems that a hacker can read the key ...
2
votes
1answer
77 views

Secret only known on consensus

Does a method exist where a secret is generated so that is is unknown until 3 or more people (predetermined) reach consensus that it should be revealed?
4
votes
1answer
70 views

Is there a cryptographic protocol that let's me prove someone has a large binary?

I'm working on a system that has a P2P component. When an individual downloads a binary and decides to mirror it, they advertise themselves in a providers set. The binaries can range from 1-1000MB. I ...
2
votes
2answers
111 views

Inverting RSA function

I am in high school and I am writing a paper on RSA. I want to show that low values of the public key exponent can make it easy to 'invert' the function so that the encrypted message can be recovered. ...
2
votes
0answers
47 views

Construct points with the same discrete logarithm

Assume we have an elliptic curve $E$ with a Tate (or Ate,...) pairing $G_1 \times G_2 \mapsto G_T$ Now the task is to find $g_1, g_1' \in G_1$ and $g_2, g_2' \in G_2$ such that the discrete logarithm ...
1
vote
2answers
107 views

How does perfect hash function works?

According to wikipedia, a perfect hash function is a hash function that uses algorithms that has a certain random aspect to their logic. It is suppose to be collision-free. However due to the pigeon ...
1
vote
1answer
73 views

The example of Wikipedia on steganography doesn't work

I was reading some stuff on steganography. There is an example on the wikipedia page : However, I tried many software to get the hidden image, but no one worked. Is there anything wrong about ...
4
votes
1answer
79 views

Creating own ciphertext after a padding oracle attack?

I've written a script that breaks a cipher text based on a padding oracle for an assignment, but was wondering how I would continue on to create my own cipher text with any plain text I desired? ...
1
vote
1answer
98 views

Hypothetical encryption technique, is it secure?

This to me, sounds like a great idea, but with all rosy-tinted ideas it needs some grounding in reality. Here are the steps of the hypothetical system (with the hypothetical part highlighted): User ...
1
vote
2answers
112 views

Is it worth hiding an AES encrypted text string in a PNG image for better security?

I need advice as to whether it is worth the extra "security" and processing of an AES encrypted text string to be hidden in a PNG image as opposed to an AES encrypted text string to be saved in a ...
3
votes
1answer
44 views

X509 certificates: Two Algorithm Identifiers?

I'm wondering why there are two Algorithm Identifiers in a X509 certificate. One is in the "to be signed" part and the other one is at the end right before the actual signature. Are they used for the ...
37
votes
1answer
3k views

What is a “freestart collision”?

In their work on SHA-1 collisions (cf. the currently unpublished paper “Freestart collision on full SHA-1” by Stevens, Karpman, and Peyrin) Stevens et al show that they are able to generate "freestart ...
1
vote
1answer
55 views

For hardware encryptions, is it possible to know the key by analysing the hardware?

For example, Square reader uses hardware encryptions when swiping credit cards. Is it possible to know the key that is used by the hardware encryption cipher by analysing the hardware circuitries? ...
0
votes
1answer
236 views

Computing the padding of MD5

So I'm reading this question to learn more about length extension attack, and I want to make sure I understand the basics of padding. It says in the post that given the hash and the length of the ...
1
vote
1answer
54 views

Hash functions vs. keyed hash functions in the context of private key generation

I'm designing a key distribution mechanism and have thought of using a securely generated/acquired private key as a seed for a sequence of private keys to be distributed to a number of users using a ...
2
votes
1answer
132 views

Wanted: Simple ring signature example

I spent all day trying to figure ring signature schemes out but apparently I wasted time. I read the original ring signature paper (Rivest's How to leak a secret). I'm having numerous problems. Let's ...
1
vote
1answer
36 views

For the scrypt HMAC storage format, why run the input of the hash and the hash itself into the HMAC

Generally if the body is hashed, why provide the body and the hash as input into the HMAC. Instead wouldn't the same security be achieved by hashing the body and providing only the hash as input into ...
1
vote
1answer
39 views

Security of SRP-6a against impersonating server choosing small/wrong N

I'm looking at an implementation of SRP (Secure Remote Password) that essentially follows the Stanford documentation (http://srp.stanford.edu/design.html). I'm worried about one aspect though: In the ...
0
votes
0answers
65 views

How to derive a key from an existing AES key?

Currently, the code I am staring at uses the CKM_EXTRACT_KEY_FROM_KEY mechanism. That has been disabled in our hardware module, so I need a different mechanism to ...
0
votes
2answers
156 views

How to show something is not a one-way function?

Lets say that $f:\{0,1\}^* \to \{0,1\}^*$ is a strong one way function. Let $h(x)=f(x)||x_n$ where $x_n$ is the $n$th bit of $x$. I understand that $h$ will not be a strong one-way function. However, ...
1
vote
0answers
56 views

Binary equation with encryption

I'm trying to test the ring signature scheme proposed by Rivest Shamir and Tauman in the famous paper "How to leak a secret". One of the step consist in 4) the signer solves the following ring ...
2
votes
2answers
69 views

Profile Complexity LFSR

I try to understand how Complexity of an LSFR calculated. For example I have a bit sequence 110101 and it's profile 1 1 2 2 3 3. Is there any easy way in order to produce the profile?
0
votes
0answers
68 views

MD5 SSL Collision Attack

I want to create fake certificate for test purposes. I have read about the http://marc-stevens.nl/p/hashclash/index.php project but I am unable to understand the two files that I have to put as input ...
0
votes
0answers
59 views

special class of lattices in lattice based cryptography

A special case of lattices in lattice cryptography is that of q-ary lattices. A q-ary lattice L is defined as that in which any vector which consists of multiples of some scalar q is in ...
3
votes
0answers
126 views

Are there MD5 collisions for inputs of different length?

There are many examples of MD5 collisions (some of them can be found here Are there two known strings which have the same MD5 hash value?). But as far as I know two inputs should have the same length ...
0
votes
1answer
218 views

Is there a correct way to generate a symmetric key?

Looking in some cryptographic algorithms, I've realized that: The way the plain text is encrypted/decrypted is always specified, but what about the key? Every paper I've seen describing the algorithm ...
1
vote
0answers
159 views

Best way to implement secure client/server communication in Python

For a college programming assignment I have to implement a secure communication protocol between a server and one or more clients. Upon instantiation of the server program, a file is generated, call ...
1
vote
2answers
184 views

Is my protocol that uses hybrid cryptography and AES-GCM secure?

I'm having a lot of trouble trying to understand how to implement AES-GCM. My usecase: Person A sent me a file with a gauranteed unique name. I want to be assured it was from person A, and that no ...
3
votes
2answers
129 views

How to find the value of a vector modulo a basis in lattice-based cryptography

In Gentry's paper on fully homomorphic encryption using ideal lattices, he finds the values of vectors modulo a certain basis. For instance: $\psi \leftarrow \psi' \mod B$ Taken from page 69 of ...
4
votes
1answer
180 views

How have MD5 constants been determined?

For instance, the per round shift amounts, ...
1
vote
0answers
42 views

ABE Attributes Based Encryption

I have a question . How the system know the attributes of the users to be after that as a public key in ABE?
1
vote
1answer
176 views

SHA-256 “almost unique”?

I have seen numerous references on the internet of people describing SHA-256 as generating an "almost unique" hash. Exhibit A. there are more. Is there some mathematical basis to the almost ...
5
votes
0answers
226 views

How to break a columnar transposition cipher?

I'm currently studying for a cryptography exam. I've been given ciphertext that has been encrypted by a columnar transposition cipher. I've been given no shift key length or key word, the only thing I ...
4
votes
2answers
87 views

Probabalistic Polynomial-time Algorithms & One-way functions

I've been reading up on probabilistic polynomial-time algorithms and one-way functions, and I was hoping to get some guidance on the topic. A textbook I'm reading states the following for one of the ...
0
votes
0answers
22 views

Prove that complement of plaintext and the key, then ciphertext will be the complement of orig. ciphertext [duplicate]

I'm trying to prove in general terms the following: y = DESk(x) then.. y' = DESk'(x') I can plug in random variables for ...
1
vote
0answers
130 views

Weird base64-like (?) encoding [closed]

I have some encoded strings which are probably encoded in a base64-variant - except that there aren't only 64 chars, but all the (printable) ASCII chars between 33 and 126 (0x21 to 0x7E). I've ...
0
votes
1answer
235 views

Calculating the average key search time of DES

I am trying to understand how to calculate the average key search time given a specific scenario: Suppose we have a program that uses standard DES with 56 key bits, and we can test 10^6 keys per ...
0
votes
0answers
39 views

Indistinguishability through a chosen plaintext attack

I have a question about how to go about doing an IND-CPA style attack. I'm supposed to think of this as two black boxes, where I do not know which box contains which function. What would I do with the ...
1
vote
0answers
18 views

Understanding CPA and CCA Secure [duplicate]

CPA attack means the attacker can send in his own plaintext to the oracle and receives some sort of ciphertext back. CCA attack means the attacker can send in his own ciphertext to the oracle and ...
0
votes
1answer
105 views

Performance of Fully homomorphic encryption VS Paillier encryption in Practice

Consider two schemes both have computation complexity linear to the input size (i.e. number of inputs). One scheme is based on Paillier encryption and the other one is based on fully homomorphic ...
3
votes
2answers
948 views

Generating unbiased numbers with a biased six sided die?

Eve takes a fair six-sided die and adds some heavy paint to the side of the die with the 6 on it. This results in a biased die that rolls a 6 with probability 2/7, and each other number (1-5) with ...
0
votes
1answer
43 views

What does CA certs contains? public key of site or CA?

I believe it contains public key but whose? the site like a bank or the certificate authority who has signed?
3
votes
2answers
111 views

Is it safe to initialize secret keys by just reading /dev/random on Linux?

For a software, I don't want the user to choose weak keys, so I plan to just read the needed number of bytes from /dev/random to create the needed secret keys. Is it safe to do so?

15 30 50 per page