2
votes
1answer
34 views

Am I correctly understanding TLS 1.2 PRF (Pseudorandom Function)?

According to RFC 5246 Section 5 PRF(secret, label, seed) = P_<hash>(secret, label + seed) and ...
2
votes
1answer
29 views

First preimage resistance check

So I have $H: \{0,1\}^* \rightarrow\{0,1\}^n$ a hash function resistant to the second preimage and to collisions. Let there be a function $H' : \{0,1\}^* \rightarrow \{0,1\}^{n+1}$ with the following ...
7
votes
2answers
385 views

Does AAD make GCM encryption more secure?

Does AAD make AES GCM encryption more secure? What if we drop AAD in AES-GCM 256? If we drop it, how will it make the encryption less secure?
1
vote
1answer
62 views

Factorization of RSA modulus using a qubic residue

Suppose that someone uses RSA with $n = pq$, exponent $3$, also $3$ divides $\varphi(n) = (p-1)(q-1)$ and $2$ different roots $y$ and $z$ of the equation: $$x \equiv c \ (mod \ n)$$ are known (for ...
3
votes
0answers
28 views

How feasible is a preimage attack or speedups to brute force a substring of MD5?

Beyond the birthday problem analysis how feasible is a preimage attack or speed up brute force on a substring of MD5. For instance let's say from the 128 bits I decide to strip 24 bits, the first four ...
0
votes
0answers
4 views

Meeting people interested in Crypto and Programing [migrated]

I have done some basic Micro controller programming in the past. I am now just starting to learn C++ and plan to move into Java and SQL eventually. I just got done reading one of Simmons books. It was ...
1
vote
1answer
38 views

Why does OpenPGP encryption produce different ciphertexts from the same plain text?

With the same plain text to be encrypted and the same public key, OpenPGP tends to produce a different ciphertext every time I run the encryption operation. Why is this?
3
votes
1answer
40 views

Is there a difference between $\mathbb{Z}_2^b$, $\text{GF}(2^b)$ and $\text{GF}(2)^b$?

I have read a lot about Galois Fields (GF). They are also presented in The Design of Rinjdael on page 13. In computer memory, the polynomials in $F[x]|_l$ with $F$ a finite field can be stored ...
10
votes
1answer
593 views

Qubit / Qutrit - Is there a theoretical limit on how many orthogonal states a quantum bit has?

Seems like a quantum bit with $3$ orthogonal quantum states is called a qutrit - and they have been demonstrated practically. In comparison with $n$ qubits that have ~$2^{n}$ states, these have ~$3^{n}...
1
vote
0answers
33 views

hash function for elliptic curve co-ordinates

Is there any hash function which takes the co-ordinates of an elliptic curve $E_p(a,b)$ as input and gives an integer value i.e. $h(.) : \{(x,y) \in E_p(a,b)\} \rightarrow \mathbb{Z}$
3
votes
1answer
38 views

Different kind of PGP keys or IDs, how to interpret them?

When people say "Here's my PGP key", they tend to come up with all sorts of different stuff. Sometimes they provide an 8-digit hexadecimal number, which seems to be a key ID (although I'm not sure). ...
4
votes
1answer
44 views

Can you decrypt with 1 round key?

If one has the last round key in an SP or Feistel network (the 16th round key in DES for example), would that someone be able to decrypt the rest of the encryption?
1
vote
0answers
23 views

is Authentication tag always appended at last to ciphertext in AES-GCM 256? [duplicate]

I am using AES GCM 256 to encrypt/decrypt a UUID string,We are using java 7 + bouncy castle library for this,We are getting authentication tag of 128 bit ,i am confused ,whether it's position is ...
6
votes
1answer
954 views

how to prove our algorithm is secure against chosen plaintext attack?

I am working on a topic in cryptography where I have tried to develop an encryption scheme. How could I prove mathematically that my algorithm is secure against chosen plaintext attacks?. Will it ...
1
vote
1answer
34 views

Security Strength of Double Substitution Ciphers

I am wondering why people are using RSA keys when some types of double substitution ciphers seem to be just as secure if not better off. By some types of double substitution ciphers I mean one Which ...
2
votes
1answer
60 views

Why is it that most messages seem to be expanded?

Whenever I have seen a more secure version of a message, the message seems to be expanded by some factor. One example is RSA encryption, but whenever a message does not appear to be expanded it is ...
3
votes
1answer
59 views

Is predictable ciphertext/plaintext bad?

I have a cryptosystem that I'm using for secure chat. It is using AES 256 (with RSA 2048 for key exchange). Would a predictable, and repetitively sent ciphertext plaintext compromise the ...
0
votes
0answers
87 views

Example of Software Security (White Box Cryptography) is not strong as Hardware Security?

I have been reading about White Box Cryptography in the last 2-3 days but I was wondering what are the example of White Box Cryptograhy that are quickly broken by Cracker / Hacker? Would the fact ...
4
votes
0answers
47 views

On a proposition in NTRU original paper: $\gamma_1 |f|_2 |g|_2 \leq |f \circledast g|_\infty \leq \gamma_2 |f|_2 |g|_2$

In the original paper of NTRU cryptosystem, we have the following proposition (that is said to be suggested by Don Coppersmith): For any $\epsilon > 0$, there are constants $\gamma_1,\gamma_2 &...
0
votes
1answer
26 views

El Gamal existential forgery using Pointcheval–Stern signature algorithm

I found that there exists an algorithm that claims to make the El Gamal signature generation more secure. The algorithm can be found here as a pdf. I'm mainly interested in the two-parameter forgery ...
0
votes
0answers
42 views

Can a neural network be trained to simulate a cipher?

I believe there are two problems with this in practice: Choosing the components of the network in such a way as to allow them to simulate the operation of the circuitry of the cipher. These ...
3
votes
0answers
45 views

Calculating probability of finding collisions in an invertible hash function

Assuming we have an invertible hash function H that takes inputs of size 2n and outputs hashes of size n, I use the following algorithm to find collisions: Choose a random M as input. Compute its ...
4
votes
1answer
65 views

Number of Sbox in a Cipher

Camellia has 4 SBOX and so does the TwoFish(key dependent 4 Sboxes). Where as AES uses only one. Would it have made AES more secure if AES had 4 or more SBOX too? Does using more Sbox with similar ...
1
vote
1answer
32 views

Camellia Key Schedule

Camellia is a widely used International standard now. Its Key Schedule seems to be too simple as compared other famous Ciphers like Twofish and CAST-256. What are the per-requisites for the key-...
4
votes
0answers
56 views

Numeric base conversion in cryptosystems?

I have been wondering if numeric base conversion has ever found an application in cryptography. By base conversion, an example that is probably familiar is Base64 encoding. This is an example of ...
1
vote
1answer
39 views

Why Rabin fingerprints assumes data is prefixed with a “1” bit?

(I know that a Rabin fingerprint is not a cryptographic hash, sorry in advance if my question is considered out of topic) In the paper Some applications of Rabin's fingerprinting method, it is ...
0
votes
0answers
15 views

Is normal to take wrong values of the polynomial for given x while applying Horner's rule

I want to evaluate the polynomial $a_0+a_1x+a_2x^2+...a_nx^n$ using Horner's evaluation due to i want to speed up my performance of application written in Java. The problem is that sometimes it gives ...
0
votes
1answer
17 views

How many field operations are needed when you compute kG in elliptic curves with a multiple additions or the double-ans-add-algorithm?

For an assignment, we have to calculate how many field computations are needed to calculate kG in an elliptic curve. They want us to show this for two different ways of calculating kG. The first way: ...
3
votes
1answer
74 views

Combining secure hashes with insecure hashes?

Assuming I'm a bank which seeks for secure hash functions to use in the process of signing on digital contents. I'd like to explain / prove why using each one of the following hash functions might ...
0
votes
0answers
19 views

How to generate an El Gamal signature without knowing the private key x?

Let $x$ be the private key. Let $k$ be a random generated number $< p-1$, with $p$ the large prime. Let $g$ be the generator of $p$ the large prime. Let $r$ be the equality $r=g^k$ Let $m_e$ be an ...
0
votes
0answers
37 views

Message length for aes 256 in ctr, ecb and cbc mode

I want to encrypt a message that have values between 0 and 50. So message have maxim 1 byte. Is possible to encrypt with aes256 in ctr, ecb and cbc mode, messages from 1 byte, not necessary 32 bytes? ...
0
votes
1answer
23 views

X509 Cert exploit CA check

Assumptions Let's theoretically assume that a browser skips the check that a certificate it receives belongs to the stated CA (that's an exercise). How could I exploit this in order to impersonate ...
3
votes
1answer
64 views

Insecure third party connection

My organization processes some PII data and shares it with an outbound connection (outflow only) that is a third party. The data transfer transactions occur without human intervention. That outbound ...
4
votes
0answers
42 views

How to forge signatures in the Schnorr scheme if $r=g^k$ is eliminated?

I need some help to demonstrate how to forge signatures in the Schnorr scheme if I eliminate the random string $r=g^k$ used in the hash – using $H(M)$ instead of $H(M||r)$. How would one be able to ...
1
vote
0answers
39 views

Issue Factorization Quadratic Sieve

Good evening, I'm about to write my own quadratic sieve implementation in C using GMP library for large numbers. I'm facing an issue while attempting to do the last factorization step for the number: ...
0
votes
1answer
18 views

Digital signature with collision

Let's assume a digital signature scheme such that there's a probability of 0.2 for two random messages to have the same signature. How can I exploit this sheme? I'm having difficulties in finding an ...
2
votes
0answers
8 views

How to decrypt SSL data on a considered-to-be-compromised host? [closed]

I have a package which I want to encrypt on my machine and send it to another remote machine. If I use asymmetric encryption, I must have the private key on the remote side. However, I don't trust the ...
0
votes
1answer
54 views

Why is it better to have the private key as the multiplicative inverse mod phi(n) in RSA?

I'm studying the RSA algorithm and the theory says to select $d$ to be the multiplicative inverse of. $$ e \mod \phi(n) $$ If we take this approach I know that it is important that $e$ and $\phi(...
3
votes
2answers
67 views

Chosen-Message-Attack RSA-Signature

I know that because of the multplicative property of RSA $s =(s_1s_2) \bmod n = (m_1m_2)^d \bmod n$ If Oscar wants to sign now an own message $m$ he chooses another message $m_1$ with $\gcd(m_1,n)=...
1
vote
1answer
48 views

How to brute force sqlcipher encrypted file with MD5 hash of a 7 bit key?

I have a database file that is encrypted using sqlcipher and MD5 hash. Sqlcipher to my understanding provides 256 bit AES encryption. The key is 7 bits long. How do I brute force it?
-3
votes
1answer
44 views

Is SHA-256 safe and difficult to crack? [duplicate]

I am trying to crack a SHA-256 hash but I am not sure how to approach this in an efficient way. The following is known of the original non-hashed content: 64 characters long only consists 0-9 and a-...
0
votes
1answer
18 views

Is it possible to extract the decryption key from a locked android device

Is it possible to extract the decryption key from a FDE android device while the screen is locked but the phone is powered on. Is the data only safe when the phone is off ?
3
votes
1answer
48 views

El Gamal special construction

The algorithm: I have to determine if the following algorithm is secure: $p,q \in \mathbb{P}$ and $N = p \cdot q$ $e \in [2, N - 1]$ such that $\gcd(e, N) = 1$ $r_1, r_2$ are random numbers ...
0
votes
1answer
44 views

If I encrypt data with two different ECC Private keys, how secure is the result?

I'm wondering whether encrypting data with two different 256-bit ECC keys will result in a more secure encryption (minimum 384 bit equivalent) or will result in data that's effectively encrypted with ...
3
votes
1answer
35 views

Not-So-Simple Substitution Cipher?

The first go-to weakness when talking about substitution ciphers is frequency analysis. It assumes that there's a simple 1 to 1 character mapping between the plain text and the cipher text. Could a ...
0
votes
0answers
6 views

Key Management - general question [migrated]

I have a little question regarding the wonderful topic of "Key Management". Let's imagine I would use a service like AWS Key Management. According to their API documentation one can easily decrypt a ...
2
votes
1answer
72 views

Exponential cipher theory misunderstanding

Say I pick modulus $m=2633$ and key $e=13$ My private key $d$ is $13$ inverse in $\bmod 2632$ which I need to compute $(e,m)$ is my public key that anyone can use to encrypt message for me and then ...
2
votes
0answers
28 views

How to determine how good our generator of random numbers is [duplicate]

I am using SecureRandom class in java with default constructor and after i run it four times and each times i will take back 4 "supposed highly secured random numbers" . First run : -35 -43 -127 12 ...
1
vote
1answer
25 views

Size of Pre-Master Secret?

I am implementing TLS 1.2 and using cipher ECDHE_RSA_WITH_AES_128_GCM_SHA256 According to RFC 5346 Section 8.1 length of premaster secret will vary depending on key exchange method. So, what is the ...
2
votes
3answers
55 views

Why the exponent is a power of 2 in Ring-LWE?

I was reading some papers on Ring-LWE. I found almost all of them talk to choose the polynomial modulo $x^n+1$ where $n$ is a power of $2$. I did not understand why this condition is necessary?

15 30 50 per page