# 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.

826 questions
Filter by
Sorted by
Tagged with
27 views

### Which algorithm is preferred $A$ or $B$? [closed]

Let me recall that $O(n^{\alpha})$ ($\alpha > 1$) is called polynomial time. I read in many places that polynomial time algorithms are most efficient. Suppose I have two algorithms $A$ and $B$ in ...
21 views

### Something like restricted multikey system?

Imagine there are $n$ parties and me. I want to give them each their own secret $b$ bits. So, $nb$ bits in total. They are not supposed to share their secrets. I want them to be able to reconstruct (...
• 115
82 views

### RSA Big prime picking [closed]

Is the random picking of big n-bits random numbers for primality test a time sensitive operation? If so, would an heuristic for limiting the search space (about 5-10x) without missing out on any prime ...
• 103
14 views

### What non-trivial benefit does including a "context"/"signer info" provide in SM2-DSS and EdDSA?

While implementing SM2 DSS and reading RFC-8032 for EdDSA, I noticed that, both families of schemes provide provisions for including a "context" (in EdDSA) or "signer info" (in SM2 ...
• 6,621
50 views

### What is the methodology for selecting symbol bit length and window size when performing Shannon Entropy Analysis?

When performing Shannon Entropy analysis on something like an RNG or a file, you must: Select a symbol bit length and number of samples would will perform analysis on at a time (IE: windows size) ...
• 183
252 views

### Which is the smallest, cyclic in 3 directions, consistent structure of random values which can be hidden at the adversaries machine? (some comparison)

Or more general each member can be part of up to three 2D locally euclidean planes of 2 different dimensions each. (each of those planes is cyclic in two orthogonal directions, like a torus) Given ...
• 475
66 views

### Using PRF as a building block to build other primitives?

I am doing an independent research in cryptography. I have designed a post-quantum secure pseudo random function. Just constructing a PRF will not help me to publish in reputed journals. I was ...
27 views

### Algorithm that solves a system of linear equations over finite fields when a parameter is needed

I was reading Kipnis' and Shamir's paper on Cryptanalysis of the HFE Public Key Cryptosystem by Relinearisation and I wanted to implement the example at the end in Octave without using any additional ...
367 views

### Difference between FFT and NTT

What are the main differences between the Fast Fourier Transform (FFT) and the Number Theoretical Transform (NTT)? Why do we use the NTT and not the FFT in cryptographic applications? Which one is a ...
• 365
1 vote
39 views

### Is there something like a node network with more than 2 edges/neighbors in cryptography/encryption?

Many types of encryption can be generalized as using a message $m$ and a key $k$ as input of an encryption function $f$ with a cipher $c$ as output. $$f(m,k)=c$$ As a node graph this could look like ...
• 475
1 vote
63 views

1 vote
45 views

### Single-party encryption, multi-party and single-party decryption

Let’s say person A encrypts a message. Now I want both person A and persons B, C, D – A as a single individual – and B, C, D only as a group, to be able to decrypt the encrypted message. The ...
• 13
2k views

### Cryptographically safe lookup of value in a set

I'm looking for an elegant solution to the might-seem-trivial problem of looking up for specific value in a known set of values without disclosing what value we look for. Let me describe it in a ...
• 266
1 vote
76 views

### Understanding the algebra behind GCM's security

I would like to understand the algebra behind GCM's security. Before I ask my questions, let me state my understanding of the math behind GCM. If correct, my questions are at the end; if incorrect, ...
• 135
1 vote
75 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 ...
• 523
75 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 ...
1 vote
77 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 ...
• 97
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 ...
• 475
1 vote
48 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 ...
• 271
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$ ...
• 186
47 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 (...
• 117
45 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 ...
• 969
29 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 ...
• 475
62 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 ...
• 475
1 vote
44 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 ...
• 111
140 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 ...
158 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 ...
126 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
162 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 ...
• 6,621
1 vote
62 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 ...
• 21
57 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?
82 views

• 475
115 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.
• 11
168 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 ...
• 711
1 vote