3
votes
0answers
74 views

How does the ring settings of enigma change wiring tables?

EDIT: The model I'm trying to make is "Enigma 1". I learned initially about it from a book called "Code Book" and then looked at it in detail from its wikipedia page. The site wont allow me too add ...
2
votes
2answers
73 views

Using related pair of cryptographic keys to open/seal plaintext

I am using curve25519xsalsa20poly1305/fn.seal from sodiumoxide crate written in Rust language which is a wrapper over libsodium ...
3
votes
1answer
71 views

How do I tack on “additional data” to libsodium's public-key authenticated encryption?

I note that libsodium provides AEAD when using symmetric cryptography. And yet, under section 8 (Public-key cryptography) there are no public-key methods described which allow for additional data ...
1
vote
0answers
34 views

If I know the hash function that produced a hash key, how easily can I generate an input to hash to the same key? [duplicate]

The title is pretty descriptive of my question. As an example, say I use the MD5 hash function to create a hash key of the word "hello": 5d41402abc4b2a76b9719d911017c592. There are two questions I ...
0
votes
0answers
32 views

What do we need to know in terms of plaintext/ciphertext, and how can we decrypt all ciphertext? [duplicate]

Let's say we have a cipher stream that we know has a period of 150-200bit in length. We don't know anything else about the stream cipher. If we wanted to decrypt all cipher text, what else do we ...
2
votes
1answer
152 views

Forward-secure static-ephemeral ECDH key agreement protocol

The question is whether the following simple key agreement protocol design has good security properties, and how it can or should be improved. Assumptions Alice is a persistent entity with a static ...
3
votes
1answer
87 views

How to understand RSA Proofs of correctness at Wikipedia

From Wikipedia(https://en.wikipedia.org/wiki/RSA_%28cryptosystem%29#Proofs_of_correctness): $m^{ed}$ ≡ $m$ $\pmod{q}$ $m^{ed}$ ≡ $m$ $\pmod{p}$ then $m^{ed}$ ≡ $m$ $\pmod{pq}$ Question: if $m^{ed}$ ...
2
votes
2answers
214 views

Authenticating code securely and generating a certificate

I'm working on a product with strong security. Essentially there is an App, downloaded from the iTunes App Store. When the App starts up, it generates a strong RSA keypair and stores it in the ...
0
votes
0answers
57 views

Zero-Knowledge Proof of Subgraph Isomorphism

I'm trying to find a Zero-Knowledge proof of subgraph isomorphism in the following scenario: Alice and Bob both know about graphs G1 and ...
2
votes
0answers
24 views

Quantitatively measure the private information revealed by a matrix?

Suppose I have a private matrix $A$ that I want to conceal. I do the matrix multiplication $A^\prime =AK$ and $A^\prime$ is public. How can I quantitatively measure "how well" the matrix $A$ is ...
1
vote
2answers
72 views

AES S-Box Affine Mapping - how to do it?

For the byte substitution layer in AES how do we determine B(i)? I follow how to use the multiplicative inverse table and using that to get B`(i), but how do I actually calculate the affine mapping? ...
0
votes
0answers
55 views

Quantum circuit to implement McEliece cryptosystem

I've come up with the proposal of implementing McEliece cryptosystem with the help of quantum gates and quantum programming, creating a circuit to do the encryption based on the McEliece original ...
5
votes
1answer
280 views

Is ChaCha20 alone sufficient for securing data-at-rest?

I wonder if ChaCha20 alone is sufficient for securing files stored on a disk or should Poly1305 should be used along with it? AFAIK, Poly1305 is used to secure the authentication channel, but for ...
4
votes
2answers
120 views

Challenge-Response Phases in IND-CPA

The IND-CPA game has two challenge-response phases A key is generated by running $Gen(1^n)$ and challenger selects a bit b {0,1} uniformly at random. Adversary gets input $1^n$. Can query the oracle ...
2
votes
0answers
39 views

Are the values of Tate and Ate pairing the same?

Assume we have a Baretto Naehrig curve over $GF(p)$ and a field extension $GF(p^{12})$ given by a minimum polynomial. Let $G \in GF(p)$ and $Q \in GF(p^{12})$ from the trace 0 subgroup. Do then the ...
1
vote
0answers
21 views

LFSR, different bits from different initial states

Suppose we useLFSR, which gives output $x_1x_2x_3\dots$ from some particular initial state. From another state, different from previous, same LSFR though, it gives sequence $y_1y_2y_3\dots$ ...
1
vote
1answer
35 views

Do random oracles are called even by honest users in the PAK protocol [BMK00]?

In the full-length proof of PAK scheme, the authors made extensive use of random oracles to extract (guessed) password from the messages generated by the real world adversary for the ideal world ...
6
votes
2answers
261 views

Maximum steganographic embedding rate not detectable by steganalysis?

When using advanced steganographic methods (like F5) what is the approximate maximum embedding rate when advanced Steganalysis (like a machine learning approach) can no longer reliably detect it? I ...
1
vote
3answers
189 views

Why can't we use a hash with no collision to compress data reliably?

According to wikipedia, a hash maps digital data of arbitrary size to digital data of fixed size. For all practical measures, a hash is a unique signature of a big chunk of data. But there is such a ...
1
vote
0answers
25 views

If you were to design a PKI from scratch, what would you do? [closed]

In what ways would you simplify? What would be changed to be more modern or extensible? Suppose you have no requirement to adapt to previous protocols. Links to proposed designs, existing ...
0
votes
0answers
37 views

Non CPA on custom MAC

While preparing for a crypto exam there is a task we don't really understand: task Let $E_K$ be a permutation $\{0,1\}^b \rightarrow \{0,1\}^b$ defined by a blockcipher with the key $K$. Let $M = ...
3
votes
1answer
118 views

Is it possible to reverse the birthday attack calculation?

I find that for every 100 password salts in our database, we only average 94.73 distinct salt values (averaged over a total of around 18 million). Is there a way to take that observation and calculate ...
1
vote
1answer
94 views

Birthday-attack calculation in planning password salting strategy

The book Cryptography Engineering by Fergusun, Schneier, Kohno section 2.7.1 explains Birthday Attacks: "In general, if an element can take on N different values, then you can expect the first ...
7
votes
4answers
945 views

Switching between AES and a highly performant algorithm

I want to de/encrypt several binary files rather frequently on a normally battery-powered device. My goal is to use AES-256 when the device is AC-powered and a highly performant algorithm when it's ...
2
votes
1answer
32 views

Is it not secure if we use weak passwords to protect exported PKCS #12 files with private keys?

Consider a practical scenario as described in Microsoft's Expand Export a Certificate with the Private Key. We can see a certificate with private key can be exported as a PKCS #12 file, where the ...
4
votes
1answer
75 views

Adding two RSA private key

We've constructed a new private RSA key from two known private RSA keys $Priv_1$ and $Priv_2$ as follows: $$p = next\underline{}prime\left(\frac{Priv_1(p) + Priv_2(p)}{2}\right)$$ and $$q = ...
2
votes
1answer
30 views

TLS: How is the shared secret (via Diffie-Hellman) used in the symmetric crypto function?

So let's say we use a cipher suite with DH key exchange and AES symmetric encryption. Alice and Bob both end up with the same shared secret key $k$. How is this value ...
2
votes
1answer
152 views

Is base64 the best two-way hash function to encrypt and trasmit a set of integer numbers via Internet?

I am writing a mobile game and I need to save my game data on my game server, So crackers can not find and access the saved files(data) on their mobile, the game data can be expressed by numbers, So, ...
3
votes
0answers
24 views

How to use “proof of knowledge” to verify the result of modular exponentiation

I am thinking about regarding proof of knowledge as the inverse of result verification in server aided computing. For example, a user asks the server to compute $R=x^y \bmod z$. Normally, the user ...
3
votes
1answer
56 views

Implementing 5 modes of operation with a hash function

Is it possible to implement any of the 5 modes of operation (ECB, CBC, OFB, CFB, CTR) with a hash function?
2
votes
1answer
113 views

CPA and pseudorandom generator

Just started learning about Cryptography and Network Security in general, and I can't seem to grasp the understanding of the following question. Please correct me if I am misunderstanding anything. ...
3
votes
1answer
46 views

Attacks on WinRAR volumes reusing same password?

I have quite a few WinRAR volumes that are all encrypted with the same password. The password is long and unbruteforceable, but I recently read that WinRAR uses PBDKF2 as its key-derivation function ...
2
votes
1answer
58 views

Is it secure to use order preserving encryption in practice?

When I read papers, I often see the comments, "order-preserving encryption is deterministic and it is not IND-CPA secure", or in general "it is not secure enough to be implemented in practice". So I ...
2
votes
0answers
79 views

Limit the number of private key uses for RSASSA-PKCS1-v1_5 with SHA-256 signature?

Assuming all messages and their signatures are available to the attacker, is it secure to use the same RSA private key to sign many messages (roughly $10^{6}$) via PKCS#11 ...
7
votes
3answers
266 views

What was the first MD5 collision ever constructed?

We all know that MD5's collision resistance is severly broken. But when thinking of "random" strings with great cryptographic importance I've come up with NIST's curve seeds and MD5 collisions. But ...
1
vote
0answers
38 views

Symmetric stream cipher, is it known?

I am thinking on a simple symmetric stream cipher. My first idea is the following: The key is a set of array of random bytes ($\underline{k}_1$ ... $\underline{k}_n$), whose length is $l_1$, $l_2$, ...
4
votes
1answer
109 views

Signing and verifying message consisting of several parts

Given a message $m$ that consists of several parts. we want to be able to verify individual parts or a combination thereof. The simplest solution is independently signing each part. But since ...
2
votes
1answer
53 views

Modified version of a CPA-secure encryption scheme

The following encryption scheme: choose a random string $r \leftarrow \{0,1\}^n$ and compute the ciphertext $c= \thinspace <c_0, c_1>= \thinspace <r, F_k(r) \oplus m>$, assuming $F$ a PRF; ...
5
votes
2answers
71 views

Does $(u_1=r_1\cdot x,\ \ w_1=r_1\cdot z, \ \ u_2=r_2\cdot x,\ \ w_2=r_2\cdot z)$ Leak Information?

Consider we have a fixed value $x$. We pick values $ r_1,r_2,z\leftarrow \mathbb{F}_p$, where $p$ is a large prime number, and it is public. So $r_1,r_2,z$ are uniformly random values. We compute ...
3
votes
2answers
40 views

Does SRP also authenticate the server to the client?

The Secure Remote Password (SRP) protocol lets a client prove to a server that it knows a specific password without revealing that password to the server. The server stores a cryptographic verifier ...
1
vote
1answer
41 views

In bilinear pairings, is it possible to let someone be only able to decrypt ciphertexts in $G_1$ but not able to decrypt the ciphertexts in $G$?

For example, in Don Boneh et al.'s paper "Evaluating 2-DNF Formulas on Ciphertexts", they gave an encryption system that the cihpertext can be in either $G$ (when only additional homomorphic ...
2
votes
1answer
168 views

Obtain 384 bits from a 256bit MasterSecret

I'm currently implementing, with crypto++, and AES tranmsission system, whose key is based on a previous ...
2
votes
0answers
88 views

Is there a way to slow down collision attacks using iteration?

The simple way to iterate a hash function $H(H(m))$ only makes brute force preimage finding slower, but leaves collision attacks as fast since a collision in the inner hash function is a collision in ...
0
votes
0answers
31 views

Zero knowledge proof of bilinear equation

Suppose A and B have pre-shared a secret key $r$. Is there a way for A to prove that $p=[e(a,b)e(g^{c_i},b)]^r$ has been correctly computed with this $r$ but without knowing or revealing either a,b or ...
4
votes
2answers
766 views

Is it secure to concatenate two 16-bit random numbers into a 32-bit one?

I'm working on a security application for RF modules aimed to protect a communication between an autarkic sensor and a line-powered receiver against MITM (man-in-the-middle attacks). I decided to use ...
0
votes
1answer
56 views

What is the meaning of the overlapping region on OTP-perfect secrecy diagram?

I'm new to cryptography. I want to ask about OTP-perfect secrecy diagram like figure below: On the overlapping region (middle), notated by R(X;Y;Z). R can be calculated by I(X;Y) - I(X;Y|Z). That ...
2
votes
1answer
50 views

Encryption on the cloud with versioning

Can file-versioning, which is available for instance in Dropdox, weaken the security of encrypted files if someone is able to see two or more snapshots of the ciphertext at different times? To be ...
1
vote
1answer
90 views

Double Encryption Using same key

I am new to crypto and wondered what would happen when we encrypt twice using any algorithm and the same key. Consider two block ciphers A and B. We generate the ciphertext as c = A(B(m)) for any ...
1
vote
2answers
114 views

FIPS 140-2 Compliance Testing

Is there any tool which can be used to test that implementations follow FIPS 140-2 Compliance ?
1
vote
0answers
27 views

Where can I find a versatile PKI and library leveraging curve25519?

I note that Things that use Curve25519 provides a long list of protocols, software, and libraries that leverage curve25519, but I'm wondering if there is any such software that more fully implements a ...

15 30 50 per page