JPS58201436A - Scrambler - Google Patents

Abstract

PURPOSE:To obtain a scramble with simple constitution, by repeating the operation that input data is divided into plural small blocks, each block is converted linearly after the block is converted with respect to signal by a key signal. CONSTITUTION:The input data are divided into n-blocks comprising l bits each by an input buffer 101 and inputted to a linear converter 103 after the code conversion is done with a code converter group 102 consisting of n sets of code converters S11-S1n performing code conversion determined with a bit pattern K1 functioning as a key. An output of the said converter 103 is converted with respect to signal in the same way as the case of the converter group 102 via the n sets of the code converter groups using a key K2 and inputted to the next linear converter. Signals added plural times with the repeated operations like this operation are outputted via an output buffer 104 as scramble signals.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a scrambler that scrambles digital data in dependence on a well-defined key, making the original data unavailable to anyone who does not have the key.

In the κ-scrambled method to transfer the digital signal to a third party, each bit of the output has a shadow 11 of all the bits of the input (this is now calculated). Called Ko/Preet) is valuable.

This is because unless it is composite, the a output will be affected only by mold and g, so it will be easy to estimate a part of the manual bit. In the promotion of Soufrenfleur, the literature I.E.E.
On Combi. Ichitarzu ( INIAlii Tran
actions on Coi+puters)
絽C-28 SH1O No. 747 - 753 It is a combination that is fighting Sada. However, data must be shuffled over 491m floors, so IliL
However, it has the disadvantage that it is too complicated.

The object of the present invention is to provide a scrambler which eliminates the above-mentioned drawbacks.
Our goal is to provide the following.

The above objective is achieved by a scrambler consisting of the following configuration. In other words, tinter data. In the Sufkumpler, which scrambles by passing through one or more stages of converters, the # converter decomposes the input tl ninetal data into ^^ small flows and ri. It is a converter that converts each with a sign converter determined depending on a predetermined bead pattern called a key, and converts the output of μ substitution with a predetermined nine-fold degree return. He is a scrambler with a special mission.

Hereinafter, the invention will be explained in detail using the phrase ``Sou 抛 false busy fui 1t''.

(hereinafter) For simplicity, it is assumed that it is expressed in Tintal 7-1-1 Binary.

FIG. 1 shows Example V small fish sweetfish 1 of the present invention.

In the figure, 5IJri 13 (7, Fi positive qpti>
It is a sign converter for human power l and output sign f (n=1, 2...
・,N, n=1,2. ..., n (h, n is the banknote number)), hereafter) For simplicity, l@ = lt ”・=”ln =
/ I am honored as .

Tintal data (lM: "HX / bit by bit.Tinttal data of nine a
) p, ri. Each professional, in the evening, performs a 1000-degree burn pattern called 1,000, with the sign of one person's output determined by 1,000 yen + 1.
Code converter group 11 consisting of +8□,...-+811
02 (7). The entire conversion result is further converted by the edge shape converter 103 which performs the mlv transformation described later. The -shape transformation result is converted as described above.
S + '11 + ``' r ``In `` Yohi A, and Kl + '' defined in the same stock! 1 + “ffi!
＋ '・' * 'Word n b yohi A, is used to make waves in history. From then on, this is outputted to the t position needle N stage ladle, fc Ayu coming out pipe cover, and fa 104.

W type i'-M AH (+-1, 2,..., N)
If H1 human power is Hector and the output is Vector, then y-: Al pot (1) will fit. Here, @arithmetic is expressed as a subscript modulo 2. In this case, A is the same as a matrix with nXj villages and nX7 columns.
Autumn, here, when the number J and column are j l1li, each Bjk(i"l r 2+"'+ n t k
=1,2.

. . . n) is determined to include one orchid of 1. There are many Ai's of this type, r2. Figure 2 shows the matrix of rock shape deformation, A1 when 1tlWk, n=2, and n=8.
I hate it. vV is omitted from uFi. The matrix in Figure 2 is regular. Assuming that all A1 are regular, code converter 5ij (n=1.2.mountain, N;j:1,2
゜..., n) If we consider kl vs. l quality, then the embodiments of the present invention will be 1*''l variable and overflowing as a whole, and there will be only one. force) L, A l regular, Gota aδ1t
There is no need to convert l to 1f.

The operation of the present invention will be explained using FIG.

Si】(,=l,2;>=l T21"'l") are all conoblyte. At this time, from the undefined force of A.

Second attack S21 + S! ! +..., S addition output data is the shadow I of each hit in the input buffer 101
Since I have received I, I am switching to kelp. In the Suffrenfleur of the above-mentioned document, it is not possible to obtain Humblit except for Fin = l, and a large number of stages are required. Therefore, this embodiment uses the above-mentioned deprivation variant (specifically, as will be shown later, with an exclusive ms sum element). By using a suffen fleur (which can be configured), a complete suffen fleur can be constructed with a smaller number of stages than the sufuran fleur of the above-mentioned document.

Complete with real facts and examples! An input/output transcoder can be found, for example, experimentally. n=
4 examples are shown in the third section. In the figure, fl
outputs 6 for input OK, and outputs 15 for human power l
Output.

The h-method that determines the j-input-l-output code converter depending on (1-1, 2, ..., N)K on the key may be arbitrary, but the h-method such as be. n=4゜n=1
This will be explained as 15. 1blil code fl in advance
Define the lI device and set it as '@+'+ +...
f.

Divide , ni, into 4 bits and toz. If the first paste p, the 4 bits of the paste, and the g are 24a, for example, if it is 3, S11 is set as fr3. Similarly, 8. (J = 1.2...116). Figure 4 is a circuit diagram showing an example of the 1-type conversion. For simplicity, the #Ii type corresponding to the fc bamboo row is An example of the conversion is given below. Substituting the matrix shown in Figure 2 into the equation (11) yields, for example, the 11kth part of the vector and index!

can be expressed as yl=xle, IxBωx @ 15) using the vector component "1+"l+"'+"a t-. Here, e is exclusive - auspicious. The output Y+ of the first scan in FIG. 11 and 4 is given by the same equation as the above equation (5) using the human power "I+"t+'r"@, and the other components of the vector A are also the same.

Implementation of the present invention Different 1 and jK sentences in mouth C・1 and A
1-λj is also a peek into the town, and 1l in front of the other
It is also possible to substitute one part of the f-supply of cN stages with another stage. Furthermore, 1,000-' I + Kf r..., K
For K, one key may be subjected to any conversion from 6 to N- to form , K, ,...0 For example, in the configuration shown in Figure 1, 811 + 81
1 +...

Make sure that S, , SNn are complete.
One example is a method in which the Hkth output is set to Ki. (Since it is fC, it is determined that 2 = fi.)Although the magnitude of the input and output of the code converter is assumed to be constant l, it does not have to be constant.

These O honeysoos are included in the single-shot f#.

More details KW5! As explained above, by using the present invention, it is possible to scramble digital data tm* in an I11 format, so that when used as a data *m or random number generation source, the effect is distorted and thick.

Figure l1iiO is a simple circuit diagram 1- is a circuit diagram that does not include an embodiment of the present invention, and II! Figure t'1 is an example of a linear transformation matrix, and the stripe 3 figure r
FIG. 4 is a diagram showing an example of an i code converter, and FIG.
*This is a circuit diagram of an example of form conversion.

1d in the figure, 101 is an input cover, 102 is a l input-output code converter group, 103 is a linear converter, 104 is a seventh
Figure 1

Claims (1)

[Claims] In a scrambler that scrambles digital data by passing it through one or more stages of six conversion stages, v
I-transformation involves multiple human-generated digital data.
The output of the transform is decomposed into small parts, each of which is converted by a code converter determined depending on the bead pattern called a key, and the output of the transform is A scrambler that waits to be a converter that converts and outputs a predetermined monomorphic conversion.