People who code: we want your input. Take the Survey

Questions tagged [encryption]

Encryption is the process of transforming plaintext using a cipher into ciphertext to make it unreadable to anyone except those possessing the key. Decryption is the process of transforming that ciphertext back into plaintext, using the key.

486 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
1
vote
0answers
51 views

Review: peer-to-peer encrypted communication

I'd like to ask you to review security of the following communication scheme: network is strictly P2P, based on DHT (peer discovery) root user can create a virtual private network (network private ...
1
vote
0answers
52 views

basic Shamir's secret sharing scheme

I have tried to look online in various sites and texts and tried to use several youtube tutorials but I still cannot grasp it correctly. could someone please help me understand a simple case ...
1
vote
0answers
46 views

What is the exact algorithm for encryption and decryption with hummingbird-1 cryptography?

I have really googled the entire internet but could not find a clear algorithm for hummingbird-1 cryptography.The problem emerges in the decryption module: What is the initial value of state register ...
1
vote
0answers
57 views

Comparison of end-to-end encryption and TLS

I am writing a comparison paper about security of electronic communication and I want to compare end-to-end encryption and TLS by giving two examples such as Whatsapp and Facebook Messenger. However, ...
1
vote
0answers
34 views

Can we use the same frame counter in A5/2

Let we have three encoded messages with length $3*456$ bits in A5/2 encryption. Can we use the same frame counter in the encryption process or we must use different? (E.g. this because in the below ...
1
vote
0answers
114 views

Break an encryption made with XOR of a key and a known Nonce

My questions is general, but in my case regards the Kerberos protocol and the communication between the client first message and the KDC. Is there some problem in encrypting using a: (secret key XOR ...
1
vote
1answer
502 views

Triple Diffie-Hellman and MITM

While reading about Triple Diffie-Hellman, I was wondering how it can prevent MITM if the server decides to spoof key sets. For example, Alice and Bob are connected using a server. Alice ----- ...
1
vote
0answers
150 views

How do I calculate the conditional probability of a Caesar cipher?

I have a frequency distribution of letters for the plaintext and the ciphertext. I'm trying to determine the conditional probabilities to identify the plaintext/ciphertext pairings. If I encrypt ...
1
vote
0answers
84 views

Decryption of Vignere cipher by hand using Kasiski examination

My task is to decrypt the following message, which was encrypted with a Vignere cipher of length 4: ...
1
vote
1answer
88 views

Creating nested messages in OpenPGP

I need to create a nested message in OpenPGP (my understanding is that the protocol itself should support it). Let's say I have Payload ("Time in Lordran is ...
1
vote
0answers
56 views

attacks and defenses on multi party Diffie-Hellman protocol

I tried to create a 4 partied Diffie-Hellman implementation for 4 people using its cyclic group property. However, I am not sure regarding those 2 issues, and would appreciate if you could elaborate ...
1
vote
0answers
105 views

How to upgrade encryption version of many large files?

Assume that I operate a user-facing online file syncing service that offers end-to-end encryption of large files, such that files are encrypted client-side first, then uploaded to the server for ...
1
vote
0answers
62 views

AES CTR - Pause and resume encryption?

I am using AES/CTR/NoPadding to encrypt while downloading files in one of my application. The encryption is done along with downloading. When the internet is not available in the middle of downloading,...
1
vote
0answers
38 views

What does the server do on receipt of a one-time-password?

I'm trying to understand this question and I do not understand part of it. I have part of figured out, part of it not. Considering the hash function h(i) = (i + 5) mod 7, used in an implementation ...
1
vote
0answers
121 views

Is bit encryption enough?

Assume that $\Pi$ is a secure PKE scheme (or other appropriate encryption schemes) with 1-bit message space. And it can be applied bit-by-bit to construct a many-bit encryption scheme $\Pi'$. ...
1
vote
0answers
306 views

Question about RSA timing attack and a Chosen Ciphertext Attack on RSA

I am quite new to the RSA and I have a couple of questions that confuse me. Q1: A Timing attack on RSA can be prevented _____________________________ A. By performing the “square and multiply” ...
1
vote
0answers
183 views

How to encrypt small pieces of data (2 - 4 bytes) within Beacon advertising packet?

I'm developing a medical device that operates under extreme low-power constraints and transmits data with BLE, where every unnecessary millisecond of air time matters. I am developing a Beacon ...
1
vote
0answers
59 views

What if an AES Whitebox 1024-bit (or larger key) is created? Does it increase complexity consistently?

Following the Chow et al paper and Muir's tutorial, I was able to implement the AES algorithm using tables embedding keys of 128, 192 and 256-bit sizes, later extended to 1024, 2048 and 4096-bit sizes....
1
vote
0answers
39 views

Are biases narrowed towards the provenance of hard NP complete problems relevant?

I hear of randomized reduction, deterministic reduction and non-deterministic reduction of complexity from A to B problems. This could make things impossible for polynomial time adversary prying into ...
1
vote
0answers
37 views

asymmetric encryption with rekeying in an untrusted environment

Alice can retrieve asymmetric encrypted messages (let's call one of them C1 and the Message itself M) for her from an untrusted environment (let's call it Eve). She owns her private key K1 and has ...
1
vote
0answers
132 views

zero knowledge proof of range and set membership

I have a large number of items with a unique serial number and a score (score isn't always unique). There is a list which contains all of the serial numbers and their respective scores. I select 3 ...
1
vote
0answers
48 views

Filling an encrypted disk

For a full-disk encryption setup, with a physical disk X and the induced logical volume X_crypt, there are several ways to initially fill the disk: (A): Fill X with zeros; (B): Fill X with random ...
1
vote
0answers
2k views

RSA encryption extremely large public exponent

I'm trying to do learn a bit about RSA by doing CTF's and now I am doing one problem probably more than 7 hours so I would really appreciate a hint here from an expert. I have an encrypted message $c$...
1
vote
0answers
128 views

Strongswan KDF Test

How can a KDF implementation for IKEv2 application, specifically in strongswan implementation case can be verified for conformance with NIST SP800-135, please? SP800-135 KDF recommendation further ...
1
vote
0answers
91 views

How to break fully homomorphic encryption over integer algorithm with known cipher of same integer?

If I do encryption and decryption like this: Encryption: $\text{E}(m) = (r \times p_1+m) \bmod N$ Decryption: $\text{D}(\text{E}(m)) = ((r \times p_1 + m) \bmod N) \bmod p_1 = m$ where, $r$ = ...
1
vote
0answers
47 views

What is the difference between Google's API-Key, OAuth Client ID and AWS Secure Token Service

What is the difference between Google's API-Key, OAuth Client ID and AWS Secure Token Service? Are they are all just providing delegation tokens, except they are from different companies? Is there a ...
1
vote
0answers
31 views

Private key which becomes invalid after specific timestamp

Sorry for my dumb question, as I'm not crypto guy. Is there any algorithm, which allows to encrypt some message with the public key, but the associated private key is only valid for specific period ...
1
vote
0answers
800 views

How to decrypt a simple substitution cipher where space is also encrypted by a character

I am trying to decrypt a text data encrypted with a simple substitution method with 2 steps. First, shift the alphabet of the source text by a few characters. For example, if we shift by 2 characters,...
1
vote
0answers
332 views

ECDSA Message Recovery from Two Encrypted Messages with Signatures and Public Key

I am currently working on a problem where I have two encrypted messages, their corresponding signatures, and the public key. Furthermore, the value of $r$ is the same in the two signatures. I am ...
1
vote
0answers
45 views

Gate count for Ring-LWE

In one of my recent research, I need to compare the number of gates needed in Ring-LWE encryption to AES in the circuit model. For AES we can find some estimation like this site, but for Ring-LWE we ...
1
vote
0answers
185 views

Double encryption : what method is the best?

Given the block-ciphers defined as follows : $1.$ $C=$ $E_{k1}($$E_{k2}$$(M))$ $2.$ $C=$ $E_{k1{\oplus}k2}$$(M)$ $3.$ $C=$ $(E_{k1}(r),E_{k2}(r$ ${\oplus}$ $M))$ where $C$ is the cipher ...
1
vote
0answers
311 views

Private Key Sharding - How is it Secure in a Distributed Network?

In a Distributed Network in order for a private key not to be compromised sharding will have to take place off the network, correct? If so: Why is it when a Distributed Network shards private keys ...
1
vote
0answers
69 views

Can one design an asymmetric encryption scheme based on any secret sharing scheme? Are they that closely related?

I've seen both asymmetric encryption and secret sharing schemes based on graph 3-coloring, and I'm curious if this is a coincidence due to some peculiar property of graph 3-coloring alone.
1
vote
0answers
75 views

Question on nCPA Security and Uniform Permutations

I feel I am misunderstanding the idea of nCPA security and its relation to uniform permutations. In particular I've been reading the paper "Hoang, Morris Rogaway; An Enciphering Scheme Based on a Card ...
1
vote
0answers
170 views

Why does the Content Scrambling System have two different length LFSRs

CSS uses two LFSRs of length 17 and 25. If we have two periodic functions $f(t)$ and $g(t)$ and consider the function $h(t) = (f(t), g(t))$, then $h$ will have period $pq/\gcd(p, q)$ where $p$ and $q$...
1
vote
0answers
63 views

permutation cipher definition unclear

I have an assignment to decode a permutation cipher based on a key. But on the internet I found only ONE website talking about it. Things are not very clear. I understand that I have to reorder the ...
1
vote
0answers
52 views

Signal: Ratchet & Message History

Hi folks– new to cryptography. My understanding of the double ratchet algorithm (or even just any ratchet algorithm) is that it uses all of the previous state (in Signal's case, all the previous ...
1
vote
0answers
497 views

how to compute Bit Independent Criteria on a 4-bit S-box?

The idea of Bit Independence Criterion (BIC ) was introduced by Webster and Tavares . For a given set of avalanche vectors generated by complementing a single plaintext bit, all avalanche variables ...
1
vote
1answer
248 views

Hardware, Handheld Password Manager

I am currently working on a hardware project that will utilize the native USB and keyboard emulation capabilities of the Teensy device. Essentially, the user will store an encrypted password database ...
1
vote
0answers
50 views

Turn a homomorphic encryption scheme into one that doesn't have the homomorphic property

Homomorphic encryption is a form of encryption that allows computation on cipher-texts, generating an encrypted result which, when decrypted, matches the result of the operations as if they had been ...
1
vote
0answers
42 views

Example of an attack on a message exchange which uses the homomorphic property

Can someone give me an example of an attack on a message exchange using this encryption scheme, that uses the homomorphic property? In my opinion, Existential forgery under directed message attack ...
1
vote
0answers
63 views

What are the advantages and drawbacks of using long term private keys compared to session keys?

What are the advantages and drawbacks of using long term private keys compared to session keys?
1
vote
0answers
228 views

XEX vs EME mode of operation

Two of the CAESAR finalists use XEX and EME mode of operations (COLM uses EME, OCB uses XEX). I did literature to summarize the main advantages / disadvantages but I could not find much. My question ...
1
vote
0answers
40 views

example of increasing size weakening security?

I'm seeking an example of a cipher construction with two variants differing by key/block/state size yet sharing most of the internal structure. Where the larger varient is easier to break than the ...
1
vote
0answers
170 views

Is it possible to re-cipher with Paillier?

I know that with ElGamal we can re-cipher and get a second ciphertext equal to the first. Is it possible with Paillier too? When saying "re-cipher", I mean "A sends me a message, that is encrypted ...
1
vote
0answers
399 views

Additive homomorphic secret sharing

I am new to cryptography esp, homomorphic encryption. I would like to know if the following is possible using something similiar to additive homomorphic secret sharing. Please apologize me if its too ...
1
vote
0answers
198 views

Homomorphic encryption - addition for more than two parties

I have just found out about the homomorphic encryption and I was wondering how is it possible to perform an addition for more than two parties? More concretely, I want to have several parties $P_i$, ...
1
vote
0answers
151 views

Elliptical Curve Cryptography benchmark test

I have built web app that implement Elliptical Curve Cryptography. During testing using data set that i chose on my own, it already run well.. But, for now, i want to test it in some benchmark test, ...
1
vote
0answers
147 views

Any algorithm with a pair of master keys and multiple pairs of subkey for a secure key escrow?

Note: This question looks like my other question — Any algorithm with a master key for decrypting private key encrypted messages? — which is perfectly answered by @real-or-random, but this one is ...
1
vote
0answers
58 views

Custom encryption scheme for SSL

Suppose that messages transmitted over SSL are modified as follows: the message is splitted in blocks, $B_1, ..., B_m$ (each with at most $2^{14}$ bytes) for each block $B_i$ we do: ...

1 2 3
4
5
10