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.

305 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
1
vote
0answers
44 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
38 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
1answer
34 views

Multiple sender single receiver Encryption

I had this article given to me by my teacher, and I would like to enhance it. It's titled Modified El Gamal Algorithm for Multiple Senders and Single Receiver Encryption. I planned on having the ...
1
vote
0answers
20 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
46 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
345 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
92 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
81 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
36 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
1answer
197 views

Encryption: am I doing it right?

I'm trying to get a per-user encryption key scheme off the ground and need some validation from wiser crypto pros. Consider the following procedure: User provides registration information to include ...
1
vote
0answers
24 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
165 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
43 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
134 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
246 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
67 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
52 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
89 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
53 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
43 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
323 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
182 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
46 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
37 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
35 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
169 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
39 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
142 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
328 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
165 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
126 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
107 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
56 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
vote
0answers
98 views

Negligible probability of failure in correctness definition (predicate based encryption)

I would like to understand why some definitions of correctness allow a negligible failure probability. i.e. the probability that decryption reverses encryption is 1 minus a negligibly small amount. I ...
1
vote
0answers
80 views

Are there any proof of work style encryption algorithms? i.e. an encryption algorithm which takes a lot of work to encrypt, but is easy to decrypt

I'm wondering whether or not there is an encryption algorithm, or at least the possibility of one, which takes a lot of work to encrypt, yet can be decrypted very easily? I have come across this ...
1
vote
0answers
45 views

What is the main difference between Anonymous HIBE and Anonymous Predicate Encryption?

What is the main difference between Anonymous HIBE and Anonymous Predicate Encryption? In my opinion, both work for the same concept in different ways.
1
vote
0answers
63 views

Question on recovering a key in the algorithm

Let $E$ be a block cipher that has block size and key size both equal to 64 bits. Let $E'$ be a block cipher that has 64-bit block size and is defined as follows: For a 128 bits key $K \mathbin\Vert ...
1
vote
0answers
77 views

Is there any cipher standard based on SHA-3, where it is not used as part of RFC2104?

I'm thinking about using a cipher, which uses AES CTR+SHA-3. My basic idea is this: IV|AES-CTR(PLAINTEXT_SIZE|PLAINTEXT|SHA-3(KEY|PLAINTEXT_SIZE|PLAINTEXT)) So, ...
1
vote
0answers
138 views

AES-192 bit fixed matrix values in mixed column step

In advanced encryption standard,in mixed column step,how those fixed matrix values came? The values are (02 03 01 01), will these values will be the same for 192 ...
1
vote
0answers
29 views

Why in the Rao-Nam private key version of McEliece scheme, P matrix is multiplied after adding error vector?

The private key version of McEliece known as Rao-Nam scheme, the encryption is done as c = (mSG + e)P. What is the need for applying permutation matrix on the error vector?
1
vote
0answers
124 views

Does multiple encryption cycles (using the same password for each iteration) offer any security?

Does running a plaintext through AES multiple times with the same password offers any security benefit akin to triple DES? Note that I'm assuming “same password for each iteration”.
1
vote
0answers
103 views

How does the Chop Chop attack effect TKIP?

I know that chop chop attack is because of WEP's insecure checksum mechanism that is CRC32. As TKIP uses MIC along with CRC32 which just makes an attacker to wait for 60 sec upon two mismatch MIC ...
1
vote
0answers
139 views

Polynomially many iterations of one way permutation

I have seen that the existence of weak OWFs implies the existence of strong OWFs. It comes from repeating the weak OWF polynomially many times on different random inputs. However, I have a different ...
1
vote
0answers
56 views

Leaked bits from other cryptosystems

We know discrete logarithm leaks last bit and factoring is easy if half the bits of factors are known. Are there similar trivia associated with SVP based schemes, NTRU scheme, McEliece scheme etc.?
1
vote
0answers
64 views

Why is simulation-based security for functional encryption impossible in the standard model?

Boneh et al.(Functional Encryption Definitions and Challenges) present that simulation-based security for functional encryption is impossible in the standard model. I can not understand this. In ...
1
vote
0answers
115 views

What's the advantage of branching program? Why we use branching program to compute the encrypted data?

Branching program is one type of NC1 circuit and can be used to compute encrypted data. So whether there exist other methods in the NC1 circuit to compute encrypted data. What's the advantage of ...
1
vote
0answers
238 views

Storing Ciphertext in Firebase - Key Choice and Storage

I am building an application where I want that data submitted by the user is stored encrypted in the database, such that only the user can access it. I started reading into cryptography and it looks ...
1
vote
0answers
97 views

Algorithms to securely derive symmetric keys

I need to derive symmetric keys between two communication endpoints on an embedded device with 800MHz ARM core. What algorithms are available to have this secure key derivation mechanism? I know ...
1
vote
0answers
35 views

Encryption in ABE

With reference to the image above, what is meant by Choose $d_r$ other points of the polynomial $q_r$ to define it completely
1
vote
0answers
205 views

Threshold encryption with threshold on encryption part

For a thought experiment I'm looking for a threshold encryption scheme where $k$ out of $n$ shares are needed to encrypt the data and everybody can decrypt the data. However, I only found schemes ...