WO2002001791A1 - The conversion method of unlimited uncycling key stream of clear text, encrypted message extracting mechanism - Google Patents

The conversion method of unlimited uncycling key stream of clear text, encrypted message extracting mechanism Download PDF

Info

Publication number
WO2002001791A1
WO2002001791A1 PCT/CN2001/000876 CN0100876W WO0201791A1 WO 2002001791 A1 WO2002001791 A1 WO 2002001791A1 CN 0100876 W CN0100876 W CN 0100876W WO 0201791 A1 WO0201791 A1 WO 0201791A1
Authority
WO
WIPO (PCT)
Prior art keywords
key
encrypted message
clear text
uncycling
unlimited
Prior art date
Application number
PCT/CN2001/000876
Other languages
French (fr)
Chinese (zh)
Inventor
Mengfu Ci
Original Assignee
Mengfu Ci
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 Mengfu Ci filed Critical Mengfu Ci
Priority to AU89503/01A priority Critical patent/AU8950301A/en
Publication of WO2002001791A1 publication Critical patent/WO2002001791A1/en

Links

Classifications

    • 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/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
    • H04L9/0656—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher

Definitions

  • the invention discloses a method and a mechanism for random dynamic transformation of a secret key sequence at a time.
  • the second secret is recognized to have the highest encryption strength.
  • the effective transmission of the key stream and the key stream generator algorithm's breakthrough in the limited cycle have not been resolved.
  • the purpose of the present invention is to provide a method and a mechanism for dynamically transforming a key sequence, so that the key stream is randomly transformed before the cycle is completed. In this way, no key transmission is required, and the limited circulation of the key stream is achieved, which is completed or close to Word by word encryption.
  • the method and mechanism for random dynamic change of the key sequence of the present invention is implemented by using the following scheme, which extracts VI from plaintext or ciphertext counts, compares and selects V2, candidate buffer and initial transformation V3, real selected data buffer and secret Key sequence transformation V4, key sequence buffer V5, candidate function sequence / k in V6, and characteristic modulation data ⁇ in V7.
  • Extracting data from A or B is optional.
  • the counting starts at the end of the previous extraction in VI.
  • the counting unit is determined by the data M1, the starting point of the sequential extraction is determined by the data N1, and the extracted data is sent to V2.
  • the extracted data is compared with the candidate data that already exists in V3. If they are the same, they are discarded, and if they are not the same, they are sequentially stored in V3 as new candidate data. If the number of candidate data stored in V3 reaches N2, then the data of N2 is transformed by the function / kl and sent to V4.
  • the selected transformation data is buffered in V4.
  • the key sequence in the buffer V5 will be transformed with the characteristic modulation data ⁇ — via the function / k2.
  • the characteristic modulation data ⁇ is some characteristic data, including encryption time, user attributes, address, authorization level, etc., and users can set and choose according to their needs.
  • V6 is a sequence of numbered functions. After K1 and K2 in the key sequence buffer V5 are selected, the function transformation is completed as / kl and / k2.
  • the present invention uses the local randomness of the plaintext stream, plus the randomness of the encryption time, etc., before a sufficiently long key sequence does not complete the cycle, it is randomly transformed, and so on to achieve The purpose of forming an infinite acyclic key stream.

Abstract

The invention discloses a method and mechanism of random dynamic variation of a key sequence. It is comprised of clear text or encrypted message count extracting V1, comparatively sieving V2, candidate buffer areas and key sequence converting V4, key sequence buffer areas V5, the candidate function sequence fk in V6, and the feature modulation data μ in V7. The invention realizes the breakthrough of the limited cycling , completes or approaches the encrytion effect of one key per word.

Description

明、 密文抽取机制无限不循环密钥流变换法  Infinite acyclic key stream transformation method for clear and ciphertext extraction mechanism
本发明所述技术领域 TECHNICAL FIELD
本发明公开了一种一次一密的密钥序列随机动态变换方法和机制。  The invention discloses a method and a mechanism for random dynamic transformation of a secret key sequence at a time.
在本发明之前的现有技术 Prior art prior to the present invention
—次一密被公认具有最高的加密强度。 但密钥流的有效传送及密钥流生成器 算法对有限循环性的突破一直未能解决。  -The second secret is recognized to have the highest encryption strength. However, the effective transmission of the key stream and the key stream generator algorithm's breakthrough in the limited cycle have not been resolved.
本发明的目的 Object of the invention
本发明的目的在于提供一种密钥序列动态变换方法和机制， 使得密钥流在循 环完成前就已经随机变换， 如此下去， 无需密钥传送， 实现突破密钥流有限循环 性， 完成或接近一字一密的加密效果。  The purpose of the present invention is to provide a method and a mechanism for dynamically transforming a key sequence, so that the key stream is randomly transformed before the cycle is completed. In this way, no key transmission is required, and the limited circulation of the key stream is achieved, which is completed or close to Word by word encryption.
本发明的技术方案 Technical solution of the present invention
本发明 种密钥序列随机动态变化方法和机制是采用下述方案实现 的， 它由明文或密文记数抽取 VI， 比较筛选 V2， 候选缓冲区与初始变换 V3， 实 选数据缓冲区和密钥序列变换 V4， 密钥序列缓冲区 V5， V6中候选函数序列 /k, 及 V7中的特征调制数据 λ构成。  The method and mechanism for random dynamic change of the key sequence of the present invention is implemented by using the following scheme, which extracts VI from plaintext or ciphertext counts, compares and selects V2, candidate buffer and initial transformation V3, real selected data buffer and secret Key sequence transformation V4, key sequence buffer V5, candidate function sequence / k in V6, and characteristic modulation data λ in V7.
附图说明 BRIEF DESCRIPTION OF THE DRAWINGS
下面结合附图详细说明- 图 1本发明的附图原理图。  The following is a detailed description with reference to the drawings-FIG. 1 The schematic diagram of the present invention.
实施例 Examples
见附图 Α为明文流， B为密文流， 从 A或 B中抽取数据可选择。 在 VI中 以上次抽取的终点开始记数， 记数单位由数据 Ml 决定， 顺序抽取的起点由数据 N1决定， 并将抽取的数据送往 V2。 在 V2中将抽取数据与 V3中已经存在的候选 数据进行比较，若有相同则舍弃，若没有相同则作为新的候选数据按顺序存入 V3。 在 V3中若存入的候选数据数量达到 N2， 则将 N2号数据经函数 /kl变换后送入 V4。 在 V4中缓存有选定的变换数据， 当数量达到 N3 时将和特征调制数据 λ— 起经函数 /k2对缓冲区 V5 中的密钥序列进行变换。 特征调制数据 λ是一些特征 数据， 包括加密时间、 用户的属性、 地址、 授权级别、 …等， 用户可根据需求进 行设置取舍。 V6中是一些编号了的函数序列。经密钥序列缓冲区 V5中的 Kl、 Κ2 选定后， 作为 /kl 、 /k2完成函数变换。 See Figure A for plaintext stream and B for ciphertext stream. Extracting data from A or B is optional. The counting starts at the end of the previous extraction in VI. The counting unit is determined by the data M1, the starting point of the sequential extraction is determined by the data N1, and the extracted data is sent to V2. In V2, the extracted data is compared with the candidate data that already exists in V3. If they are the same, they are discarded, and if they are not the same, they are sequentially stored in V3 as new candidate data. If the number of candidate data stored in V3 reaches N2, then the data of N2 is transformed by the function / kl and sent to V4. The selected transformation data is buffered in V4. When the number reaches N3, the key sequence in the buffer V5 will be transformed with the characteristic modulation data λ — via the function / k2. The characteristic modulation data λ is some characteristic data, including encryption time, user attributes, address, authorization level, etc., and users can set and choose according to their needs. V6 is a sequence of numbered functions. After K1 and K2 in the key sequence buffer V5 are selected, the function transformation is completed as / kl and / k2.
本发明根据明文是不可猜测的原理， 利用明文流在局部的随机性， 加上加密 时间等的随机性， 在一足够长的密钥序列未完成循环之前， 对其进行随机变换， 如此下去达到形成一无限不循环的密钥流的目的。  According to the principle that the plaintext is unguessable, the present invention uses the local randomness of the plaintext stream, plus the randomness of the encryption time, etc., before a sufficiently long key sequence does not complete the cycle, it is randomly transformed, and so on to achieve The purpose of forming an infinite acyclic key stream.

Claims

权 利 要 求 Rights request
1、 一种无限不循环密钥流算法， 其特征在于从密文或明文随机抽取数据对密钥 序列进行变换， 无须密钥流传送， 包括自动动态随机的选择抽取的范围和大小， 摒弃高概率因子， 改变变换涵数， 加入特征调制数据。  1. An infinite acyclic keystream algorithm, which is characterized by randomly extracting data from ciphertext or plaintext to transform the key sequence without the need of keystream transmission, including automatic dynamic random selection of the range and size of the extraction, and abandoning high Probability factor, changing transform culvert, adding characteristic modulation data.
PCT/CN2001/000876 2000-06-19 2001-05-28 The conversion method of unlimited uncycling key stream of clear text, encrypted message extracting mechanism WO2002001791A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU89503/01A AU8950301A (en) 2000-06-19 2001-05-28 The conversion method of unlimited uncycling key stream of clear text, encryptedmessage extracting mechanism

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN00109250.2 2000-06-19
CN 00109250 CN1330352A (en) 2000-06-19 2000-06-19 Infinite non-cycle key stream conversion method with normal and encrypted texts extracting mechanism

Publications (1)

Publication Number Publication Date
WO2002001791A1 true WO2002001791A1 (en) 2002-01-03

Family

ID=4579530

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2001/000876 WO2002001791A1 (en) 2000-06-19 2001-05-28 The conversion method of unlimited uncycling key stream of clear text, encrypted message extracting mechanism

Country Status (3)

Country Link
CN (1) CN1330352A (en)
AU (1) AU8950301A (en)
WO (1) WO2002001791A1 (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1117227A (en) * 1994-02-14 1996-02-21 艾利门垂克斯技术有限公司 Protected communication method and system
US6095410A (en) * 1994-02-23 2000-08-01 Dataflight Europe A/S Vending system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1117227A (en) * 1994-02-14 1996-02-21 艾利门垂克斯技术有限公司 Protected communication method and system
US6095410A (en) * 1994-02-23 2000-08-01 Dataflight Europe A/S Vending system

Also Published As

Publication number Publication date
CN1330352A (en) 2002-01-09
AU8950301A (en) 2002-01-08

Similar Documents

Publication Publication Date Title
Mennink et al. Security of full-state keyed sponge and duplex: Applications to authenticated encryption
Black et al. CBC MACs for arbitrary-length messages: The three-key constructions
US5892829A (en) Method and apparatus for generating secure hash functions
Krause BDD-based cryptanalysis of keystream generators
Bellare et al. Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible
US7221756B2 (en) Constructions of variable input length cryptographic primitives for high efficiency and high security
WO2012071728A1 (en) Data encryption method, apparatus and system for cloud storage
US20120134490A1 (en) Selective Data Encryption and Decryption Method and Apparatus
CN107196760B (en) Sequence encryption method of adjoint random reconstruction key with adjustability
Daemen et al. The first 10 years of advanced encryption
WO1998007251A1 (en) Improved cryptographically secure pseudo-random bit generator for fast and secure encryption
US20090092251A1 (en) Symmetric key cryptographic method and apparatus for information encryption and decryption
JP2002185443A (en) Secret key managing system
Bellare et al. On-line ciphers and the hash-CBC constructions
Ojha et al. Twis–a lightweight block cipher
Dodis et al. Message authentication codes from unpredictable block ciphers
Patel et al. Efficient constructions of variable-input-length block ciphers
Dachman-Soled et al. Upper and lower bounds for continuous non-malleable codes
ES2047731T3 (en) PROCEDURE FOR THE GENERATION OF A RANDOM NUMBER FOR THE CODED TRANSMISSION OF DATA.
WO2002001791A1 (en) The conversion method of unlimited uncycling key stream of clear text, encrypted message extracting mechanism
Nurdin et al. Securing audio chat with cryptool-based twofish algorithm
CN105959106A (en) Low-complexity digital encryption method
WO2018229666A1 (en) Symmetric key stream cipher cryptographic method and device
CN109274659A (en) A kind of on-line/off-line searchable cryptograph method of no certificate
Vojvoda Cryptanalysis of one hash function based on quasigroup

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP