CN109039533B - Method and device for generating pseudorandom time-varying interleaving parameters - Google Patents

Method and device for generating pseudorandom time-varying interleaving parameters Download PDF

Info

Publication number
CN109039533B
CN109039533B CN201810615093.7A CN201810615093A CN109039533B CN 109039533 B CN109039533 B CN 109039533B CN 201810615093 A CN201810615093 A CN 201810615093A CN 109039533 B CN109039533 B CN 109039533B
Authority
CN
China
Prior art keywords
interleaving
seed
pseudo
parameters
parameter
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810615093.7A
Other languages
Chinese (zh)
Other versions
CN109039533A (en
Inventor
贺俊文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan Andi Technology Industrial Co Ltd
Original Assignee
Sichuan Andi Technology Industrial Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sichuan Andi Technology Industrial Co Ltd filed Critical Sichuan Andi Technology Industrial Co Ltd
Priority to CN201810615093.7A priority Critical patent/CN109039533B/en
Publication of CN109039533A publication Critical patent/CN109039533A/en
Application granted granted Critical
Publication of CN109039533B publication Critical patent/CN109039533B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • G06F7/582—Pseudo-random number generators
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds

Abstract

The invention discloses a method and a device for generating a pseudorandom time-varying interleaving parameter, wherein the method for generating the pseudorandom time-varying interleaving parameter comprises the following steps: inputting data into an interleaver, loading a seed interleaving parameter, calculating a pseudorandom cyclic shift parameter, calculating a derivative interleaving parameter, interleaving the input data, judging whether cascade interleaving is finished or not and outputting a result; the device for generating the pseudo-random time-varying interleaving parameter comprises: the device comprises a seed interleaving parameter loader, a pseudo-random number generator, a cyclic shifter, an interleaver and a controller. The invention is helpful to improve the safety of the interweaving encryption method.

Description

Method and device for generating pseudorandom time-varying interleaving parameters
Technical Field
The invention relates to the technical field of communication information processing, in particular to an information encryption method based on pseudorandom time-varying interleaving coding, and specifically relates to a method and a device for generating pseudorandom time-varying interleaving parameters.
Background
Interleaving coding is an important information coding technique and is often used in conjunction with forward error correction coding to correct bursty errors. The basic principle of interleaving coding is as follows: assume that for the set Z {1,2,3, …, L }, there is a one-to-one mapping pi from Z to Z, such that
j ═ pi (i) i, j ∈ Z ∞ i not all equal to j.
Definition of
π＝{π(i)|i＝1,2,3,…,L}
Is an interleaving parameter. If it is not
i＝π(i)
Then i is called the motionless point. Suppose the kth incoming data packet
Figure GDA0002883216080000011
And the kth output data packet
Figure GDA0002883216080000012
Are all L, i represents an element
Figure GDA0002883216080000013
In an incoming data packetThe address in (i.e., the address before interleaving), pi (i) denotes an element
Figure GDA0002883216080000014
The address in the output data packet (i.e., the interleaved address). Then operate
Figure GDA0002883216080000015
I.e. grouping the input data according to the interleaving parameter pi
Figure GDA0002883216080000016
And performing interleaving coding.
From the above analysis, the essence of interleaving coding is to reorder the elements in the input data packet without changing the element values and packet length. Thus, as long as DinIf the elements in (1) are not identical, D can be obtained by properly designing the interleaving parametersout≠Din. As can be seen, interleaving has the potential value of scrambling and encrypting packet data.
However, the above interleaving encoding scheme is not suitable for encryption encoding because its interleaving parameters are fixed. Interleaving encryption of multiple data packets using the same set of interleaving parameters is equivalent to multiple times of encryption using a fixed encryption scheme. According to the theory of modern cryptography, this way of encryption is not secure. One of the solutions is to use time-varying interleaving parameters, i.e. for each data packet
Figure GDA0002883216080000023
Using a different set of interleaving parameters pik. The interleaving parameters should be pseudo-random over time based on security requirements and the feasibility of de-interleaving.
SUMMARY OF THE PATENT FOR INVENTION
In order to solve the above problem, the present invention provides a method and an apparatus for generating a pseudorandom time-varying interleaving parameter. Based on the calculation indistinguishability of the pseudo random number and the true random number, the method can generate the pseudo random interleaving parameter which has the calculation indistinguishability with the true random interleaving parameter, thereby improving the safety of the interleaving encryption method.
In order to realize the purpose of the patent of the invention, the following technologies are adopted:
a method for generating pseudo-random time-varying interleaving parameter assumes that the interleaving depth is L and the natural sequence address is pi0N sets of fixed seed interleaving parameters pi are pre-designed {1,2,3, …, L }seed,n(N-1, 2, …, N), calculating the k-th set of pseudo-random interleaving parameters pikThe method is characterized by comprising the following steps:
step 1): inputting data p to an interleaverk,nWhen n is 1, pk,1＝π0(ii) a When N is 2,3, …, N, pk,n＝πk,n-1Wherein, isk,n-1Is the result of the (n-1) th stage of interleaving operation;
step 2): loading seed interleaving parameters, and for the nth stage interleaving operation, loading the nth group of seed interleaving parameters pi by using a seed interleaving parameter loaderseed,nLoading to a cyclic shifter;
step 3): calculating a pseudorandom cyclic shift parameter sk,n；
Step 4): calculating derived interleaving parameters, and cyclic shifter shifting parameters s according to pseudo-randomk,nInterleaving parameter pi to seedseed,nPerforming cyclic shift to obtain derived interleaving parameters
Figure GDA0002883216080000021
Step 5): interleaving the input data, the interleaver interleaving the input data according to the derived interleaving parameters
Figure GDA0002883216080000022
For input data pk,nInterweaving to obtain the result of n-th-stage interweaving operationk,n；
Step 6): judging whether the N-level cascade interweaving is finished or not, if not, returning to the step 1); if the process is finished, outputting the obtained kth group of pseudo-random interleaving parameters pik＝πk,N。
An apparatus for generating pseudorandom time-varying interleaving parameters, the structure comprising: the device comprises a seed interleaving parameter loader, a pseudo-random number generator, a cyclic shifter, an interleaver and a controller;
the seed interweaving parameter loader is sequentially connected with the cyclic shifter and the interweaver and is used for loading the pre-designed seed interweaving parameters;
the pseudo-random number generator is sequentially connected with the cyclic shifter and the interleaver and is used for generating pseudo-random cyclic shift parameters;
the cyclic shifter is connected with the interleaver, and the cyclic shifter performs cyclic shift on the seed interleaving parameters according to the pseudorandom cyclic shift parameters to obtain derived interleaving parameters;
the interleaver interleaves the input data according to the derived interleaving parameters output by the cyclic shifter;
the controller is respectively connected with the seed interleaving parameter loader, the pseudo-random number generator, the cyclic shifter and the interleaver and is used for controlling the parameter configuration and the working time sequence of the seed interleaving parameter loader, the pseudo-random number generator, the cyclic shifter and the interleaver.
The technical scheme has the advantages that:
the invention provides a method and a device for generating pseudorandom time-varying interleaving parameters. Based on the calculation indistinguishability of the pseudo random number and the true random number, the method can generate the pseudo random interleaving parameter which has the calculation indistinguishability with the true random interleaving parameter, thereby improving the safety of the interleaving encryption method.
Drawings
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to the accompanying drawings. Wherein:
fig. 1 is a schematic diagram of a pseudo-random time-varying interleaving parameter generation method according to the present invention.
Fig. 2 is a block diagram of a pseudo-random time varying interleaving parameter generator according to the present invention.
FIG. 3 is a flow chart of the operation of the pseudo-random time varying interleaving parameter generator of the present invention.
FIG. 4 is a block diagram of an example pseudo-random number generator.
Detailed Description
The present invention is further explained with reference to fig. 1 to 4.
In order to realize the design purpose of the invention, a method for generating pseudorandom time-varying interleaving parameters is designed, wherein the interleaving depth is assumed to be L, and the natural sequence address is pi0N sets of fixed seed interleaving parameters pi are pre-designed {1,2,3, …, L }seed,n(N-1, 2, …, N), calculating the k-th set of pseudo-random interleaving parameters pikThe method comprises the following steps:
step 1): inputting data p to an interleaverk,nWhen n is 1, pk,1＝π0(ii) a When N is 2,3, …, N, pk,n＝πk,n-1Wherein, isk,n-1Is the result of the (n-1) th stage of interleaving operation;
step 2): loading seed interleaving parameters, and for the nth stage interleaving operation, loading the nth group of seed interleaving parameters pi by using a seed interleaving parameter loaderseed,nLoading to a cyclic shifter;
step 3): calculating a pseudorandom cyclic shift parameter sk,n；
Step 4): calculating derived interleaving parameters, and cyclic shifter shifting parameters s according to pseudo-randomk,nInterleaving parameter pi to seedseed,nPerforming cyclic shift to obtain derived interleaving parameters
Figure GDA0002883216080000041
Step 5): interleaving the input data, the interleaver interleaving the input data according to the derived interleaving parameters
Figure GDA0002883216080000042
For input data pk,nInterweaving to obtain the result of n-th-stage interweaving operationk,n；
Step 6): judging whether the N-level cascade interweaving is finished or not, if not, returning to the step 1); if the operation is finished, outputting the obtained k-th group of pseudo-random intersectionWeave parameter pik＝πk,N。
An apparatus for generating pseudorandom time-varying interleaving parameters, the structure comprising: the device comprises a seed interleaving parameter loader, a pseudo-random number generator, a cyclic shifter, an interleaver and a controller;
the seed interweaving parameter loader is sequentially connected with the cyclic shifter and the interweaver and is used for loading the pre-designed seed interweaving parameters;
the pseudo-random number generator is sequentially connected with the cyclic shifter and the interleaver and is used for generating pseudo-random cyclic shift parameters;
the cyclic shifter is connected with the interleaver, and the cyclic shifter performs cyclic shift on the seed interleaving parameters according to the pseudorandom cyclic shift parameters to obtain derived interleaving parameters;
the interleaver interleaves the input data according to the derived interleaving parameters output by the cyclic shifter;
the controller is respectively connected with the seed interleaving parameter loader, the pseudo-random number generator, the cyclic shifter and the interleaver and is used for controlling the parameter configuration and the working time sequence of the seed interleaving parameter loader, the pseudo-random number generator, the cyclic shifter and the interleaver.
The present invention is further illustrated by the following examples.
FIG. 4 shows a pseudo-random number generator used in this example and having a generator polynomial of 1+ X2+X5. The initialization method of the pseudo random number generator adopted in the embodiment is as follows: initializing a linear feedback shift register of the pseudo-random number generator once only before the pseudo-random number generator works; the initial value of the linear feedback shift register is (10001); in this example, the cyclic shift operation of the seed interleaving parameter by the cyclic shifter is a cyclic left shift.
The two sets of seed interleaving parameters adopted in the present example are respectively
πseed,1＝{19,13,25,30,9,3,15,26,22,32,6,18,28,12,24,8,4,17,29,21,11,7,2,27,20,31,14,1,10,23,5,16}
πseed,2＝{17,4,25,13,30,21,8,26,1,31,19,10,6,23,27,18,32,14,2,9,28,20,24,5,12,29,16,22,3,7,11,15}, with natural order addresses of
π0＝{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32}.
This example will calculate a first set of pseudo-random interleaving parameters pi1And a second set of pseudo-random interleaving parameters pi2I.e., k is 1, 2. The number of stages of the cascade interleaving operation is N-2. The pseudo-random generator generates the first 20 bits of pseudo-random sequence as
r＝{1,0,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,1,0,0}.
The 4 pseudo random numbers for this sequence are shown in the following table:
Figure GDA0002883216080000061
example 1: calculating a first set of pseudo-random interleaving parameters pi1
The specific steps of the first stage of interleaving (n is 1) are as follows:
step 1): inputting data p to an interleaver1,1＝π0；
Step 2): loading seed interleave parameter piseed,1；
Step 3): calculating a pseudorandom cyclic shift parameter, s1,1＝17；
Step 4): calculating derived interleaving parameter, cyclic shifter to seed interleaving parameter piseed,1Circularly left-shifting 17 bits to obtain derivative interleaving parameters
Figure GDA0002883216080000062
Step 5): the interleaver derives interleaving parameters
Figure GDA0002883216080000063
For input data p1,1Interleaving to obtain the result of the 1 st level interleaving operation
π1,1＝{11,6,21,32,14,26,5,31,20,12,4,29,17,10,22,15,1,27,16,8,3,24,13,30,18,23,7,28,2,19,9,25}.
Step 6): and judging whether the two-stage cascade interleaving is finished or not, and finishing the state judgment, wherein the two-stage cascade interleaving is not finished because n is 1 < 2, and therefore, returning to the step 1) to continuously execute the second-stage interleaving.
The specific steps of the second stage of interleaving (n-2) are as follows:
step 1): inputting data p to an interleaver1,2＝π1,1；
Step 2): loading seed interleave parameter piseed,2；
Step 3): calculating a pseudorandom cyclic shift parameter, s1,2＝15；
Step 4): calculating derived interleaving parameter, cyclic shifter to seed interleaving parameter piseed,2Circularly left-shifting 15 bits to obtain derivative interleaving parameters
Figure GDA0002883216080000071
Step 5): the interleaver derives interleaving parameters
Figure GDA0002883216080000072
For input data p1,2Interleaving to obtain the result of the 2 nd level interleaving operation:
Figure GDA0002883216080000075
step 6): judging whether the two-stage cascade interweaving is finished or not, wherein n is 2, the two-stage cascade interweaving is finished, and pi1,2I.e. the obtained first group of pseudo-random interleaving parameters pi1。
Example 2: calculating a second set of pseudo-random interleaving parameters pi2；
The specific steps of the first stage of interleaving (n is 1) are as follows:
step 1): inputting data p to an interleaver2,1＝π0.
Step 2): loading seed interlace parametersNumber piseed,1；
Step 3): calculating a pseudorandom cyclic shift parameter, s2,1＝22；
Step 4): interleaving parameter pi of cyclic shifter to seedseed,1Circularly left-shifting 22 bits to obtain derivative interleaving parameters
Figure GDA0002883216080000073
Step 5): the interleaver derives interleaving parameters
Figure GDA0002883216080000074
For input data p2,1Interleaving to obtain the result of the 1 st level interleaving operation
Figure GDA0002883216080000076
Step 6): judging whether the two-stage cascade interleaving is finished or not, and returning to the step 1) to continuously execute the second-stage interleaving because the two-stage cascade interleaving is not finished when n is 1 < 2;
the specific steps of the second stage of interleaving (n-2) are as follows:
step 1): inputting data p to an interleaver2,2＝π2,1；
Step 2): loading seed interleave parameter piseed,2；
Step 3): calculating a pseudorandom cyclic shift parameter, s2,2＝4；
Step 4): interleaving parameter pi of cyclic shifter to seedseed,2Circularly left-shifting 4 bits to obtain derivative interleaving parameters
Figure GDA0002883216080000081
Step 4): interleaving the input data, the interleaver interleaving the input data according to the derived interleaving parameters
Figure GDA0002883216080000082
For input data p2,2Interleaving to obtain the result of 2 nd-level interleaving operation
Figure GDA0002883216080000083
Step 4): judging whether the two-stage cascade interweaving is finished or not, wherein n is 2, the two-stage cascade interweaving is finished, and pi2,2I.e. the solved second group of pseudo-random interleaving parameters pi2。
The above description is only a preferred embodiment of the present patent and is not intended to limit the present patent, and it is obvious that those skilled in the art can make various changes and modifications to the present patent without departing from the spirit and scope of the present patent. Thus, if such modifications and variations of the present patent are within the scope of the present patent claims and their equivalents, the present patent is also intended to encompass such modifications and variations.

Claims (2)

1. A method for generating pseudo-random time-varying interleaving parameter assumes that the interleaving depth is L and the natural sequence address is pi0N sets of fixed seed interleaving parameters pi are pre-designed {1,2,3, …, L }seed,n(N-1, 2, …, N), calculating the k-th set of pseudo-random interleaving parameters pikThe method is characterized by comprising the following steps:
step 1): inputting data p to an interleaverk,nWhen n is 1, pk,1＝π0(ii) a When N is 2,3, …, N, pk,n＝πk,n-1Wherein, isk,n-1Is the result of the (n-1) th stage of interleaving operation;
step 2): loading seed interleaving parameters, and for the nth stage interleaving operation, loading the nth group of seed interleaving parameters pi by using a seed interleaving parameter loaderseed,nLoading to a cyclic shifter;
step 3): calculating a pseudorandom cyclic shift parameter sk,n；
Step 4): calculating derived interleaving parameters, and cyclic shifter shifting parameters s according to pseudo-randomk,nInterleaving parameter pi to seedseed,nPerforming cyclic shift (cyclic left shift or cyclic right shift) to obtain derived interleaving parameters
Figure FDA0003114437130000011
Step 5): interleaving the input data, the interleaver interleaving the input data according to the derived interleaving parameters
Figure FDA0003114437130000012
For input data pk,nInterweaving to obtain the result of n-th-stage interweaving operationk,n；
Step 6): judging whether the N-level cascade interweaving is finished or not, if not, returning to the step 1); if the process is finished, outputting the obtained kth group of pseudo-random interleaving parameters pik＝πk,N。
2. A pseudo-random time-varying interleaving parameter generator for interleaving depth L and natural sequence address pi0N sets of fixed seed interleaving parameters pi are preset, where N sets of fixed seed interleaving parameters pi are {1,2,3, …, L }seed,n(N is 1,2, …, N), the k-th set of pseudo-random interleaving parameters pi is calculatedkAnd wherein the generating means comprises: the seed interleaving parameter loader, the pseudo-random number generator, the cyclic shifter, the interleaver and the controller are respectively connected with the seed interleaving parameter loader, the pseudo-random number generator, the cyclic shifter and the interleaver;
a controller for inputting data p to the interleaverk,nWhen n is 1, pk,1＝π0(ii) a When N is 2,3, …, N, pk,n＝πk,n-1Wherein, isk,n-1Is the result of the (n-1) th stage of interleaving operation;
the seed interweaving parameter loader is connected with the cyclic shifter and used for loading seed interweaving parameters under the action of the controller, and for the nth stage interweaving operation, the seed interweaving parameter loader is used for enabling the nth group of seed interweaving parameters piseed,nLoading to a cyclic shifter;
pseudo-random number generator and cyclic shifterThen, the pseudo-random cyclic shift parameter s is calculated and generated under the action of the controllerk,n；
The cyclic shifter is connected with the interleaver and used for shifting the parameter s according to the pseudo-random under the action of the controllerk,nInterleaving parameter pi to seedseed,nPerforming cyclic shift (cyclic left shift or cyclic right shift) to obtain derived interleaving parameters
Figure FDA0003114437130000021
An interleaver for deriving interleaving parameters under the action of the controller
Figure FDA0003114437130000022
For input data pk,nInterweaving to obtain the result of n-th-stage interweaving operationk,n；
The controller is also used for judging whether the N-stage cascade interleaving is finished or not, and if not, continuing to input data p to the interleaverk,nAnd controlling the seed interleaving parameter loader, the pseudo-random number generator, the cyclic shifter and the interleaver to continuously execute respective operations; if the interleaving is finished, the interleaver outputs the obtained kth group of pseudo-random interleaving parameters pik＝πk,N。
CN201810615093.7A 2018-06-14 2018-06-14 Method and device for generating pseudorandom time-varying interleaving parameters Active CN109039533B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810615093.7A CN109039533B (en) 2018-06-14 2018-06-14 Method and device for generating pseudorandom time-varying interleaving parameters

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810615093.7A CN109039533B (en) 2018-06-14 2018-06-14 Method and device for generating pseudorandom time-varying interleaving parameters

Publications (2)

Publication Number Publication Date
CN109039533A CN109039533A (en) 2018-12-18
CN109039533B true CN109039533B (en) 2022-01-04

Family

ID=64609620

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810615093.7A Active CN109039533B (en) 2018-06-14 2018-06-14 Method and device for generating pseudorandom time-varying interleaving parameters

Country Status (1)

Country Link
CN (1) CN109039533B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI754900B (en) * 2020-01-17 2022-02-11 旺宏電子股份有限公司 Random number generator, random number generating circuit, and random number generating method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103929278A (en) * 2014-05-14 2014-07-16 中国电子科技集团公司第五十四研究所 Method for constructing pseudo-random code based on interleaver
CN107769842A (en) * 2016-08-17 2018-03-06 北京三星通信技术研究有限公司 Interleaved sequence construction, the information processing method based on intertexture and transmitting, receiver

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7193800B2 (en) * 2004-05-06 2007-03-20 Hitachi Global Storage Technologies Netherlands B.V. Data recording medium with servo pattern having pseudo-noise sequences

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103929278A (en) * 2014-05-14 2014-07-16 中国电子科技集团公司第五十四研究所 Method for constructing pseudo-random code based on interleaver
CN107769842A (en) * 2016-08-17 2018-03-06 北京三星通信技术研究有限公司 Interleaved sequence construction, the information processing method based on intertexture and transmitting, receiver

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
交织多址技术(IDMA)中交织器的设计与系统性能研究;李柏毅;《中国优秀硕士学位论文全文数据库 信息科技辑》;20100515;1-6 *

Also Published As

Publication number Publication date
CN109039533A (en) 2018-12-18

Similar Documents

Publication Publication Date Title
JP4559505B2 (en) Extending the repetition period of random sequences
US9071275B2 (en) Method and device for implementing cyclic redundancy check codes
WO2009046534A1 (en) Methods and apparatuses of mathematical processing
WO2012016588A1 (en) Bit sequence generator
JP2009528559A (en) Encryption and decryption processing method and system for realizing SMS4 encryption algorithm
WO2013013480A1 (en) Pseudo random number generation apparatus and method
CN109039533B (en) Method and device for generating pseudorandom time-varying interleaving parameters
Helleseth et al. Simplifying algebraic attacks with univariate analysis
US8390485B2 (en) Subset transform interleaver
CN106936541B (en) RS coding and byte interleaving method and system
WO2013155785A1 (en) Scrambling code generation method, apparatus and scrambling code processing apparatus
CN102707923A (en) Pseudo-random number generation circuit and pseudo-random number generation method
US20140289295A1 (en) Method for generating a random output bit sequence
KR20060121312A (en) Convolutional turbo code interleaver
US20160119132A1 (en) Method and device for generating a hash value
US20090022310A1 (en) Cryptographic device and method for generating pseudo-random numbers
US6035042A (en) High speed and method of providing high speed table generation for block encryption
CN110457008B (en) m sequence generation method, device and storage medium
Kim et al. Layered ROLLO-I: faster rank-metric code-based KEM using ideal LRPC codes
RU2427885C1 (en) Quick-acting generator of random shifts and combinations
WO2015133095A1 (en) Apparatus for generating parity check code, coding method, coding apparatus, and storage medium
CN112953567A (en) Turbo coding method and device, electronic equipment and storage medium
CN107124189B (en) Method for dynamic change of random interleaved address of TDMA system
CN110741562B (en) Pipelined forward error correction for vector signaling code channels
RU2389141C2 (en) Information encryption device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant