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.

Filter by
Sorted by
Tagged with
0 votes
0 answers
19 views

Is AES a group?

The question I'm wondering is whether the AES cipher is a closed cipher (which is equivalent to AES being a group). And this question interests me due to the lack of understanding of whether it is ...
Ss1996's user avatar
  • 21
0 votes
0 answers
21 views

What do we mean when we say we need more than polynomial time many cipher texts

What does it mean when we say something like „we need more than polynomial time many cipher texts“? I understand it as „an adversarial can run for polynomial time and try as many messages as possible ...
jilgolfo's user avatar
0 votes
0 answers
29 views

Is it possible for a given plaintext and ciphertext to have two different keys? [duplicate]

This has probably been asked before but for a given ciphertext and plaintext pair, is it possible to have two different keys producing said pair? Or there are no collisions in AES, unlike hashing ...
user2338802's user avatar
0 votes
1 answer
88 views

Prove RSA scheme is insecure

Im reviewing my crypto and I would like to prove the following: RSA experiment where the adversary is given (N, e, y) where N = pq and p, q are two primes. The adversary knows p, q. How can I build an ...
Jaxon Steinhower's user avatar
2 votes
1 answer
158 views

equivalence between entropic perfect secrecy and single probability

i'm new to information theory. I know the standard perfect secrecy definition: $$ P(M=m|C=c) = P(M=m) , $$ for all $m$ and $c$, respectively the message and the cypher. Now, i can use the entropic ...
forgetfuled's user avatar
0 votes
0 answers
27 views

Security of using predefined shares in Shamir's Secret Sharing

This is related to Is it possible to create a mix of predefined and generated shares for Shamir's Secret Sharing?, but I have unfortunately lost access to that question and can't merge accounts ...
euandeas's user avatar
0 votes
0 answers
30 views

Why is firmware implementation not preferred for more lfsr based encryption schemes?

Given that an algorithmic implementation of a linear feedback shift register based encryption scheme is (much?) more secure against side channel attacks; why are hardware platforms usually used? I get ...
Me2's user avatar
  • 1
0 votes
0 answers
65 views

Can we be certain that Signal doesn't log metadata (e.g. message graphs)?

I know Signal uses public/private key E2E encryption to ensure it's impossible for them to read the contents of messages. WhatsApp does too, hence Signal's main attraction is that it additionally ...
Seán Healy's user avatar
0 votes
1 answer
75 views

Do I need to use unique IVs if all encrypted data is unique?

I am designing a service where each user has both a unique 256-bit private and public ID. These IDs should be derivable from one another, but only within the backend of my service (as to not expose ...
Ryan Hilbert's user avatar
1 vote
0 answers
60 views

Encryption + EUF-CMA => SUF-CMA

Does there exist a proof (paper reference welcome) that if a signature scheme is EUF-CMA, and the signatures are always encrypted, then the resulting signature scheme is SUF-CMA? That is: let SIG be ...
Mario's user avatar
  • 31
0 votes
0 answers
85 views

Prove CBC-MAC scheme is not secure

I have to prove the following variable length MAC scheme is insecure for an optional review. Let $\{F_{k}\}_{k \in \{0,1\}^n} : \{0, 1\}^n \rightarrow \{0, 1\}^n$ be a PRF family. scheme Mack(m) ...
Jaxon Steinhower's user avatar
0 votes
0 answers
113 views

Prove fixed length MAC scheme is insecure

I have to prove the following fixed length MAC scheme is insecure. Im not really sure how to approach this problem. Although I do know that for this specific problem keeping one of the blocks the same ...
Jaxon Steinhower's user avatar
0 votes
0 answers
51 views

Cryptographic Proof of Showing A Construction of PRGs is Also A PRG [closed]

Let G : {0,1}n → {0,1}2n be a PRG (for every n), and let s ∈ {0,1}n. Prove that the following construction is NOT a secure PRG. Gd(s): first run G(s) = x||y (where |x| = |y| = n−bits). Then run G(y) = ...
sangaCat's user avatar
9 votes
3 answers
2k views

What are advantages of chaos based image encryption methods over simply treating images as opaque bit strings?

For an exercise at uni I am tasked with optimizing the execution speed a chaos based image encryption algorithm 1. While I have taken an introductory class to information security, I never came ...
förschter's user avatar
0 votes
0 answers
18 views

IS this scheme secure (private P[M =m | C =c] = P[M=m] and correct P[m =m']) [closed]

Message space = {1,2} Key Space = {1,2,3,4} Cipher Space = {1,2,3} M * K = C So the relations are: 1 * 1 = 1 , 2 * 1 = 2 ,1 * 2 = 2 , 2 * 2 = 1 ,1 * 3 = 3 ,2 * 3 = 1 ,1 * 4 = 1 , 2 * 4 = 3 Thanks
Awesomeman123's user avatar
2 votes
2 answers
327 views

Is it possible to create a mix of predefined and generated shares for Shamir's Secret Sharing?

In standard Shamir's Secret Sharing schemes the shares are generated from randomly generated polynomials. I was wandering if it would be possible to create some predefined shares that a user would be ...
Euan's user avatar
  • 21
0 votes
1 answer
40 views

Devising a system that allows for aggregate computations but does not hold the single values

First of all apologies if this is not the right place. I am not very knowledgeable in cryptography but I thought you can at least point me in the right direction of research. The following is a toy ...
Gianpiero Cea's user avatar
2 votes
4 answers
166 views

Are there asymmetric encryption algorithms that preserve equality? Are they safe to use for data obfuscation?

I have a database table that needs to be shared between multiple parties. There is a sensitive column than must be obfuscated in a way that preserves equality relationships between records. A trusted ...
Erp12's user avatar
  • 123
3 votes
0 answers
43 views

Does the following variant of functional encryption exist?

For a (possibly complicated) function $f: X \rightarrow Y$, can we design a set of encryption scheme $Enc, Func\_Enc$ such that, for $\forall x \in X$, $$Func\_Enc(f) = g \text{ where } g \text{ is ...
Marc_12's user avatar
  • 41
2 votes
1 answer
66 views

The cost of the additive homomorphic encryption of McEliece cryptosystem

Let's have two integer-vectors $v_1$ and $v_2$ that are encrypted by McEliece public key. An intermediate node between the sender and receiver receives the two encrypted vectors $\text{E}(v_1)$ and $\...
Anas Ahmad's user avatar
0 votes
0 answers
45 views

Proving encryption scheme doesn't satisfy EAV

Hello I have a problem that asks to prove the following encryption scheme doesn't satisfy EAV security. Im a beginner in this field and I'd appreciate some help making a proof for this. The solution ...
Jaxon Steinhower's user avatar
-1 votes
4 answers
195 views

Enigma encryption

I know how an Enigma works and that the reflector means a current flow must return by a different route but my question is this. After returning from the reflector and through the rotors, it passes ...
Macolm's user avatar
  • 1
3 votes
2 answers
1k views

Can I change the radio frequency according to my encryption algorithm?

I know that information can be changed by changing the frequency of electromagnetic vibrations.My question is, can I change the frequency according to my encryption algorithm? That way I can get a ...
Hacer's user avatar
  • 33
5 votes
1 answer
203 views

What best to put in unused nonce bytes when using AES-GCM-SIV

I want to use AES-GCM-SIV for authenticated encryption of messages in my protocol. Since it is a wireless protocol I want to transmit as few bytes as possible. For successful decryption I need to ...
Karsten's user avatar
  • 151
0 votes
1 answer
62 views

Can HKDF be safely used as a round function in a Feistel Cipher

Hello my question is it practical to use HKD as a round function in a Feistel Cipher I know you should not roll your own crypto, this is for learning purpose's only. Take a look at my code and let me ...
dasein's user avatar
  • 3
0 votes
0 answers
69 views

hashing two inputs with a single encryption

I'm looking at hash function constructions that use ciphers. There are many which are analyzed in this paper: https://www.cs.ucdavis.edu/~rogaway/papers/hash.pdf but all of them assume that only a ...
David 天宇 Wong's user avatar
0 votes
1 answer
52 views

Chaos theory combined with RSA and/or other cryptosystems? [closed]

What are your thoughts on this? Are there any complications a designer of such a cryptosystem might face? Or, a better way to put it.. are there obvious drawbacks with chaotic functions when using ...
0xdeadbeer's user avatar
0 votes
0 answers
49 views

What should be passed as the authentication tag when creating a SealedBox? And can it be made public?

When creating a SealedBox, one of the parameters which needs to be passed is an authentication tag: https://developer.apple.com/documentation/cryptokit/aes/gcm/...
sudoExclamationExclamation's user avatar
0 votes
2 answers
51 views

What weaknesses are worth investigating in this non-linear matrix cipher?

I have an interesting cipher based on matrix products that I've not seen before. Given plaintext bytes $p\in[0,255]$, pad to a perfect square length and write into the entries of an $n\times n$ matrix ...
flinty's user avatar
  • 103
1 vote
0 answers
72 views

How to instruct VeraCrypt to use my hardware entropy source

As a hobby I built a radioactive decay based RNG, that I am still perfecting. I would like to know how to use its output to contribute to VC entropy pool for key generation. I know that before ...
Daniel Ivan Corti's user avatar
1 vote
1 answer
83 views

Is there any format-prolongation encryption?

Given plaintext $m$ of length $l_m = |m| > 0$ After encryption $E$ $$E(m) = c$$ we receive a cipher $c$ with an elongated length $l_c = |c| > |m|$ With decryption $D$ $$D(c) = D(E(m)) = m$$ ...
UncleBob's user avatar
-1 votes
1 answer
67 views

my ciphertext and original message look like they are two different sizes

The instruction wants them the ciphertext to be the same size as the original message. The original message is "alicexoxox:bobko0oo0l:popo" I am supposed to use openSSL cli to generate a key ...
pkob1's user avatar
  • 7
0 votes
0 answers
108 views

Prove the encryption scheme is not EAV secure

Hello I have the problem defined below and I need to prove the given encryption scheme is not EAV secure. I feel like I have most of the problem down but I'm not sure what the next step should be in ...
Jaxon Steinhower's user avatar
2 votes
1 answer
90 views

Keygen with timelock encryption so that the secret key is hidden from everyone?

I'm wondering if the following scheme (or something similar) can exist: I want to encrypt a randomly generate a public key and secret key pair, $(pk, sk)$. I would like that $sk$ is encrypted some ...
user1936752's user avatar
0 votes
1 answer
54 views

Cartesian Product Notation for Encryption and Decryption

I'm learning about encryption $(E)$ and decryption $(D)$ algorithms and am wondering what the following notation means, specifically the cartesian product for $E$ and $D$. $k$ represents key, $P$ ...
user314's user avatar
  • 103
1 vote
0 answers
104 views

In Symmetric encryption where Alice and Bob message each other, how can both decrypt the same data?

I first posted this question on StackOverflow but they told me it belongs here instead: https://stackoverflow.com/questions/77856486/in-symmetric-encryption-where-alice-and-bob-message-each-other-how-...
sudoExclamationExclamation's user avatar
0 votes
2 answers
100 views

AES CTR mode is insecure if key is chosen from a tiny keyspace

Given AES-128 with a 128 bit key, but the key is chosen such that its only last 16/32/48 bit are random rest are 0, how can i exploit this to know the key being used, given i have access to oracle ...
goose57's user avatar
  • 21
0 votes
0 answers
30 views

Does XOR of message $m$ with $\mathrm{Enc}$ leak any information?

Let's suppose that $(G,D,E)$ is a secure encryption scheme, that is, for any polynomial $p(n)$ and any sequence of messages $\{a_{n}\},\;\{b_{n}\}$ of length $p(n)$ $E(k,a_{n})$ and $E(k,b_{n})$ are ...
matheg's user avatar
  • 131
1 vote
0 answers
37 views

"Offline" Revocable Encryption, or something similar to it? [closed]

For context, I want to see how far I can go using YouTube as a (bad) cloud storage solution just because of sheer curiosity and kicks and giggles. In said journey, I came across the problem of ...
Jediweirdo's user avatar
2 votes
1 answer
76 views

How does SMB authentication work?

When I learned about the inner workings of the TLS protocol and what exactly it protects a connection against, I was surprised to learn that even asymmetric encryption can be defeated by a MITM attack ...
TrisT's user avatar
  • 151
1 vote
2 answers
308 views

Is it faster to decrypt than to encrypt in all cryptography systems? [closed]

I am using a cryptography system in which the Feistel structure and permutation cipher are combined. I am amazed by the result; decryption is so much faster than encryption. My system is working ...
Dharmendra Thapa's user avatar
1 vote
0 answers
60 views

Semantically secure public-key encryption scheme

Suppose that $(\mathrm{Gen},\mathrm{Dec},\mathrm{Enc})$ is a semantically secure public-key encryption scheme. I define $E' = (E(e,m)\oplus m)\parallel (E(e,m)\oplus e)$. Clearly, this is now not ...
matheg's user avatar
  • 131
2 votes
1 answer
156 views

How many encrypted messages can we know, so that scheme is secure?

Let $G$ be a secure PRG and let $s$ be a private key. We can define $\mathrm{Enc}(s,m) = G(s)\oplus m$. As long as we know only one encrypted message this scheme is secure, since $G(s)\oplus m \sim r\...
matheg's user avatar
  • 131
0 votes
0 answers
71 views

Is this particular encryption algorithm secure?

Suppose that $(\mathrm{Gen},\mathrm{Enc},\mathrm{Dec})$ is a secure encryption scheme. Encryption scheme is secure if for any two sequences $\{a_{n}\}_{n\in\mathbb{N}},\{b_{n}\}_{n\in\mathbb{N}}$ of ...
matheg's user avatar
  • 131
0 votes
0 answers
23 views

LLM-AI useful in chaffing?

Greetings from a newbie and crypto ignaramus. I hope that this is an appropriate forum for this question - please advise if not, or feel free to move it to another SE section. First heard of chaffing ...
cTen's user avatar
  • 1
1 vote
1 answer
102 views

Pitfalls of manual AES encryption for data transfer

Context I've used OpenSSL to encrypt some socket communications. I am however using some functionality from the windows API that prevents me from using OpenSSL's opaque builtin sockets, so I am ...
TrisT's user avatar
  • 151
0 votes
0 answers
144 views

Speed comparison of encryption algorithms

I am trying to compare various encryption algorithms in terms of encryption duration, decryption duration, information entropy, NPCR, UACI, and correlation coefficients. I used a Lena 256x256 ...
ysnky's user avatar
  • 1
1 vote
2 answers
157 views

Is this self algorithm made private key for Diffie-Hellman key exchange secure

i created a function in javascript that creates my a for the DH exchange like this: ...
Moritz Fesseler's user avatar
0 votes
0 answers
113 views

Finding bit positions of '1' in DES Encryption

In DES encryption, the IP table is shown. If the input given in hexadecimal is "0020 0940 0000 F008", which are the bit positions of "1" after the IP stage ?
Bassel 1000's user avatar
3 votes
1 answer
111 views

Judgment of Results from NIST Randomness Testing

I am using the NIST suite to test the randomness of binary numbers and I have a 64KB dataset. I am confused with the results in finalAnalysisReport.txt. I have the ...
yuting zhang's user avatar

1
2 3 4 5
95