Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.

Questions tagged [symmetric]

Symmetric cryptosystems assume two communicating entities share a pre-established secret key.

57 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
10
votes
0answers
251 views

What was the BassOmatic cipher, and what made it so weak?

According to Wikipedia, this homebrew cipher was originally used in PGP, before Phil Zimmermann replaced it with IDEA. Supposedly, insecurities in the algorithm were pointed out to him, leading to ...
4
votes
0answers
127 views

Why are matrices so common in symmetric encryption?

Matrices have been used in symmetric ciphers since the Hill Cipher (before?) all the way up to modern ciphers such as Twofish and AES. I understand matrices can be invertible, therefore making them ...
4
votes
0answers
97 views

Creating an SPN cipher from ChaCha20 or Salsa20's double round function

Given that ChaCha20's building blocks have been also used to construct a hash function, can the double round function from either ChaCha20 or Salsa20 be used to construct a secure SP-network cipher? ...
4
votes
0answers
216 views

How to make a “zero knowledge” cache/key-value store

I'd like to use a possibly insecure cache for storing expensive-to-calculate sensitive information. My requirements are: If the cache ever gets compromised it should reveal nothing about its ids or ...
4
votes
0answers
153 views

Using machine-learning techniques for data-dependent operations in ciphers

From 'Methods of Symmetric Cryptanalysis' by Dmitry Khovratovich, The data-dependent operations are one of the most controversial design concepts. We say that an operation is data-dependent, if it ...
3
votes
0answers
99 views

What is the intuition behind the strength of unstructured symmetric cryptography?

Consider a single round of a cryptographic permutation, what is so special about it that lacking some bits of information that either get mixed into it as a subkey or omitted at the end (sponge ...
3
votes
1answer
129 views

How does the key agreement process take place in Virgil E3Kit SDK for end to end encryption?

I'm using Virgil E3Kit SDK to implement end-to-end encryption in my App. Their E3Kit SDK is very effective and not too hard to understand, but I still don't understand how does the key agreement ...
3
votes
0answers
120 views

Safely using ciphers that take small key sizes

Is it feasible to use triple encryption for block ciphers with the maximum keysize being the only significant security issue? I mean $C = E_{k_1}(E_{k_2}(E_{k_3}(P)))$ and $P = D_{k_1}(D_{k_2}(D_{k_3}(...
3
votes
0answers
177 views

Majority encryption algorithm?

Assume that I want to leave an encrypted message to a group of $n$ people in a way that they can only decrypt it if they work together in the following sense: For some fixed $k < n$ every sub-...
3
votes
0answers
366 views

LR-Oracle Experiment in Lindell and Katz

In reference to the LR-Oracle experiment in “Introduction to Modern Cryptography” (2nd edition) by Lindell & Katz, Definition 3.23 states a scheme $\pi = (Gen,Enc_K,Dec_K)$ is CPA secure for ...
2
votes
0answers
54 views

Extracting RC4 and 3DES keys from system memory

I have read papers [1], [2] that have presented techniques on extracting symmetric encryption keys from memory during the process of encryption. There are tools [3] that can extract AES keys from ...
2
votes
0answers
24 views

Symmetric encryption with partial knowledge of key

While reading Laurent Bussard's thesis, Section 4.5.1, p91 (p119 of the pdf) I wondered about the following paragraph (emphasis mine): the prover first picks a random symmetric key $k \in_R \{0, 1\}...
2
votes
0answers
71 views

Sharing salt for deterministic symmetric key derivation

I have a requirement to generate and share unique symmetric keys for a large numbers of small data objects. In many cases the storage and retrieval of the key for each object will be a significant ...
2
votes
0answers
252 views

The right way to encrypt sensitive data with an user password

I am developing something like 1Password and I want to be sure that method that I use is secure. Main idea of the app is storing user passwords, and is protected with a global master password. Main ...
2
votes
0answers
260 views

Bit slice format of 4x4 s-boxes?

I have studied bit-sliced implementation in SERPENT block cipher and I need to use this technique to implement some 4x4 s-boxes. I couldn't find any procedure to obtain bit-sliced format in any paper ...
2
votes
0answers
253 views

Rijndael - is there some difference in resistance between counter in generator input and in IV?

I am thinking about Rijndael implementation in order to store tokens (cannot be hashed) - one token for one user. And finally I get stuck with key/IV generation problem :( The questions are: 1) Is ...
2
votes
0answers
277 views

Asymmetric vs symmetric encryption

I am a beginner learning about encryption and I would like to ask a few questions, hoping this is the right place to ask, so please bear with me. We have Alice and multiple clones of Bob. Only Alice ...
2
votes
0answers
130 views

Common pitfalls of session key activation?

Assume that initiator $I$ and responder $R$ of a key agreement protocol have agreed on new symmetric session keys $K'_{auth}$ and $K'_{enc}$, e.g. by way of Diffie-Hellman and key derivation, possibly ...
1
vote
1answer
47 views

Encrypting multiple small messages with a single reused symmetric key

What is a good way of doing this? Practical and Secure. This is for a browser environment. For example, let's say there are a few 100 independent messages of about 100 characters each that you want ...
1
vote
0answers
41 views

statistical distance in symmetric-key encryption

Prove that for any symmetric-key encrytion scheme $\Pi=(Gen, Enc, Dec)$ with message space $M$ and key space $K$, there exist $m_0, m_1 \in M$ such that $\Delta(Enc(K, m_0), Enc(K, m_1))\ge 1-\frac{|K|...
1
vote
0answers
33 views

Are slide attacks effective if the primitive is sandwiched? And key schedule vs. Even-Mansour

Suppose you have a cryptographic permutation consisting of identical rounds, that makes it vulnerable to a slide attack. But if you sandwich it between two XORs of key material. Is it still vulnerable?...
1
vote
0answers
29 views

How do I calculate key rotation schedules?

tl;dr: How do I formulaically determine key rotation schedules for different kinds of keys and use cases? The organization I'm a part of for utilizes both symmetric and public/private key encryption ...
1
vote
0answers
40 views

Is it possible to enhance white-box cryptography security by homomorphic encryption?

Background: Let's discussed based on published symmetric white-box crypto only, such as Chow's white-box AES. I only know basic concepts/objectives of homomorphic encryption, such as PHE and FHE. ...
1
vote
0answers
206 views

Multi-Party Offline Key Exchange Using Public and Private Keys

I hope the title already explains the problem I have in mind; but let me lay out some more details. Given public-private key pairs $P_A, P_B, P_C, ... P_Z$, (first $3$ of which are owned by our usual ...
1
vote
0answers
125 views

Difficulty of finding partially matching ciphertexts for a given plaintext when encrypted with two different keys

I'm trying to find a simple, practical proof-of-work scheme based purely on encryption (due to wide availability of optimized, hardware accelerated AES execution on most platforms, including modern ...
1
vote
0answers
84 views

Decrypting partial message.

I'm wondering whether such interesting symmetric-key encryption exists or not (from theoretical perspective): We encrypt a vector of messages $(m_1,m_2,\cdots,m_\ell)$ using the symmetric key $K$ to ...
1
vote
0answers
135 views

zero knowledge messaging implementation

I understand that messages are encrypted using a symmetric algorithm such as AES, and the symmetric key is encrypted using an asymmetric algorithm such as RSA. In my particular implementation, the ...
1
vote
0answers
236 views

Algebraic Attacks against ARX

I have not seen much about algebraic attacks against ARX ciphers. How would ARX ciphers compare in algebraic security to AES or Present or Simon?
1
vote
0answers
35 views

To utilize asymmetric cryptography in symmetric manner - demand-of-security-definition?

Cryptography can largely be divided into two classes: asymmetric and symmetric. Like homomorphic encryption now greatly restricted in the asymmetric cryptography, the difference of asymmetric and ...
1
vote
0answers
58 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 ...
1
vote
0answers
51 views

Symmetric stream cipher, is it known?

I am thinking on a simple symmetric stream cipher. My first idea is the following: The key is a set of array of random bytes ($\underline{k}_1$ ... $\underline{k}_n$), whose length is $l_1$, $l_2$, .....
1
vote
0answers
76 views

Encryption with a known plaintext

I'm building an application where users can be a part of groups, and can obtain and distribute URLs from the group page that allow anyone who clicks on them to join said group. Groups should not ...
1
vote
0answers
209 views

CCA security of a system that splits messages and encrypts each packet

Propose a symmetric key based crypto-system for implementing a secure email system. This system is based on AES and CCA secure. Suppose that you have to encrypt a large message and that this message ...
1
vote
0answers
82 views

Plaintext-aware encryption for symmetric schemes?

The notion of plaintext-awareness is well-known for asymmetric encryption, but the notion seems to make sense for symmetric encryption as well. Is this a known concept?
1
vote
0answers
162 views

How to distribute symmetric key between $n$ entities?

If there are $n$ servers for broadcasting a symmetric key in such a manner that following holds: No server alone can find the key $K$ alone. Any two servers can pass $k_i$ and $k_j$ such that $K=f(...
1
vote
0answers
113 views

Types of cryptography

We have cryptography based on hard problems from number theory, like DDH. When we speak about symmetric cryptography with AES, a mode of encryption (CBC, ...), what is the type of problem ? What is ...
1
vote
0answers
25 views

Cryptography — with a semi-priveleged user in the middle — to prevent request-tampering with another server

I'm working on a chat server for a mobile app I am writing. I would like to use a different application server for non-chat related operations and another application for chat operations. I would ...
1
vote
0answers
402 views

El Gamal encryption scheme and symmetric encryption scheme

Consider the El Gamal encryption scheme, a symmetric encryption scheme (KG,E,D), and the following hybrid encryption scheme having an encryption algorithm that, on input a public key (G,q,g,h), where ...
1
vote
0answers
81 views

Is it feasible to break an encrypted and later encoded message?

A message is sent from a person to another. The plain message is first encrypted, even with a weak algorithm - say, DES. Then, the encrypted message is encoded with a simple substitution, which is ...
1
vote
1answer
167 views

Indistinguishability in the presence of an eavesdropper attack scenario

The property of Indistinguishability in the presence of an eavesdropper as described in the following experiment: (tract from: Introduction to Modern Cryptography) It must be interpreted as a ...
1
vote
1answer
136 views

Getting the Encryption Function From the Decryption Function + Decryption Key + Encrypted Item

Is it mathematically possible to always be able to get the encryption algorithm used to encrypt a certain item (file, number, text, ...etc.) by knowing the decryption algorithm that will be used to ...
0
votes
1answer
38 views

Two possible plaintext's using OTP decryption

I am using this cipher-text c = 04 10 12 00 01 08 67 0A 19 65 0F 03 0A 00 with two possible keys ...
0
votes
1answer
25 views

Security of key bits under indistinguishability for randomized encryption

My question is about symmetric randomized encryption. Let c=E(k,m,r) be a randomized block encryption function where r denotes a random input chosen for each message block m. k and c denote the ...
0
votes
0answers
38 views

Authenticating without sending password to the server, and store data encrypted with password derived key on server

I am trying to think of a scheme that would allow a user to authenticate to a server, whithout sending the password to the server, and to also derive a symetric key on the client (that also never gets ...
0
votes
0answers
32 views

Term for non-ARX symmetric-key cryptographic primitive design strategy

What's the term for describing designing symmetric-key cryptography primitive out of bitwise operations and shifts and rotations? The closest thing I've found is this Keccek team's page calling it ...
0
votes
0answers
70 views

AES encryption question

If we consider the generation of keys as $$\begin{aligned} K_0 &= E_K(IV); \\ K_{i+1} &= E_{K_i}(A) \end{aligned}$$ Where A is a block of zeroes, and the ciphertext blocks are computed as ...
0
votes
0answers
47 views

Symmetric Key Encryption with the key a seed

Would it be feasible to give two parties a seed to generate random numbers? So that when they want to send data to each other they send the correction on the random number generated? The random ...
0
votes
1answer
43 views

Randomly initialised global counter used to encrypt the kth message with IV = IV + k mod 2^n

The use of an increasing IV is not secure for a block cipher. That is, using a random IV for the first message then IV + 1 for the second , IV + 2 for the 3rd etc. How can I construct an attack to ...
0
votes
0answers
54 views

How can a node establish pairwise shared key with other nodes using its own polynomial share together with other's public values?

A server has a symmetric bivariate polynomial $ F(x, y) = \sum_{{i,j}=0}^{t-1}a_{i,j}x^iy^j$ $\in GF(p)[X, Y] $ of degree $t-1$. For simpliciy, $ F(x, y) = a_{0,0}+a_{1,0} x+a_{0,1}y+ a_{1,1}xy$ mod ...
0
votes
0answers
24 views

What are dual codes and the codewords denoted by these dual codes in terms of trace?

I am currently reading a research paper (linked below) that mentions "Consider only maps that vanish at 0, their short codes $C_f$ and their duals $C_f^\perp$. The duals can be written as $C_f^\perp = ...