Skip to main content

All Questions

Tagged with
0 votes
1 answer
52 views

Is a salt necessary when using a key and an intialization vector during encryption?

I use OpenSSL to encrypt passwords. For that the parameters - $S $ salt, $K$ key, $IV$ initialization vector are used. Although the command produces the results, I am not sure if the salt is really ...
Bionix1441's user avatar
0 votes
0 answers
34 views

Is the CFB mode of Encryption related-key secure

I am going through the paper https://www.iacr.org/archive/fse2013/84240283/84240283.pdf where the related key security of CBC mode of encryption is well analyzed. I am concerned about whether the CFB ...
Crypto_Lover's user avatar
1 vote
1 answer
81 views

Shannon's Perfect Security for Asymmetric Encryption

I have the following definition of Shannon's Perfect Security. Assuming messages and keys are drawn randomly from some distribution then: The probability of guessing plaintext m is not enhanced by ...
revision's user avatar
0 votes
1 answer
101 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
226 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
2 votes
1 answer
612 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
4 votes
11 answers
9k views

For Symmetric Cryptography, why is it considered more important to safeguard a key than the function/algorithm for encrypting/decrypting a message?

As stated for the question above here's an analogy: You are a robber looking for a house to rob with two different scenarios that might occur. 1. You have a key that you know belongs to a house and ...
omar7439's user avatar
1 vote
1 answer
51 views

Does any encryption/decryption algorithm supports linear decomposition?

I am not sure whether "linear decomposition" is appropriate to summary my question: We know that the traditional symmetric encryption/decryption algorithm (like AES, TDES) can be written as: ...
ZKM's user avatar
  • 13
1 vote
1 answer
75 views

Fully-encrypted (non-fingerprintable) symmetric encryption algorithm?

I am a student in the process of creating a firewall circumvention program based on smuggling data inside of legitimate HTTP. I have limited cryptographic knowledge. I need a way to encrypt my higher-...
Temporary Alternate's user avatar
0 votes
0 answers
44 views

Symmetric and asymmetric encryption using the same encryption/decryption algorithm?

If we use the following notation: $$C = E(P, K_e)$$ $$P = D(C, K_d)$$ Where: $$E(), D(), C, P, K_e, K_d$$ are the encryption algorithm, decryption algorithm, ciphertext, plaintext, encryption key and ...
ESCM's user avatar
  • 101
1 vote
0 answers
152 views

Issue with AWS Encryption SDK for JavaScript in Browser: 'Buffer is not defined' [closed]

I'm trying to implement AWS Encryption SDK for JavaScript in a browser environment within a React application. When I attempt to construct an instance of the encryption client using buildClient ...
CreativeDesign's user avatar
0 votes
1 answer
214 views

Is a pseudorandom function (PRF) also a one-way function (OWF)? If yes, how can we proof that a PRF $f_k$ is a OWF? If no, what is the closest work?

Let $f_k$ be a PRF. We claim that $f_k$ is a OWF. PROOF let $f_k$ is not a OWF, there exists a $PPT$ algorithm $A$ that can invert $f_k$ with non-negligible advantage. Even if we know the input $x$ ...
DP2040's user avatar
  • 73
2 votes
0 answers
55 views

NIST statistical tests [duplicate]

I'm having trouble testing a not-so-popular algorithm that I haven't found an implementation of, so I wrote it myself and now I'd like to test it with nist tests, but I have a suspicion that I'm doing ...
wxist's user avatar
  • 143
1 vote
0 answers
50 views

Can new decryption keys be issued without modifying the encrypted contents? [closed]

I'm curious if there's an encryption scheme where content may be encrypted to a public key where the associated private key can generate new decryption keys for the same content. The goal is to ...
Kai's user avatar
  • 11
2 votes
1 answer
90 views

In AES, why do we multiply the columns by a polynomial with a repeating coefficient?

In the MixColumns step of AES, one multiplies each of the columns of the $4\times 4$ box of bytes by the polynomial $a(x)=\{03\}x^3+\{01\}x^2+\{01\}x+\{02\}$ (modulo $x^4+1$). But in this polynomial, ...
Joseph Van Name's user avatar

15 30 50 per page
1
2 3 4 5
18