1
vote
1answer
48 views

ChaCha20 core vs ideal unkeyed PRP

I know that the ChaCha20 core (without the initial constant) is not an ideal PRP and must not be used as such. I also know that $\text{ChaChaCore}(0) = 0$. Are there any other differences?
2
votes
1answer
60 views

What is the most common encoding of messages to polynomials?

How polynomial based encryption schemes such as NTRU encode messages in to polynomials? Is there a generic conversion?
4
votes
1answer
67 views

Small subgroup attack on Diffie-Hellman key exchange

Alice and Bob are using DHKE in the group $\mathbb{Z}_p^ * $, where $p = 1031 = 2 \cdot 5 \cdot 103 + 1$. Their generator $g = 2$, which generates a multiplicative group of order $515$ in $\mathbb{Z}_{...
1
vote
2answers
76 views

Role of Fermat's little theorem in the proof of correctness of ElGamal signature

In the Wikipedia article about the ElGamal signature scheme it is written, that Fermat's little theorem is used in the following proof of correctness: From the signature generation in ElGamal we can ...
4
votes
3answers
209 views

Can the SHA256 hashes of consecutive integers be attacked?

Suppose that the attacker knows the SHA256 values of integers $n, n+1, n+2 ... n+k$. $n$ is sufficiently big, so we do not expect to be able to brute force $n$ just by $\operatorname{SHA256}(n)$ ...
1
vote
1answer
99 views

Given the first half of a SHA-1 hash, can you predict the second half?

I know this applies to secure ciphers, but does this also apply to hashes?
4
votes
1answer
96 views

Exposed raw RSA private key operation

Assume that there is a smartcard or other hardware token that exposes the raw RSA private key operation (modular exponentiation, with or without CRT parameters). Is there any possibility that raw RSA ...
1
vote
1answer
126 views

What is the difference between discrete logarithm and logarithm? [closed]

Why discrete logarithm? Is discrete logarithm is part of logarithm? I do not understand the difference between these two concepts.
1
vote
0answers
39 views

Parallel hashing function that always gives the same hash despite a variable number of cpus

The title pretty much sums it up :) I'm looking for a hashing algorithm that does not need to be cryptographically secure beyond reducing the number of accidental collisions. There is no need to ...
0
votes
1answer
32 views

Aggregation signature and verification

I'm not even sure of the appropriate terminology to use to describe my problem so bear with me if the explanation is not exactly formal. Imagine I have a simple digital calculator, with a screen and ...
1
vote
1answer
23 views

Question about entity authentication

Say party A wants to make sure they are communicating with party B, and not an eavesdropper E. Then they will use an authentication scheme to do this. But what if there is an eavesdropper on the line,...
5
votes
0answers
107 views

Homomorphic system that allows Hamming distance computation?

How can I work out Hamming distance between two binary vectors securely? I would like to know how I can apply homomorphic techniques here.
0
votes
1answer
32 views

Are chosen-prefix collisions for SHA-1 a major threat?

GPG signing of Git commit tags relies on the collision resistance of SHA-1, which is weak. However, the attacker does not get to choose the prefix. How much does this translate to an actual ...
-2
votes
1answer
30 views

SHA encyption (help me) [closed]

OK, so I am a real noob at cryptography stuff and I have a set of files. One is a string that I am trying to decrypt, and the other has this SHA: 4534e95cb5f001719a6119a092459dc826965d60 Can I use ...
2
votes
0answers
32 views

RC6-like key schedule with 16-bit S-boxes

I am trying to figure out an encryption algorithm whose key schedule function seems to be similar to RC6. However, it seems to be creating S-Boxes using 16-bit integers instead of 32-bit ones. I have ...
8
votes
3answers
180 views

The internals of bcrypt

I'm attempting to get a better understanding of cryptography and have run into some questions about bcrypt. Bcrypt relies on the blowfish cipher, which is a reversible method of encryption. But ...
1
vote
1answer
154 views

Public-key based on roots of polynomial

In general it's hard to calculate the roots of a given polynomial $P(x)$. But the other way back calculating the coefficients is much easier (Vieta's formulas). If this is a one-way function, is it ...
3
votes
1answer
80 views

Is RSA encryption without padding secure with NIST Key Establishment schemes?

NIST SP800-56B standard (addressing IFC-based Key Establishment schemes) defines some key establishment (KE) schemes using the RSASVE primitive in which the common secret $Z$ is encrypted with RSA-EP ...
0
votes
1answer
43 views

dealing with real numbers in Integer Vector Homomorphic Encryption lib

I am using Integer Vector Homomorphic Encryption for the encryption lib. I have to multiply a learning rate of 0.01 (i.e. between 0 and 1) by the encrypted data (vector) but it is not integer. I had ...
2
votes
1answer
154 views

Is F' a pseudorandom function when F is composed with G, a pseudorandom generator?

If $F$ is a pseudorandom function, is $F'$ also a pseudorandom function in the following: $$ F'_k(x)=F_k(G(x)) \space \space \text, $$ where $G$ is $a$ pseudorandom generator? Also, does the other ...
0
votes
1answer
69 views

Unicity-distance of Playfair

Given the classical scheme Playfair, say, for 5*5 matrices, I am interested to determine its unicity-distance. How should one proceed to properly do that? I should appreciate it, if I could obtain a ...
3
votes
1answer
41 views

The solution of insert MAC in a ciphertext without Authenticated Encryption supported

From Should we MAC-then-encrypt or encrypt-then-MAC?, I understand I should do Encrypt-than-MAC, which the MAC included all the information such as IV and cipher text. After reading Why choose an ...
30
votes
2answers
13k views

What is the main difference between a key, an IV and a nonce?

What are the main differences between a nonce, a key and an IV? Without any doubt the key should be kept secret. But what about the nonce and the IV? What's the main difference between them and their ...
0
votes
1answer
44 views

Proper authenticated encryption

I am using AES-CBC, authenticating using HMAC-SHA512 and I was wondering whether my thought process and implementation are correct. The message send over the network is: HMAC(64Bytes),IV(16Bytes),...
3
votes
0answers
93 views

Unlinkability of Merkle-Damgård hash function results

Question: Are multiple outputs of a Merkle-Damgård hash function (or specifically SHA-256, if this can only be said for a specific algorithm) on unknown data unlinkable? If yes: Can this be formally ...
6
votes
5answers
3k views

Is a book cipher provably secure?

I've seen ciphers (usually in spy drama shows) that involve taking a book and writing down an index to individual characters. Essentially it's a keyed substitution cipher, where the key is the name ...
1
vote
1answer
31 views

Is there an avalanche effect using block cipher modes of operation?

I am studying cryptography and various block cipher modes of operation. Suppose I changed one bit in the last block of the message. Wouldn't that imply no change in all encrypted blocks except for ...
0
votes
0answers
38 views

ECIES is must with Symmetric?(ECIES-AES or ECIES-TDES)

I can't understand the ECIES algorithm. I saw two different ECIES algorithms: Using only Public key Key generation: $A_{pri} : n_A$ $A_{pub} : n_A G$ $B_{pri} : n_B$ $B_{pub} : n_B G$ ...
3
votes
1answer
73 views

Reversing a hash of known hashing algorithm

I am sure this is a very easy thing to do but I am not sure how to go about solving a problem like this, So there is this hash function which operates on a message which is in the form of a byte array ...
1
vote
0answers
32 views

TLS padding format

My question is about how the padding is formated in TLS1.0, 1.1, 1.2, 1.3 I came across the PKCS7 format for the padding: ...
0
votes
0answers
39 views

autocorrelation and entropy of historical ciphers

I'm learning cryptography and come across historical ciphers such as vigenere cipher,hill cipher,random substitution and etc.I'm using cryptool for learning purposes and I have a question in mind.I've ...
0
votes
2answers
105 views

Can two files/strings have the same SHA-256 value?

I was wondering whether, theoretically, 2 files can have the same SHA-256 value. Since there are only $16^{256}$ or $2^{1024}$ SHA256 sums, all 1024-bit files (with $2^{1024}$ different combinations) ...
4
votes
2answers
186 views

Should I use a self-designed Block Cipher Mode of Operation?

We all know we should NOT roll our self-designed encryption algorithm, how about block cipher mode with a certificated cipher method like AES? Will a self-designed block cipher mode cause any flaws or ...
1
vote
1answer
19 views

Will changing the RSA Padding in OpenSSL cause issues?

I'm currently looking at changing the padding type from one of the Oracle Padding attacks to a secure one. Would this break data already encrypted using the old method?
0
votes
0answers
9 views

calculating n-gram lists and spaces in ciphertext

I'm doing an analysis on a block of ciphertext message with 27 characters(including spaces).Now do the spaces need to be taken into account when performing the digram and trigram analysis?because the ...
7
votes
3answers
335 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 ...
0
votes
1answer
32 views

Randomize (encrypted) data to hide the behaviour of the data source

I'd like to transmit a small amount of data, typ. 4 - 16 Byte through a channel that can be eavesdropped at any time. The behaviour, the way the data changes, should be protected too. I could ...
0
votes
1answer
41 views

Security of Diffie Hellman in specific cyclic group

For some $k$, let's say $p = 1+ \prod_{j=1}^k q( j)$, where $q(1)=2$, $q(2)=3$, if $p$ is prime, the diffie-hellman key exchange is not secure in cyclic group $Z^*_p$. Why?
0
votes
0answers
42 views

If I send a signed email, how does the end user get the public key?

I am sending a signed email using Python and smtplib. I have successfully signed the email using this example: http://proj.badc.rl.ac.uk/svn/ndg-security/branches/Dependencies/m2crypto/doc/howto.smime....
3
votes
1answer
87 views

Combining public key signature schemes and private key encryption

I'm working on my bachelor thesis and I have some questions. I want to combine a CPA-secure private key encryption scheme and some unforgeable public key signature scheme (in my case some sanitizable ...
6
votes
2answers
297 views

Do public/private pairs work both ways?

Public/private key algorithms such as RSA encrypt a message with a private key but only decrypted with another (mathematically related) key. Can the public key decrypt the messages encrypted with ...
3
votes
1answer
130 views

Image sharing without data overhead

The idea is to share $n$ images among $n$ persons so that all images can be reconstructed by someone in possession of all shares. However, there must not be any data overhead (which means the shares ...
0
votes
0answers
27 views

how MitM compute server secret number in logjam

I would like to know how man in the middle can compute the server secret number if the prime is 512 bit in length and if knowing ($g$) parameter as in the following figure help him or not? is the man ...
4
votes
1answer
95 views

Changing encryption key without revealing the original key

Say that Alice encrypts a $\text{plaintext}$ with $\text{key}_{m}$ and gives the $\text{ciphertext}_m$ to Bob. Alice wants to send several gigabytes of $\text{plaintext}$ to Eve but she is on a mobile ...
3
votes
2answers
40 views

Which compound algorithms would weaken cipher, not strengthen it?

OK, in school, some of the lecturers always say "if you compound the crypto, it may make the cipher weaker". So, which combinations of algorithms would do this? Why? Can anyone show the mathematical ...
0
votes
1answer
35 views

A simple keyed message authentication code using XOR

Suppose I have a key that is at least 32 characters in length and provides at least 128-bits of entropy. If I picked from the character set of [a-hjkmnp-z2-9-], ...
3
votes
2answers
410 views

Why can the last block contain a full block of padding in CBC Encryption?

I'm trying to understand the SSL Poodle Attack and I'm wondering why the last block of a CBC Record can be full of padding? Wouldn't that mean that the useful data was already a multiple of the key ...
0
votes
0answers
30 views

Recryption of ciphertext with a different key

Let's have $P$ some sensitive piece of data and $K_1$a secret value, both known to Alice, but not to Bob. $K_1(P)$ means $P$ encrypted using $K_1$. Alice sends $K_1(P)$ to Bob. Bob keeps the value of ...
5
votes
2answers
114 views

Signing MD5 hashes with RSA? [duplicate]

Lets say I need to update a project and allow anyone to distribute the updates, however I need it to be secure, so I hash the data and sign the hash, this project uses MD5. How likely would it be ...
0
votes
0answers
57 views

Encoding issue - PKCS#11 CKM_RSA_PKCS wrapping unwrapping EME-PKCS1-v1_5

I am trying to figure out why I am not able to get compatible format of EME-PKCS1-v1_5 3DES key encrypted by public RSA key. I need to send to a third party 3DES key encrypted using their public RSA ...

15 30 50 per page