Method for the generation of pseudo-random permutation of an N-digit word
First Claim
Patent Images
1. A method for the generation of a pseudo-random permutation of an n-digit word in which:
- a generalized Feistel scheme is implemented, wherein;
the round functions of the generalized Feistel scheme implemented are functions (Fi) such that;
the input words of the round functions are produced by the conversion of digit words into binary words, then a one-way function is applied to these binary words, finally, the output in digits is a function of these binary words. a digit word to be enciphered is read in a memory, the generalized Feistel scheme used comprises at least T=5 rounds.
0 Assignments
0 Petitions
Accused Products
Abstract
A method for the generation of small permutations on digits, for example between 7 and 30 digits, uses basic functions that are classic, one-way functions (generally non-bijective) defined on bits, and uses these functions in a generalized Feistel scheme that has at least five rounds.
-
Citations
10 Claims
-
1. A method for the generation of a pseudo-random permutation of an n-digit word in which:
-
a generalized Feistel scheme is implemented, wherein;
the round functions of the generalized Feistel scheme implemented are functions (Fi) such that;
the input words of the round functions are produced by the conversion of digit words into binary words, then a one-way function is applied to these binary words, finally, the output in digits is a function of these binary words. a digit word to be enciphered is read in a memory, the generalized Feistel scheme used comprises at least T=5 rounds. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
Specification