Questions tagged [shuffle]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0 votes
0 answers

Achieving sub-block non-malleability

I have a noisy one-way communication channel where data is sent as a series of words of width n bits. Assume n is a constant roughly in the range of 16...48. I don't want bit errors in one word to ...
Stephan Walter's user avatar
1 vote
0 answers

Is this transposition cipher unbreakable?

Given a password as a seed for a Psuedo Random number generator and Fisher Yates Algorithm to shuffle bytes of a string to random places like Hello World to ...
Sprax's user avatar
  • 19
0 votes
0 answers

After ZK-shuffle, how can we let people who got the same number card know each other without letting anyone else know?

In mental poker, we can use ZK-shuffle to deal cards to the players such that the cards are kept private to each player ( Suppose we deal exactly one card to ...
Justin Zhang's user avatar
5 votes
2 answers

Deterministic shuffling algorithm

Is there a well know (cryptographically secure) algorithm to shuffle a vector of values, deterministically, without using any randomness, such that it is hard (or as hard as possible) to guess its ...
raugfer's user avatar
  • 161
1 vote
0 answers

Paillier cryptosystem for verifiable shuffles

I am looking for some algorithm or implementation on Pailler cryptosystem-based verifiable shuffles for mixNet. So far, all the verifiable shuffles and mixNet are available for ElGamal cryptosystems ...
Nomana's user avatar
  • 41
1 vote
1 answer

Are there on-line ways to use a block cipher to generate unique $n$ bits that guarantee collision-freeness for $2^n$ times?

$n$ is a run-time variable chosen each time the user runs the implementation. One way I can think is to use any block cipher, say AES, as a seeded CSPRNG to randomly shuffle list of numbers $0, 1, \...
caveman's user avatar
  • 563
1 vote
1 answer

Multiple attributes under shuffled differential privacy

Notation: eps_c (epsilon central), eps_l (epsilon local), n (number of users), d (number of attributes). A single attribute A_i may have |A_i|=r different values for i in [1,d]. Let's suppose each ...
hharcolezi's user avatar
2 votes
0 answers

Fisher Yates on "faulted" random number generator cryptanalysis

For the sake of curiosity and fun, i have implemented a C# program that operate as deck dealer on 40 cards deck (following the Fisher Yates shuffeling algorithm
Skary's user avatar
  • 361
3 votes
2 answers

What is the difference between a permutation and a shuffle (transposition cipher)

A non-cryptographic definition of a permutation is "2a: the act or process of changing the lineal order of an ordered set of objects. 2b: an ordered arrangement of a set of objects The Wikipedia ...
SAI Peregrinus's user avatar