3
votes
1answer
51 views

How to compromise the privacy of NaCl encrypted messages, when nonce is reused?

I want to know to how break NaCl encryption when a nonce used more than once for a given key private key. According to PyNaCl docs: It is VITALLY important that the nonce is a nonce, i.e. it is a ...
4
votes
3answers
158 views

Is there a way to prove equality of plaintext that was encrypted using different public keys?

Imagine if Alice encrypts message to Bob (using public key $P_{bob}$) and then Bob encrypts the same message to Carol (using $P_{carol}$). Is there a way for Bob to prove that: $P_{carol}$ was ...
0
votes
1answer
154 views

How to prove knowledge of discrete logarithm in a product?

Definitions Suppose I have two large safe primes $p$ and $q$, and a composite number $N=pq$. I have $G$, a large cyclic subgroup of $\mathbb{Z}^{*}_{N}$; $g$ and $h$ are generators of $G$. I commit ...
1
vote
0answers
43 views

Designing an AES-based protocol for controlling and acessing ioT boards via RF

I'm designing an open ioT protocol to be used on ioT boards based on Texas Instruments RF-based MCUs. These MCUs have an AES module to easily encrypt and decrypt AES content, so that's why I choose a ...
1
vote
1answer
122 views

Algorithm to transform plaintext to a key of desired keysize, when using input plaintext as key for FPE?

Using a format preserving encryption scheme that uses AES internally as its block cipher, for a plaintext that I encrypt I want to use that input plaintext as the key. However using AES-128, my ...
1
vote
0answers
73 views

Carrying out a known-plaintext attack on a cipher [closed]

Previously posted here. Someone suggested I could post it here to get some answers. I am trying to solve a CTF challenge, here. Basically we're given message and key inputs to a cipher and its ...
3
votes
1answer
170 views

HMAC-SHA256 on large data files

I currently need to encrypt large files (video, over 6 Gbytes) for our customers. To ensure authenticity and integrity, we chose HMAC-256 as we already use it in our internal messaging system. But ...
1
vote
0answers
472 views

What is the most secure encryption algorithm to encrypt my password database?

The password manager I use lets me choose an algorithm from the list below in order to encrypt my password database: Microsoft Base Cryptographic Provider v1.0: RC2-128 RC4-128 DES-56 3DES TWO ...
2
votes
2answers
82 views

Semantic Security and Equal Message Length in the Context of Public Key Cryptography

A lot of definitions for semantic security make use an experiment $\text{Exp}$ which is performed between a challenger $\mathcal{C}$ and an adversary $\mathcal{A}$ that begins as follows: ...
1
vote
1answer
120 views

Triple DES as cryptographic hash function

I need to generate a hash for a small piece of data (~50 bytes). I'd normally use MD5 or SHA but that's not available in the platform I'm programming for. Luckily, it provides Triple DES and I ...
1
vote
2answers
94 views

What is the meaning of probabilistic encryption algorithm?

I am learning cryptography by myself and I am not able to understand the meaning of probabilistic encryption algorithms. How is it different from deterministic encryption algorithms ? How can the ...
2
votes
0answers
82 views

How can I multiply an additively homomorphic encrypted value by a float number?

As we all know, if $E()$ is an additively homomorphic encryption, we can multiply $E(a)$ by an integer $b$, then we will get $E(ab)$. But what if $a$ is a float number? Can we still get $E(ab)$? Which ...
2
votes
4answers
2k views

Is there an existing cryptography algorithm / method that both encrypts AND compresses text?

So I'm trying to find a method of encryption that not only obfuscates text, but also compresses the result. For example, if I encrypted ninechars, the ideal result ...
2
votes
0answers
116 views

How to prove that a commitment hides the decryption of an ElGamal ciphertext?

I've decided to remove a previous unanswered question of mine and break it down into smaller pieces so it's not such a loaded question. For this question I need to prove that I've committed to a ...
1
vote
1answer
67 views

SSL implementation in windows? [closed]

SSL (Secure Socket Layer). windows Webbroswers ( Chrome, Mozilla, Edge, explorer ) are using which winapi set to Encrypt and Decrypt Data. SSL is asymmetric encryption. So which Api set is being used ...
2
votes
1answer
47 views

Is frequency analysis a viable attack on non-text data encoded by substitution?

Is frequency analysis a viable attack on non-text data encoded by substitution (eg image and audio formats encoded with a substitution cipher)?
2
votes
2answers
95 views

Is pseudorandom function also a one-way function?

Can I assume this? Specifically, I want to know if the following two cases are valid. Suppose $prf_k(m)=c$ One-wayness: Only given $c$, we cannot reveal $m$. Without key $k$, even given $m$, cannot ...
1
vote
1answer
37 views

Deriving a Set of Seeds from a Seed

I need a set of seeds $S=\{s_1,..., s_n\}$, for pseudo-random function where seed $s_i$ is used to generate a set of pseudo-random values. Obviously I need to be able to regenerate the sets of ...
2
votes
1answer
74 views

Output of using the same key in all 3 boxes of 3DES

I am trying to figure this one out: What would be the encrypted output for an input x if the same key K is used in all three boxes of 3DES? The encryption scheme for 3DES with three different keys, ...
5
votes
1answer
72 views

Designing Secure Multi-Party Computation Sub-Protocols Based on Homomorphic Encryption

When designing SMPC protocols using secret-sharing, it is a common approach to compose a protocol from several sub-protocols (each proven secure under the formal definition of security w.r.t. ...
1
vote
0answers
13 views

Transforming EC public key X and Y-sign into X and Y [duplicate]

I'm using bouncycastle which uses X and Y coordinates for public keys. An EC public key is more compactly represented by the X coordinate and the sign of the Y coordinate. How do I use bouncycastle ...
3
votes
2answers
68 views

Discrete Logarithm problem with inverse

Let $\mathbb G$ be a cyclic group of order $q$. The Discrete Logarithm Problem (DLP) is, given $g, g^x \in \mathbb G$, to compute $x \in \mathbb Z_q $. I'm interested to know if there is a known ...
3
votes
0answers
72 views

How to overcome issues with big ciphers? E.g. with small vs. big Vigenére Ciphers

I understand that bigger ciphers show more recurring patterns and therefore should be easier (or at least faster) to decrypt as you'll have a better statistical analysis, being However if we use a ...
2
votes
1answer
125 views

How to use CRT to compute 4 square roots while decryption in Rabin Cryptosystem

I'm reading Rabin Cryptosystem which requires to compute 4 square roots $r, -r, s,- s$ while decryption of cipher text $c$ such that $$r = (y_p \times p \times m_q + y_q \times q \times m_p) \mod n ...
2
votes
1answer
81 views

Collision likelihood from /dev/urandom for VMs using the same underlying hardware

We have multiple virtual machines sharing the same physical hardware. We use /dev/urandom for session key generation. But a question comes up: if ...
0
votes
0answers
55 views

Need help implementing key management scheme

Scheme has following requirements Client application should perform encryption/decryption using component 1, component 2 and ZPK (zone PIN key. Client should get this key from host in encrypted ...
1
vote
3answers
66 views

Security guarantees of Shamir's secret sharing when some co-efficients are zero

Shamir secret sharing techniques rely on polynomials for splitting and reconstructing. It's security properties are very good, i.e. it is impossible to reconstruct the secret when $t-1$ shares are ...
1
vote
0answers
68 views

What is the lightweight key exchange protocol of choice?

Assume I have to implement a secure channel protocol by myself. Assume further that for some obscure reasons (library restrictions?) I can't use any of the pre-made libraries for SSH, TLS and such. ...
3
votes
2answers
125 views

Small Quantum Signatures - Reality check needed

I've been thinking a bit lately about how to get quantum resistant signatures fast and (relatively) small. One idea I've been keen on exploring is finding a crypto PRNG that allows fast-forwarding, ...
7
votes
1answer
911 views

Why is it OK for secretbox to leak the message length?

Most block cipher implementations expect users to pad so that the message matches the cipher block size. I understand the purpose of the padding is to make the input match the cipher block size. It ...
1
vote
0answers
92 views

Fingerprint RSA public key in PKCS1 format

I can't find anywhere details on how to fingerprint a public RSA key in PKCS1 format. There are a lot of examples on the internet on how to fingerprint an RSA public key in openssh format using ...
4
votes
2answers
272 views

Is there a difference between asking for a signature and asking for a decryption in challenge-response authentication?

Consider the following two authentication schemes. In both cases the server knows a public key of the client (for a signature system in the first and an encryption system in the second case). Scheme ...
8
votes
1answer
702 views

What Diffie-Hellman parameters should I use?

After reading this article, I started wondering how should I approach the problem of choosing p and g params in 1024-bit Diffie-Hellman key exchange. In my project, I am going to establish keys ...
0
votes
0answers
29 views

Understanding RSA [duplicate]

I'm reading RSA in Cryptography Course. There is portion of RSA that's confusing me. In Handbook of Applied Cryptography its written Represent the message $M$ as ...
3
votes
1answer
123 views

Can the round function $F$ in a Feistel Network be practically any non-invertible function?

This question might seem silly, but how true is the fact that the round function $F$ does not have to be invertible? I am curious to know this, because non-invertible functions can be very lossy, ...
1
vote
1answer
219 views

Encrypt large data with RSA through blocks in java

I'm working on a communication protocol where a client sends encrypted data to a server. What happens is that in some point, the client creates a symmetric key used to create data digests through the ...
2
votes
1answer
103 views

AES/DES question about determine a key

I have a question. If you receive a DES encrypted message for which you would NOT recognize the plaintext if it were decrypted, is there any way to potentially determine the key if all keys are ...
4
votes
0answers
70 views

What level of security is provided when a Feistel Cipher is used as a round function of another Feistel Cipher?

Recently, I was reading: Are there any specific requirements for the function F in a Feistel cipher?, and the answer posted mentions a Feistel Cipher named Turtle, which uses a four-round Feistal ...
1
vote
1answer
44 views

Explanation of vector in Visual Cryptography

I'm starting to study about visual cryptography, but I am stuck with the following problem. On paper "Visual Cryptography" by Moni Naor and Adi Shamir, on page 6. How to read/what is the meaning of ...
6
votes
2answers
270 views

How does Diffie–Hellman differ from elliptic curve Diffie–Hellman?

I didn't understand how ECDH actually works. Disclaimer: I know very little about elliptic curves. Here is how DH works: Alice and Bob agree on a prime number $P$ and a generator $G$. (They use one ...
1
vote
1answer
117 views

AES-256 mode with per-block-key being a SHA-256 of SHA-256 of secret key, random public salt and block number. What's amiss?

Please criticize the (homebrew?) mode described below; to point out a single major defect/uncertainty or the link to (the analysis of) an equivalent construction is quite enough. Assume the ...
4
votes
1answer
94 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 ...
2
votes
1answer
72 views

Does Mersenne Twister generate homogeneous numbers?

I have been assigned to generate 15000+ homogeneous and uniform random numbers for a work. I have been searching if Mersenne Twister generate homogeneous distribution of numbers but I don't find ...
2
votes
1answer
55 views

Design for file transfers to a new party

I'm pondering a problem of how to enable transfers of files from clients to people that does not yet have an application/account/keys yet. Here's my current thought for Alice wanting to send Bob ...
10
votes
0answers
190 views

AMD and RDRAND instruction

The latest AMD programmer manuals, dated June 2015, include the RDRAND instruction in the instruction set. For completeness, it lacks ...
0
votes
0answers
54 views

Detecting Software Changes - Verifying untampered code

This question assumes an environment devoid of any internet connections, the software in questions operates in a non-connected environment on a single machine. I have a piece of software that may be ...
3
votes
3answers
114 views

Fast forwarding hash functions

We know that a good hash function is a one way/trapdoor function. Easy to calculate one way, harder to work out a previous state. I was wondering if anyone knew a good hashing system that allowed ...
3
votes
2answers
195 views

Memory-hard proof-of-work: are they ASIC-resistant?

Is a memory-hard proof-of-work scheme necessarily resistant to speedups from custom ASICS? Background: Bitcoin uses a proof-of-work scheme based on SHA256 hashing. The scheme is compute-bound. ...
2
votes
0answers
34 views

Hiding the identity of a party within the Kerberos authentication scheme

In the Kerberos authentication protocol, as described here: would it be safer to replace step (1) with: $$ A \rightarrow T : A, E_{K_A{_{T}}}(B, N_A) $$ so that a passive adversary does not know ...
3
votes
1answer
98 views

Can a billion elliptic curve keys be generated on a laptop in less than an hour?

I want my application to generate an EC key pair. The first four bytes of the sha256 hash of the public key should contain a known IP address. As hashes are one-way functions, I need to brute force ...

15 30 50 per page