Questions tagged [algorithm-design]

Design of cryptographic primitives (algorithms), like block ciphers, stream ciphers, random-number generators, hash functions, MACs, key exchanges, public-key encryption or signature schemes. Also tag with the relevant type of primitive. If you ask about a known existing algorithm, also tag with its name.

Filter by
Sorted by
Tagged with
1
vote
1answer
51 views

Converting a 32-bit ARX cipher to a 64-bit one, should the rounds be increased?

I read about using 64-bit words in PRF functions. I want to convert the 32-bit ARX cipher Chacha into a 64-bit version, with key/block size of 1024-bits (512*2=1024-bits) My question is: Should I add ...
0
votes
0answers
34 views

Objective block cipher round function measures of security

One issue that may arise when attempting to evaluate the security of a round function for a block cipher is that the analysis of the round function does not treat the round key space and the message ...
0
votes
0answers
78 views

What are the vulnerabilities in this algorithm?

Bob and Alice sets common keys for a and b variables. All variables are equal length. Every message x and y variables are randomly changes ...
1
vote
1answer
54 views

Using one seed to create signing key pair and encryption key

I'm working on creating a secure digital vault. I'm using mnemonic to generate a seed. The seed is used to generate a signing key pair for identity verification. However I want to also encrypt the ...
5
votes
1answer
1k views

Can a series of triangle reflections be used for cryptography?

(I guess no but why is this the case? Any way to make it possible?) Out of a given equilateral triangle T1 (with his 3 vertices A,B,C lying in a finite Field $\mathbb F_N^D $) another equilateral ...
3
votes
0answers
42 views

Algorithmic game theory and protocol design for communication

There is a field of exchanging information that combines cryptography and game theory. I am interested in understanding this field, but it's a little complex for me. To begin with there is a paper of ...
6
votes
2answers
3k views

Can we use LEGO bricks to construct a cipher algorithm?

I read a paper titled "On the entropy of LEGO", which explains how to calculate the number of ways to combine $n$ $b\times w$ LEGO blocks of the same color. For example, six $2\times4$ ...
0
votes
1answer
32 views

BA protocol soundness explanation

I was reading the following paper BA-made it trivial and when talking about BA agreement protocol in page 3, I didn't understand what it meant by soundness here. A protocol P is an arbitrary-value (...
0
votes
0answers
42 views

Is it better to XOR rounds or just to make round by round in cipher?

Let's consider we have keyed PRNG's and we want to build a cipher. What is better: to xor let's say ten such generators with some input as a plaintext (every generator got different key, but the same ...
0
votes
0answers
24 views

Besides block-cipher which other methods can only be computed step-by-step even with known secret (but fast per step) and can be inverted?

Depending at the cryptographic function used applying it $i$-times to a given input can be computed in different complexity classes (based at their input size). $$f^i(m_0) = c_i$$ For example for most ...
0
votes
0answers
49 views

How can a concatenation of $N$ block-cipher with known keys be more secure?

General problem / Intro: encrypting the (computable) relation in between two random numbers which are members of a as small as possible set while anything except the order of execution is known to the ...
1
vote
0answers
42 views

Hash function producing cycles with expected max length

Is there a known hash function $H_k: X\to X$ such that: $\forall{x\in{X}},\exists{n\in{\mathbb{N}}}, n<k \land H^n(x)=x$ === EDIT === By hash function I mean ...
2
votes
1answer
132 views

How do we pick random elements in cryptography?

While reading papers on cryptography, a lot of time I have seen that people pick random elements $x\in \mathbb{Z}^*_q$ to do something (like setting secret key and all). How does one randomly pick ...
4
votes
2answers
143 views

What would be the requirements for a new-age cipher standard?

While nowhere near being broken, AES has known attacks like reading from the substitution table, memory-based attacks, etc. If we keep getting better at breaking ciphers and we eventually get close to ...
2
votes
1answer
112 views

Hash functions, bijectiveness, and entropy

For those who don't know, a bijective function is one for which each input yields one and only one output. A block cipher, for example, is guaranteed to be bijective or you could not decrypt. When a ...
1
vote
1answer
140 views

Is it possible to create a Dilithium Prime or Falcon Prime?

In the NTRU Prime submission, principle author, the well-known DJB is adamant that [the] primary objective [of NTRU Prime] is to eliminate unnecessary complications in security review So much so, to ...
1
vote
2answers
49 views

RC6 Integer operations in modulo 32 between two 32-bit blocks

I am new to cryptography and I am trying to code the RC6 (Rivest cipher 6) algorithm. The algorithm requires addition, subtraction and multiplication in modulo 232. If I am performing these operations ...
0
votes
1answer
30 views

Is there any link between group signature and multi-signature

Are both of these concepts related in someway. Can a group signature scheme be transformed into a multi-signature scheme?
0
votes
1answer
67 views

Understanding non-linearity in Salsa20 over various rings

In his design of Salsa20, Bernstein writes to ensure non-linearity he chose 32-bit addition (breaking linearity over $Z/2$), 32-bit xor (breaking linearity over $Z/2^32), and constant-distance 32-bit ...
3
votes
2answers
45 views

How are the instantiations of RSAES-OAEP and SHA*WithRSAEncryption different in practice?

For the spare-time project I had been working on, I'm evaluating the PKCS#1 padded RSA schemes for implementation. For PKCS#1 v1.5, encryption doesn't seem to require a hash function, and the ...
1
vote
0answers
75 views

Encryption of data with multiple possible decryption keys

I'm new to the Cryptography Stack Exchange, so my question might be very naive. What encryption algorithms are out there that will allow different decryption keys to decrypt the same piece of ...
1
vote
1answer
76 views

Extracting genome from a Ciphertext [closed]

Is it Probable to extract the ciphertext's genome and Visualizing it ? Converting this: ...
16
votes
3answers
10k views

How Unique is a "NeuralHash"?

I was doing some reading today about a major tech company planning to implement a new system for automatically detecting and reporting CSAM in users' photos. Overall, the system as described in their ...
3
votes
2answers
352 views

Recognize whether two random values are raised to the same power

Alice selects two random numbers from a finite field $Z_p$ : $a$ and $b$. Bob does one of the two following steps randomly (sometimes he does step 1; sometimes step 2): He chooses a random number $r$ ...
1
vote
1answer
54 views

How do we say that one cryptographic primitive is stronger than another?

Can anyone help me understand this: How do we say that one cryptographic primitive is stronger than another?
1
vote
0answers
83 views

What motivated CCM's monstrous design?

The formatting function in Appendix A of NIST-SP-800-38C is a monster enabling CCM to support variable-length nonce from 7-13 bytes, variable-length encoding of the length of the payload. Also, the ...
0
votes
0answers
52 views

Are there any block ciphers (like AES) which are (or can be) commutative under composition for different keys?

Let $BC$ be a block cipher with similar security as AES (in ECB mode). This $BC$ is applied to a message $m$ of same bit size. The result is a cipher $c$. e.g.; $$BC(key_A,m) = c_A$$ $$BC(key_B,m) = ...
-1
votes
1answer
74 views

Padding and the MD5 algorithm

In MD5, if M=100, how can we perform padding on it and how many blocks are needed in each round? These are general questions for understanding padding and rounds.
3
votes
3answers
155 views

Can you create an encryption algorithm from a signing algorithm, or vice versa?

I remember reading, a few years ago, that you couldn't prohibit encryption without prohibiting signing, as you can always make a public key encryption algorithm from a signing algorithm. (It might be ...
1
vote
1answer
20 views

crypt algorithm by a vectored key and the error is Proportional to the difference between input key and real key

I want to find an crypt algorithm which provides the functionality described below. Given a key (a vector Vkey) and a data (an image), use this key to encry the image; the encrypted image can not be ...
1
vote
0answers
58 views

Key stream instead of key schedule

Let's consider a block cipher in CTR mode. And let's consider a keyed PRNG or just a good PRNG with a seed as the key. The PRNG has to be very fast. Is it a good idea to put away the key schedule and ...
0
votes
0answers
32 views

Test vectors for SIT -encryption algorithm?

Test vectors for SIT -encryption algorithm? I'm looking for Tests Vectors to test my implementation of SIT. Thanks a lot.
0
votes
0answers
31 views

Advantages of round function as a good PRNG

If round function in block cipher is a good PRNG, does it have any advantages? Can we expect better faster diffusion or confusion? Does it make sense to design algorithms in such a way that the round ...
1
vote
4answers
229 views

Are there any cryptographic algorithms, which lets the user apply some modifications on the encoded data, without decoding it?

I would like to encode some data with a key, and send it to a third party. They don't know the key to decode it, but I would like to make it possible for them to apply some modifications on it. Then ...
0
votes
2answers
207 views

What is the name of this public key encryption cryptosystem?

I have been trying to find the name of a public key encryption cryptosystem that I learnt as an introduction to cryptography some years ago but the only scheme I could find was something similar but ...
0
votes
0answers
24 views

Few questions about setting up SuperCop primitives

Have a couple of questions about the supercop library. I've refrained from asking this question for a considerable amount of time because every time I thought about asking it, it sounded stupid in my ...
2
votes
1answer
89 views

How to produce a ternary value (3-face "dice roll") digest from a message?

Apologies in advance if the terminology I am using in the title of this question, is flawed. I want an algorithm that will produce a ternary value (meaning from a set of three, as opposed to from a ...
-2
votes
1answer
99 views

Writing an original encryption algorithm [closed]

Firstly, I'd just like to clarify, I am less than a beginner when it comes to cryptography. Please bear with me. I'm sure its flawed I just don't know how. I was bored one day, and decided to come up ...
2
votes
1answer
145 views

Does a bigger key mean more security - if we do not change the structure of the algorithm?

Let's say I have 128-bit cipher in which each round needs to get 768 key bits. Let's consider 10 rounds. It can be easily 128-bit key cipher. I can do key schedule and produce 7680 bits of keys (let's ...
0
votes
2answers
138 views

Encrypting cryptocurrency seeds for cold storage

I’d like some feedback on an encrypting algorithm. I’m not rolling my own, but even putting together well-proved pieces may create many pitfalls. (I don’t know if I'm stretching questioning in this ...
1
vote
3answers
125 views

How can a recipient recognize which encrypted messages are intended for them?

Let's say there's a decentralized email service where parties' public keys are known. A sender sends a message to a recipient by encrypting via RSA with the recipient's public key and posting the ...
3
votes
2answers
96 views

Using $key^{th}$ multiple of $\pi$ as a one-time pad

With a key $k$ of sufficient length, say 128 bits, is it possible to use $k^{th}$ multiple of $\pi$ as a one-time pad? Please enlighten on the security as well as practical aspects (only if secure of ...
0
votes
1answer
77 views

Why computation of $u*v^3*(u*v^7)^{(p-5)/8}$ is suggested instead of $(u/v)^{(p+3)/8}$

Working with Curve25519 I've faced with suggested form of computation square root candidate as: $uv^3(uv^7)^{\frac{p-5}{8}}$ instead of $\left(\frac{u}{v}\right)^{\frac{p+3}{8}}$. Why it is so? Or why ...
2
votes
0answers
60 views

Is there any way to encrypt the path in between a small number of 3D positions?

Or more general: given two valid random cipher $c_0, c_1$ a function $D$ with $$D(c_0,c_1) = (a,b,c)$$ should exist but hard to compute (for most cases). The result $(a,b,c)$ represents the path from $...
2
votes
1answer
70 views

Is there any block-cipher, format-preserving or similar encryption method with known cycle size? (without short-cut, with known source/runtime vars)

E.g. given a $n$-bit message $m_0$ and an encryption function $f$ After applying the function $c$ times it will result in $m_0$ again. $f^1(m_0) = f(m_0) = m_1$ $f^2(m_0) = f(f(m_0)) = f(m_1) = m_2$ .....
2
votes
0answers
70 views

Is this "AND" implementation safe against side channel attacks?

I found out that the following is a working implementation of calculating an AND function between XOR masked shares, implementation at Github. It works by calculating parities, whose terms cancel each ...
0
votes
1answer
58 views

Can Hash Functions take fixed-size input?

I‘ve argued for quite some time with a friend about wether or not this C# method can be qualified as a Hash Function. ...
5
votes
2answers
324 views

Recommendation of lightweight RNG for Miller-Rabin primality test

Miller-Rabin tests the compositeness of candidate numbers (hence, input $x$) that's often used as a primality test. The M-R test requires different random numbers for accuracy and confidence in the ...
2
votes
1answer
92 views

Building a 4-bit S-box with a 4-uniform DDT

I am looking for a 4-bit S-box which has only 4s in its difference distribution table (except the top left corner) but I was not able to find one in the literature. Has such an S-box been already ...
1
vote
2answers
244 views

Question about SSH host key algorithms

I'm currently writing a report for my Master's degree on the SSH protocol. Quite interesting! However I'm having trouble getting into the inner workings of the host key algorithms. For example, ...

1
2 3 4 5
17