JPH04140947A - Random number generator in coder - Google Patents

Random number generator in coder

Info

Publication number
JPH04140947A
JPH04140947A JP2264585A JP26458590A JPH04140947A JP H04140947 A JPH04140947 A JP H04140947A JP 2264585 A JP2264585 A JP 2264585A JP 26458590 A JP26458590 A JP 26458590A JP H04140947 A JPH04140947 A JP H04140947A
Authority
JP
Japan
Prior art keywords
random number
ciphering
pseudo random
modem
pseudo
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.)
Pending
Application number
JP2264585A
Other languages
Japanese (ja)
Inventor
Keiichi Iwamura
恵市 岩村
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.)
Canon Inc
Original Assignee
Canon Inc
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 Canon Inc filed Critical Canon Inc
Priority to JP2264585A priority Critical patent/JPH04140947A/en
Publication of JPH04140947A publication Critical patent/JPH04140947A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To simply build up a transmission system as a ciphering transmission system by forming the transmission system to be a system simply possible for ciphering processing and allowing one equipment to implement ciphering processing and a MODEM function. CONSTITUTION:Scramble coding by a pseudo random number is generated by generating a pseudo random number series and EXORing (exclusive OR) the series with a data series. Moreover, random number character conversion ciphering processing one of ciphering, is ciphering processing to be generated by EXORing the pseudo random number series with a data. The pseudo random number generator is made up of a shift register and a tap string. Moreover, a MODEM at a communication side generates plural kinds of pseudo random numbers with different generation polynomial and a receiver side has one of the generation polynomial in the MODEM as a ciphering processing key specific to each terminal equipment and decodes the data so as to attain ciphering processing communication using a common key.

Description

【発明の詳細な説明】 [m集土の利用分野] 本発明は通信等に用いられる符号化装置における乱数発
生装置に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of application of m-collection] The present invention relates to a random number generation device in an encoding device used for communication, etc.

[従来の技術] 伝送路を介して通信を行う場合、第4図に示すような符
号化が知られている。誤り訂正符号化(ECC)は伝送
路の誤り率が悪い場合に生じたり誤りを回復するもので
ある。また、伝送路符号化(モデム)はタイミング抽出
を容易に行うために多くのシステムにおいて用いられて
いる。
[Prior Art] When communicating via a transmission path, encoding as shown in FIG. 4 is known. Error correction coding (ECC) is used to recover errors that occur when the error rate of a transmission path is poor. Additionally, transmission line encoding (modem) is used in many systems to facilitate timing extraction.

[発明が解決しようとしている課題] しかし、今までの伝送システムは暗号化についてあまり
考慮されておらず、符号化装置を持っていないものが多
かった。また、暗号化装置を持っていたにしても他の符
号化とは個別に行われ、符号化毎に装置が必要であった
[Problems to be Solved by the Invention] However, conventional transmission systems have not given much consideration to encryption, and many have not included an encoding device. Further, even if an encryption device was available, it was performed separately from other encodings, and a device was required for each encoding.

[課題を解決するための手段] そこで上述の欠点を除去し、暗号化を考慮していなかっ
た伝送システムを簡単に暗号化可能なシステムにし、暗
号化とモデムを1つの装置で行える伝送路符号化方式及
び伝送システムを提案する。
[Means for solving the problem] Therefore, we have developed a transmission line code that eliminates the above-mentioned drawbacks, turns a transmission system that did not consider encryption into a system that can easily encrypt, and allows encryption and modem to be performed in one device. We propose a method and transmission system for this purpose.

[実施例] 疑似乱数によるデータのスクランブル符号化は伝送路符
号化の1つであり、疑似乱数系列を発生させデータ系列
とEXOR(排他論理和)さ1iることによって生成さ
れる。この符号化は回路構成の筒中さと伝送路符号速度
の十昇がないとい・)特徴を持つ。
[Embodiment] Scramble encoding of data using pseudo-random numbers is one type of transmission line encoding, and is generated by generating a pseudo-random number sequence and performing EXOR (exclusive OR) with the data sequence. This encoding is characterized by the fact that there is no increase in the circuit configuration and transmission line code speed.

また、暗号化の1つである乱数式換字暗号化もまたデー
タに疑似乱数系列をEXORすることによってt]成さ
オlる暗号化である。この疑似乱数発生器は第3図のよ
・)にシフI・レジスタとタップ列j′:よって構成で
きる3、 ただし、この疑似乱数発生器は伝送路符号化の場合は全
装置に共通のタップ列をもつが、暗号化の場合は疑似乱
数の生成多項式を暗号化鍵として各装置毎に異なるタッ
プを持つ6゜ 本実施例では、通信側のモデムが生成多項式の異なる複
数種類の疑似乱数を生成し、−力、受信側がイの牛成多
q式のLフを各端末に固有の暗号化鍵どI、1てモデム
内にもち復号号−ることにより、第2図のような共通鍵
による暗号通信がi’T能な伝送システムを構成1..
....fI・0 本実施例では、受信側のモデムは暗号化鍵i、″よる固
定的なタップ列をもつ疑似乱数発64器にJ:っで構成
される。一方、送信側の疑似乱数発生器、器は生成多項
式の異なる複数種類の疑似乱数を発生4る。
Furthermore, random number substitution encryption, which is one type of encryption, is also an encryption that is performed by EXORing data with a pseudo-random number sequence. This pseudo-random number generator can be configured with a shift I register and a tap sequence j' as shown in Fig. In the case of encryption, each device has a different tap using the pseudorandom number generator polynomial as the encryption key.In this embodiment, the modem on the communication side generates multiple types of pseudorandom numbers with different generator polynomials. By generating and decrypting the L file of the Ushinarita q-style L file in the modem with an encryption key unique to each terminal, the receiving side decrypts the L file in the modem as shown in Figure 2. 1. Construct a transmission system capable of i'T encrypted communication using keys. ..
.. .. .. .. fI・0 In this embodiment, the modem on the receiving side is composed of 64 pseudo-random number generators with a fixed tap sequence based on the encryption key i.On the other hand, the pseudo-random number generator on the sending side , the generator generates multiple types of pseudo-random numbers with different generator polynomials.

生成多項式の異なる複数種類の疑似乱数は第1図に示4
J、うにシフトレジスタの出ツJ己・生成多項式によっ
て制御されるROM(リ−・ドオンリメモリ)で構成さ
れるタップ列を持つ疑似乱数発生器εこよって生成され
る。このROMはシフトレジスタからの出力を受ける1
ビットと疑似乱数の生成多項式の種類(暗号鍵)を表ず
f・じツトの入力アドレスと、1ビツトの出力を持つR
OM”r構成できる。ROMは複数の生成多項式を記憶
I2.1、入力された暗号鍵に応じた生成多項式を発生
器る。
Multiple types of pseudorandom numbers with different generating polynomials are shown in Figure 1.
J is generated by a pseudo-random number generator ε having a tap array composed of a ROM (read-only memory) controlled by a generator polynomial. This ROM receives the output from the shift register.
R represents the type of bit and pseudo-random number generating polynomial (encryption key) and has an input address of f and an output of 1 bit.
OM"r can be configured. The ROM stores a plurality of generating polynomials I2.1, and generates a generating polynomial according to the input encryption key.

送伝側では送信先(z、応じた暗号鍵を第1図示のRO
Mに与えて疑似乱数を発生ずる。
On the transmission side, the destination (z) and the corresponding encryption key are sent to the RO shown in the first diagram.
M is given to generate a pseudo-random number.

一方、受信側では受信側固有の疑似乱数を受信信司を復
調−4る。
On the other hand, on the receiving side, a pseudo random number unique to the receiving side is demodulated by -4.

「発明の効果] 以I−によ、)て、モデムを簡単に暗号装置化Cきる。"Effect of the invention] As described above, the modem can be easily encoded into an encryption device.

本発明の効果はモデムを暗勺器として用いるので装置的
な増加がなく、またモデト内のタップ列の構成を変更す
るだけであるので、伝送路符号化等のシステムの方式を
変Wする必要もない。
The effects of the present invention are that since the modem is used as a secret filter, there is no increase in equipment, and since it is only necessary to change the configuration of the tap array in the modem, there is no need to change the system method such as transmission line encoding. Nor.

本発明には暗号化強度が弱いという問題があるが、本発
明によ、って今まで暗号化が考慮されていなかった伝送
システムがほとんど変更なしに簡単に暗号化伝送システ
ムとして構成され利用できる。
Although the present invention has a problem in that the encryption strength is weak, the present invention allows a transmission system in which encryption has not been considered until now to be easily configured and used as an encrypted transmission system with almost no changes. .

【図面の簡単な説明】[Brief explanation of the drawing]

11図は本発明の実施例の伝送路符号化を実現する疑似
乱数発生器の回路図、 第2図は本発明の実施例による暗号とモデムを1つにし
た伝送路符号化のシステム図、 第3図は従来の疑似乱数発生器の回路図、第4図は伝送
路に対する従来の符号化のシステム図である。 第1図 シフトレジスタ 第2図 鍵
Figure 11 is a circuit diagram of a pseudo-random number generator that realizes transmission line encoding according to an embodiment of the present invention, and Figure 2 is a system diagram of transmission line encoding that combines a cipher and a modem according to an embodiment of the present invention. FIG. 3 is a circuit diagram of a conventional pseudorandom number generator, and FIG. 4 is a diagram of a conventional encoding system for a transmission path. Figure 1 Shift register Figure 2 Key

Claims (2)

【特許請求の範囲】[Claims] (1)生成多項式の異なる複数種類の疑似乱数を発生す
る発生手段と、 データと上記発生手段により発生された疑似乱数の排他
的論理和をとる手段を有することを特徴とする符号化装
置における乱数発生装置。
(1) Random numbers in an encoding device characterized by having a generating means for generating multiple types of pseudo-random numbers with different generating polynomials, and means for taking an exclusive OR of data and the pseudo-random numbers generated by the generating means. Generator.
(2)特許請求の範囲第1項記載の符号化装置における
乱数発生装置において、 上記発生手段はn段のシフトレジスタとn段のタップ列
と、上記シフトレジスタの出力と疑似乱数の生成多項式
によって制御されるメモリを有することを特徴とする符
号化装置における乱数発生装置。
(2) In the random number generation device in the encoding device according to claim 1, the generation means includes an n-stage shift register, an n-stage tap array, and an output of the shift register and a pseudo-random number generating polynomial. A random number generator in an encoding device, characterized by having a controlled memory.
JP2264585A 1990-10-01 1990-10-01 Random number generator in coder Pending JPH04140947A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2264585A JPH04140947A (en) 1990-10-01 1990-10-01 Random number generator in coder

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2264585A JPH04140947A (en) 1990-10-01 1990-10-01 Random number generator in coder

Publications (1)

Publication Number Publication Date
JPH04140947A true JPH04140947A (en) 1992-05-14

Family

ID=17405341

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2264585A Pending JPH04140947A (en) 1990-10-01 1990-10-01 Random number generator in coder

Country Status (1)

Country Link
JP (1) JPH04140947A (en)

Similar Documents

Publication Publication Date Title
US4322577A (en) Cryptosystem
US5365589A (en) Method and apparatus for encryption, decryption and authentication using dynamical systems
US6078667A (en) Generating unique and unpredictable values
US6014446A (en) Apparatus for providing improved encryption protection in a communication system
US7907725B2 (en) Simple universal hash for plaintext aware encryption
US6314187B1 (en) Method for encryption or decryption using finite group operations
JP2628660B2 (en) Encryption / decryption method and apparatus
JPS5873257A (en) Encoding device
RU2146421C1 (en) Decoding of data subjected to repeated transmission in encoding communication system
CA2695019A1 (en) Method and system for encryption of data
US20020018561A1 (en) Data encryption and decryption using error correction methodologies
US6912284B1 (en) Self-Authenticating cryptographic apparatus
AU2002346319B2 (en) Shared data refining device and shared data refining method
JP2007019789A (en) Random number sharing system and method therefor
US11212078B2 (en) Method for sending digital data over a number of channels
EP3654576B1 (en) Computer-implemented method for error-correction-encoding and encrypting of a file
JPH04140947A (en) Random number generator in coder
JPH04335730A (en) Random ciphering communication system
Simmons Symmetric and asymmetric encryption
US8406423B2 (en) Multi-bit cryptographically secure encryptor for M-ary spectral phase encoder optical code division multiple access
JPH11327436A (en) Ciphering device
RU2140714C1 (en) Data block iterative ciphering technique
GB2597333A (en) Key exchange protocol
RU2184423C2 (en) Method for iterative block encryption of digital data
JPH03155591A (en) Sequential ciphering device