31 results about "Pseudorandom permutation" patented technology

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.

Generating a random permutation by arranging a sequence N numbers in a matrix, performing random arrangement operations on the rows of the matrix to generate an intermediary matrix, performing random arrangement operations on the columns of the intermediary matrix to generate a second intermediary matrix, and arranging the N numbers of the second intermediary matrix as a rearranged sequence of the N numbers.

The invention discloses a method for detecting the randomicity of a pseudorandom sequence based on random permutation, which belongs to the field of detection and mainly solves the problems of limitation and onesidedness existing in the traditional randomicity detection method. A series of random permutation processing, such as inversion or negative or random interleaving, is carried out on a sequence to be detected; statistics is carried out on an inverse sequence or a negative sequence or a random interleaving sequence obtained after the random permutation processing by a Cramer-von Mises detection method, a statistical value corresponding to the sequence is obtained, and the statistical value corresponding to the sequence is compared with a selected standard statistical value; if the statistical value is smaller than the standard statistical value, the sequence to be detected meets random properties; and contrarily, the sequence to be detected does not have the random properties. The invention enables the randomicity detection of the pseudorandom sequence to be more comprehensive in a detection result and can be applied to the fields of secret communication, aerospace, distance measurement, cryptography and automatic control.

The present invention provides a particle-based data security protection method, comprising: step S1: obtaining a group of plaintext data; step S2: preprocessing the plaintext data to obtain plaintext group data; step S3: performing the first forgery on the plaintext group data Obtaining permutation data by random permutation; step S4: performing block encryption on the permutation data to obtain block encryption data; step S5: performing second pseudo-random permutation on block encryption data to obtain ciphertext data. The particle-based data security protection method of the present invention reduces the probability of secret stealers stealing and restoring valid information, and improves the security of data transmission.

The invention discloses a cloud outsourcing privacy set comparison method and a cloud outsourcing privacy set comparison device, which relate to the field of communication technologies, and are used for solving the problems that security cannot be guaranteed, and the practicality and extendibility are not high existing in the existing outsourcing privacy set comparison protocol. The cloud outsourcing privacy set comparison method comprises the steps that: a first server receives a random number ri and a first ciphertext sent by a terminal, converts the first ciphertext into a second ciphertext and sends the second ciphertext and the random number ri to a second server; and the first server receives a second server random number r<S2> and a third ciphertext fed back by the second server, converts the third ciphertext into a fourth ciphertext and sends the fourth ciphertext and the second server random number r<S2> to the terminal, wherein the second server adopts a second server secret key K<S2> to obtain a pseudo-random permutation of a terminal set and calculates an intersection set of the pseudo-random permutation, the third ciphertext comprises the intersection set of the pseudo-random permutation of the terminal set and a pseudo-random function of the second server secret key K<S2>, and the fourth ciphertext comprises the intersection set of the pseudo-random permutation of the terminal set and a pseudo-random function of a terminal secret key Ki.

A system and method for pseudorandom permutation for interleaving in wireless communication is disclosed. In one embodiment, the method comprises receiving a first ordered sequence of communication symbols having a first order, permuting the first ordered sequence of communication symbols to generate a second ordered sequence of communication symbols having a second order, and outputting the second ordered sequence of communication symbols, wherein the second order is based, at least in part, on a third order having a greater size than the second order, the third order being a pseudorandom permutation defined by the input-output relationship Y = mod ⁡ ( m * S * ( S + 1 ) 2 , P ) , wherein P is the smallest power of two not less than the number of elements in the first ordered sequence, S is an input order represented by a sequence of consecutive integers from zero to P−1 in increasing order, Y is an output order represented as a sequence of integers, and m is an integer.