EP1183819A1 - Codeur/decodeur a plusieurs bases de numeration utilisant une relation de ou exclusif - Google Patents

Codeur/decodeur a plusieurs bases de numeration utilisant une relation de ou exclusif

Info

Publication number
EP1183819A1
EP1183819A1 EP99973856A EP99973856A EP1183819A1 EP 1183819 A1 EP1183819 A1 EP 1183819A1 EP 99973856 A EP99973856 A EP 99973856A EP 99973856 A EP99973856 A EP 99973856A EP 1183819 A1 EP1183819 A1 EP 1183819A1
Authority
EP
European Patent Office
Prior art keywords
elements
array
encryption
forth
digits
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.)
Withdrawn
Application number
EP99973856A
Other languages
German (de)
English (en)
Other versions
EP1183819A4 (fr
Inventor
Richard C. Satterfield
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.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Priority claimed from PCT/US1999/010929 external-priority patent/WO2000070818A1/fr
Publication of EP1183819A1 publication Critical patent/EP1183819A1/fr
Publication of EP1183819A4 publication Critical patent/EP1183819A4/fr
Withdrawn legal-status Critical Current

Links

Definitions

  • the present invention relates to apparatus and methods for encryption and decryption wherein a ciphertext is generated. More particularly, the present invention is related to the use of symmetrix private key incryption. Once the sender and receiver have exchanged key information, encryption of a message by the sender and decryption by the receiver is accomplished in a direct manner.
  • Vernan created a telegraphic cipher system (U.S. patent No. 1,310,719; issued July 22, 1919) which used the addition of the value of a message character on a paper tape with another character on a looped key tape; the sum of the values was transmitted as the cipher character. It was soon recognized that the security of the method relied on a very long key tapes. Later to eliminate excessively long key tapes, Morehouse (1918) connected two Vernan telegraphic machines together employing two separate looped key tapes so that the output of the first modified the output of the second and this combined output encoded the message tape to create an enciphered message.
  • the moduli (m,) are chosen to be relatively prime to each other.
  • the method described by this patent requires that multiple and different moduli must be used at the same time to calculate different residues which are transmitted to a receiver to uniquely define the number which was encrypted.
  • the encryption method described herein does not use multiple moduli and is different from this patent. Because different moduli are not used, the encryption/decryption apparatus may be simpler in design.
  • Vigenere cipher relies on the fact that XOR (base 2) is its own inverse and that the encrypting key (masking bytes) are repeated many times.
  • the Variant Beaufort cipher is equivalent to the Vigenere cipher with the key character n - k).
  • the Variant Beaufort cipher is, in fact, the inverse of the Vigenere cipher since if one is used to encipher the other is used to decipher.” Historically the Vigenere and Variant Beaufort ciphers have been applied to whole letters or characters.
  • the value (position in the alphabet) of a character has a number either added or subtracted to it (modulo the length of the alphabet) and the resultant number is used to specify a character position in the alphabet and the character in that position is sent as the ciphered character.
  • BCN refers to the binary to base n conversion of a number and the representation of the base n number as a digit shown in binary.
  • a common example (base 10) is BCD (binary coded decimal) where the values 0 through 9 are represented by 4 binary bits.
  • a byte is defined as two or more bits. In typical usage a byte is considered to be, but is not limited to, eight bits.
  • arrays are described as being comprised of elements. Such elements are defined as any actual or logical grouping, for example: a bit, a nibble, a byte or word of any length. It is an object of the present invention to provide an encryption/decryption apparatus and method that does not depend upon the use of thesaurus's and/or synonyms and/or other forms of look-up tables.
  • an encryption/decryption apparatus where a message or information expressed as elements or characters is to be encrypted from transmission or sending to another where the message will be decrypted.
  • a mask of elements or characters is defined and utilized in the encryption/decryption.
  • the message elements and mask elements are converted into corresponding elements in another new number base system, where this new number base system is not binar .
  • the converted message and mask elements are combined, element by element, respectively, thus forming a new set of elements, which are defined as a ciphertext.
  • This ciphertext may be sent or transformed into a set of elements in yet another number base that is suitable for transmission.
  • mask elements identical to those used for encryption, are converted into corresponding elements in another number base (the same number base as that of the digits of ciphertext. Then these elements are combined, element by element, respectively using the inverse from that which was used for encryption, thus forming a new set of elements which when converted to a number in the original message number base is the plaintext message.
  • XORn (XOR+ and XOR-) describes an exclusive-or operation (base n) defined as: let the numbers A and B base n be defined (for m digits) as:
  • XORn is identical to the standard XOR operation.
  • An advantage of the present invention is that an encryption method employing an XOR (base 2) is strengthened by the use of a base greater than 2. This is because A XORn B XORn B does not equal A.
  • each byte to be encrypted and each masking byte (key byte) in a preferred embodiment are converted from binary into a string of digits or elements base n (n>2) and the operations of equation 1 and 2 are applied to these digits in a systematic manner. Only one number base, or moduli, is used at a time.
  • the equation 1 and 2 are used to advantage since there is no repeating key (as a key to usually thought of) because the key is now the sequence of digits resulting from the conversion of binary masking bytes to digits of another number base.
  • the masking byte string is now not limited to a few characters, but can be a very long series of bytes. Though it would still be possible to have a repeating series of digits if the masking bytes followed a repeating sequence, the ready availability of arbitrary masking bytes in the computer environment should lessen this occurrence.
  • These bytes may be derived from any of several digital sources including, but not limited to, the sampling of digital sources, the application of numeric hashing functions, pseudo-random number generation and other numeric operations.
  • equation 1 is used for encryption and equation 2 is used for decryption. Since these are inverse ciphers, in another preferred embodiment equation 2 is used instead for encryption and equation 1 is used for decryption. For simplicity, only the first method is shown, but the implementation of the second scheme will be understood by someone skilled in the art.
  • Arbitrary and random numbers are created by normal digital processes.
  • Most digitized music, which comes on a CD-ROM, is 16 bits of Stereo sampled at a 44.1 kilohertz rate. This produces approximately 10.5 million bytes per minute. Of these about one half may be used as arbitrary data bytes, or about 5 million bytes per minute.
  • Reasonably random data byte are generated by reading in the digital data stream which makes up the music and throwing away the top 8 bits and sampling only the lower eight bits of sound to produce an arbitrary or random number. Fourier analysis on the resultant byte stream shows no particular patterns. It should be kept in mind that silent passages are to be avoided. If taking every byte of music in order is undesirable, then using every «th byte should work quite well for small values of n between 1 1 and 17.
  • the error correction inherent with a music CD- ROM is not perfect and the user might want to convert the CD-ROM music format to a WAVE (.WAV) file format and then send the WAVE (.WAV) file to someone by either modem, large capacity removable drive, digital magnetic tape cartridge, or by making a digital CD-ROM containing the WAVE (.WAV) file.
  • Another source of arbitrary or random digital numbers may be found in the pixel by pixel modification (ex-clusive oring, adding, subtracting) of several pictures from a PHOTO CD-ROM, again looking at the low order bytes.
  • Computer Zipped (.ZIP) files and other compressed file formats can be used. The sender and receiver must agree ahead of time on the sources to be used for the masking bytes and how these sources will be sampled and/or combined to create the masking bytes to be used to encrypt and decrypt a message.
  • the intelligent sampling of digital sources can be used to advantage to lessen the reconstruction of the byte stream used for encryption.
  • encryption and hashing algorithms may be used to modify the digital sources prior to their use.
  • the modification of pseudo-random numbers for tables, arrays and/or masks may also be used to advantage.
  • Fig. 1A is a flow chart outlining an encoder process of a preferred embodiment of the present invention
  • Fig. IB is a flow chart outlining a decoder process of a preferred embodiment of the present invention.
  • Fig. 2 is a block diagram of the encoder/decoder.
  • Fig. 1A shows a preferred embodiment of the steps for encoding a binary value.
  • binary information to be encoded A
  • step 2 binary information to be encoded
  • step 2 the binary information is converted into digits of characters (A') expressed in another number base N.
  • step 3 the digits or characters (B') are combined in step 4 according to Eq. 1, resulting in digits C expressed in number base N.
  • the C digits are an encrypted form of the original information A.
  • these digits C are converted to a binary number (C) which is a convenient base for sending to a receiver.
  • Fig. IB shows the steps needed for a receiver of the digits sent as described in Fig. 1A to decode the received encoded digits.
  • step 6 the encoded binary digits C are received for decoding.
  • step 7. the C digits are converted into digits in the number base N forming digits C.
  • step 8 the digits B' are stored .
  • the digits C and B' are combined in step 9 according the Eq. 2 which results in the digits A'.
  • the digits of A' are converted back into the original binary A.
  • Eq. 1 and Eq. 2 may be reversed, where Eq. 2 is used in step 4 of Fig. 1A, and Eq. 1 is used in step 9 of Fig. IB.
  • the binary information A may be exprtessed as 8 bit bytes, but any size byte may be used.
  • A', B' and C are numbers expressed as digits in a nyumber base N.
  • source B' information may be form any random, pseudo-random. Or arbitrary source, as describe herein.
  • other logic/arithmetic operations may be used to provide additional security as substantially and step of Figs. 1A and IB.
  • M bytes of plaintext are loaded into the INPUT DATA BUFFER, 2, via line 21.
  • M masking bytes are loaded into the DATA MASK BUFFER, 3, via line 22.
  • the address counters, DATA ADDRESS COUNTER, 1, MASK ADDRSS COUNTER, 14, and the OUTPUT ADDRESS COUNTER, 15, are all initialized to 0. These counters will be clocked M times to process a whole buffer.
  • Nl , 7. is the number base to be used for the XOR operation.
  • N2, 10, is the number base to be used for the conversion of the digits (based N 1 ) back into a byte to be put into the output buffer. Normally N2 would be 2 for binary outputs bytes.
  • N3, 13 is the number base for the input data bytes and is normally 2 for binary input bytes. The number of internal digits for the DIGIT CONVERTERS (4 and 5) and the NUMBER
  • CONVERTER, 9 are supplied by DIGITS (the number of digits), 12, via line 32.
  • the number of digits needed is determined by the number base for the XOR operation and the bit width of the bytes to be processed.
  • the DATA ADDRESS COUNTER, 1 is sent via 20 to the INPUT DATA BUFFER, 2.
  • the MASK ADDRESS COUNTER, 14, is sent via 36 to the DATA MASK BUFFER, 3.
  • THE OUTPUT ADDRESS COUNTER, 15, is sent via line 37 to the OUTPUT DATA BUFFER, 1 1.
  • These counters are used to specify which bytes will be selected from the INPUT DATA BUFFER, 2, and DATA MASK BUFFER, 3, and where the resultant byte will be placed in the OUTPUT DATA BUFFER, 1 1.
  • a byte from the INPUT DATA BUFFER, 2 is sent via line 24 to the DIGIT CONVERTER, 5.
  • Nl (the number base for the XORn operation)
  • 7 via line 25 is sent to the "base” inputs for DIGIT CONVERTERS 4 and 5 and the "i base” input of the NUMERIC CONVERTER, 9.
  • N3, 13 (the number base for the input data byte) in this case is set equal to 2 (for binary) and is sent via 34 to DIGITS CONVERTER, 5.
  • N4, 16, (the number base for the mask byte) in this case is also set equal to 2 (for binary) and is sent via 35 to DIGITS
  • the number of DIGITS, 12, is sent via 32 to the "# dig" inputs for the DIGITS CONVERTERS 4 & 5 and the NUMERIC CONVERTER 9.
  • the binary input data byte is converted into digits base Nl in the DIGITS CONVERTER, 5, and the resulting digits are sent via line 27 to the "A in" input of the MODULO N ADDER/SUBTRACTER, 6.
  • the conversion of a binary number to j digits (base n) is done by the successive division of the number by n where the remainder of each division becomes the ith digit for 1-0 to j- 1. Or this conversion may also be accomplished by table look up using tables calculated ahead of time.
  • the binary mask byte is converted in digits base Nl in the DIGITS CONVERTER, 4, and the resulting digits are sent via line 26 to the "B in” input of the MODULO N ADDER/SUBTRACTER, 6.
  • the value of the output number base N2, 10, is sent via line 30 to the "ok base" input for the NUMBER CONVERTER, 9.
  • N2 is not equal to 2
  • number bases other than binary
  • input and output c an alter the operation of the encoder/decoder.
  • the following examples all use number bases greater than 2.
  • N2 the number base for output result
  • Nl the number base for the XORn calculations
  • the conversion of bytes into digits based n is achieved by table lookup instead of by repetitive division of the byte by n.
  • the conversion of the digits (based n) into binary or another number base is also accomplished by table lookup.
  • the input data and masking data bytes are 16 bites wide, and other counters, tables, variable or arrays are used to modify the e/d input of the MODULO N ADDER/SUBTRACTER causing the method of combining digits to be altered (between equation 1 and 2 forms) while the buffers are being processed.
  • the data bytes in the input and output buffers are processed as if all of the bits in the buffer constitute one very large byte.
  • Other preferred embodiments use a byte width, which is larger than 16 bits.

Landscapes

  • Storage Device Security (AREA)

Abstract

Les éléments de texte en clair et les éléments de matrice de masquage sont convertis en chiffres d'une autre base de numération (étape 2). Le chiffres résultants sont combinés modulo la nouvelle base de numération, et pour reconvertir le résultat en éléments, on utilise la base de numération originale qui donne les éléments en texte chiffré (étape 4). Pour rétablir le texte en clair, on prend les éléments du texte chiffré et les éléments de matrice de masquage, et on les reconvertit en chiffres dans la même base de numération que ce que l'on a utilisé pour le cryptage. On utilise alors une combinaison arithmétique inverse de ces chiffres, modulo la nouvelle base de numération, la reconversion du résultat de cette combinaison en éléments selon la base de numération originale donne alors les éléments du texte en clair original.
EP99973856A 1999-05-18 1999-05-18 Codeur/decodeur a plusieurs bases de numeration utilisant une relation de ou exclusif Withdrawn EP1183819A4 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US1999/010929 WO2000070818A1 (fr) 1998-02-07 1999-05-18 Codeur/decodeur a plusieurs bases de numeration utilisant une relation de ou exclusif

Publications (2)

Publication Number Publication Date
EP1183819A1 true EP1183819A1 (fr) 2002-03-06
EP1183819A4 EP1183819A4 (fr) 2003-04-16

Family

ID=22272778

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99973856A Withdrawn EP1183819A4 (fr) 1999-05-18 1999-05-18 Codeur/decodeur a plusieurs bases de numeration utilisant une relation de ou exclusif

Country Status (3)

Country Link
EP (1) EP1183819A4 (fr)
JP (1) JP2003500898A (fr)
CA (1) CA2371446A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5717760A (en) * 1994-11-09 1998-02-10 Channel One Communications, Inc. Message protection system and method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5717760A (en) * 1994-11-09 1998-02-10 Channel One Communications, Inc. Message protection system and method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of WO0070818A1 *

Also Published As

Publication number Publication date
CA2371446A1 (fr) 2000-11-23
EP1183819A4 (fr) 2003-04-16
JP2003500898A (ja) 2003-01-07

Similar Documents

Publication Publication Date Title
US5751811A (en) 32N +D bit key encryption-decryption system using chaos
KR100657062B1 (ko) 정보 암호화 방법 및 이 방법을 실현하는 장치
US5717760A (en) Message protection system and method
US5483598A (en) Message encryption using a hash function
AU729638B2 (en) A non-deterministic public key encryption system
US6125182A (en) Cryptographic engine using logic and base conversions
US7190791B2 (en) Method of encryption using multi-key process to create a variable-length key
JPH09230787A (ja) 暗号化方法および装置
JPH0863097A (ja) データを暗号化するための対称暗号化方法およびシステム
KR20110004474A (ko) 갈루아 폐체 암호 시스템
CA2410418A1 (fr) Generateur de nombre pseudo-aleatoire
US6128386A (en) Multiple number base encoder/decoder using a corresponding exclusive or function
WO2006030447A1 (fr) Procede et systeme de transformation informatique
JP2009116348A (ja) データの非相関化方法
CA2410421A1 (fr) Modulos arithmetiques parallele utilisant des operations logiques binaires
Masoodi et al. Symmetric algorithms I
US6301361B1 (en) Encoding and decoding information using randomization with an alphabet of high dimensionality
CA2410608A1 (fr) Procede de validation d'un message crypte
EP1287639A2 (fr) Marqueurs de fin de message
EP1183819A1 (fr) Codeur/decodeur a plusieurs bases de numeration utilisant une relation de ou exclusif
JPH04335730A (ja) 暗号送信装置、暗号受信装置、暗号通信システム
EP1179243A1 (fr) Moteur cryptographique utilisant la conversion de base de numeration, des operations logiques et un generateur de nombres pseudo-aleatoires pour des matrices de donnees de fa on a augmenter la dispersion dans le texte chiffre
AU750408B2 (en) A method of combining a serial keystream output with binary information
WO2002025862A2 (fr) Codeur/decodeur de bases numeriques multiples a segmentation et bases numeriques a variation dynamique
WO2000064096A1 (fr) Systeme de communications cryptees

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20011029

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

A4 Supplementary search report drawn up and despatched

Effective date: 20030227

RIC1 Information provided on ipc code assigned before grant

Ipc: 7H 04L 9/06 A

17Q First examination report despatched

Effective date: 20031020

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20040331