EP0914733A1 - Cryptage multimatriciel pour transmission privative de donnees - Google Patents

Cryptage multimatriciel pour transmission privative de donnees

Info

Publication number
EP0914733A1
EP0914733A1 EP97934547A EP97934547A EP0914733A1 EP 0914733 A1 EP0914733 A1 EP 0914733A1 EP 97934547 A EP97934547 A EP 97934547A EP 97934547 A EP97934547 A EP 97934547A EP 0914733 A1 EP0914733 A1 EP 0914733A1
Authority
EP
European Patent Office
Prior art keywords
data
matrix
input
array
characters
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
EP97934547A
Other languages
German (de)
English (en)
Inventor
Ernst Erich Schnoor
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
Priority claimed from DE1996130354 external-priority patent/DE19630354A1/de
Application filed by Individual filed Critical Individual
Priority to EP97934547A priority Critical patent/EP0914733A1/fr
Priority to DE0914733T priority patent/DE914733T1/de
Priority claimed from PCT/EP1997/004062 external-priority patent/WO1998005142A1/fr
Publication of EP0914733A1 publication Critical patent/EP0914733A1/fr
Withdrawn legal-status Critical Current

Links

Definitions

  • the technical field of the invention concerns methods for the encryption of data to be safely transmitted within electronic networks 1 .
  • the invention also concerns a device in chip form for executing the aforementioned method.
  • the chip may be designed to encrypt the text (at the sender's end) . It may according to the invention also be designed to decrypt encrypted data (at the receiver's end) .
  • Encryption programs are in public domain for a long time; their spreading grows due to the evolutional expanding of networks. Many encryption processes call themself “safe” or “private”, but use a vast amount of processing software and hardware.
  • the object of the invention is such that security is achieved with little effort and easy handling by an easy-to-cope-with processor performance, even though the transmission of the encrypted (encoded) files itself is simple.
  • the invention uses an n-dimensional matrix (e.g., two- dimensional: 10 x 10 lines and columns [decimal number system], 16 x 16 lines and columns [hexadecimal number system] , up to 64 x 64 lines and columns [number system 64] and even higher, in which matrix a specific quantity of ASCII characters is contained in an irregularly distributed manner.
  • the specific quantity may be some ASCII characters (matrix 10 x 10 to matrix 15 x 15) , all ASCII characters (matrix 16 x 16) or character combinations, the available elements of which reach beyond the number of single ASCII characters (matrix higher than 16 x 16) .
  • the distribution of the elements in the matrix is depending on a user's inputs as a variable generation of keys. For instance, when encrypting via a two-dimensional matrix, every individual ASCII character of the (unciphered or "plain") input data stream or file is transformed to a four-digit number which is then split up into two two-digit numbers. The digits of the two new
  • the invention employs a pseudo-random free sequence of digits (claim 13), being predetermined and almost independently obtained at both ends of the transmittal chain, just the type or the analytical function and the user key (input or fixutn) is used. Thus, the sequence may be generated independently at both ends. The sequence is then employed (used) or further processed for encrypting.
  • the method is inverted (or reversed) for the decryption (deciphering) .
  • the four-digit number is derived from the two characters of the encrypted file or data stream and the indices of their arrangement in the respective matrix.
  • the transformation in reverse order will then result in the ASCII character of the recovered input data file or stream, after "private transmission" via a link has taken place.
  • the sequences can now be used to obtain a matrix (array) with distributed ASCII elements by reduction-filtering said sequences to a reduced sequence which has each digit occuring only once. If, for example, the reduction-filtering is to achieve a 10 digit sequence, all digits "1" to "9" occur once, but freely distributed. One example is to scan the 80 mentioned digits and take a digit only into the reduced-filtered sequence, if it is not prior occured. For each matrix to be obtained, this can be performed corresponding to the amount of digits available in the respectively selected digit system (10, 16, 60 or similar).
  • the array (matrix) with distributed ASCII elements which are filling said matrix purposefully and uniquely is obtained by swapping rows and columns according to the reduction-filtered sequence.
  • a number of operations of swapping alternatively columns and rows proceed before the finally distributed matrix for encrypting the text is obtained. More than one matrix can be used to enhance the private transmission of data; a compromise between complexity and safety is the use of two encrypting arrays (matrixes) with freely distributed ASCII elements.
  • Figure 1 is a first embodiment of a software implementation according to the invention.
  • Figure 2 is a second block diagram represented embodiment of a hardware implementation according to the invention in a device delivered as chip.
  • Figure 3a, Figure 3b are examples of two matrices or arrays A and B having distributed ASCII characters according to the distribution and matrix filling step according to the invention .
  • Figure 4b are examples of larger matrices or arrays having a dimension of 2 and 15 columns and 15 rows each, filled with almost the full 8 -bit character set of a standard
  • Figure 4c is a standard ASCII table having no “distribution” according to the invention, but a "regular order of sequence” .
  • Figure 5a, Figure 5b are two similar matrices according to Figure 3a and 3b achieved with the embodiments of Figure 1 or Figure 2 of the invention, but with a different key input than the matrices of A and B of Figure 3a and 3b.
  • Figure 5c is an irregular sequence of digits, e. g. generated from the natural logarithm, used for indexing the arrays .
  • Figure 5d is the distribution of Figure 5c and its irregular sequence of digits cleared for double numbers (digits) to fill up the rows and columns of a matrix or array or to irregularly distribute regular organized ASCII characters to form a distributed array.
  • Figure 6 is an example of a file having 50 "e" characters in a continuous stream of input data.
  • Figure 7 is a two-page picture of what is achieved as output file when using the e-file of Figure 6 with an encryption process according to the invention having 10 x 10 matrices A and B and using a certain three-key data input to define the encryption process according to the invention.
  • the method may be implemented as a sequence of program steps or in hardware implementation with micro sequencing.
  • the software can be performed in any current program language (BASIC, PASCAL, C++, UNIX, and others) . Assemblers for hardware may be utilized.
  • the receiver of a message who, in turn, decrypts the message.
  • the respective user inputs (sender and addressee) for encrypting the plaintext and for decrypting the encoded text as variable generation of keys.
  • n-dimensions An irregular distribution of ASCII characters, systematically arranged in n-dimensions .
  • the number (n) of dimensions in practical application may be 2 (10 x 10 to 64 x 64 characters) up to 8 (2x2x2x2x2x2x2x2 characters) .
  • step 100 Up to three key data words a, b, c will be given in step 100, up to a total length of 36 characters (for instance, the data in square brackets) . They can be typed in by a keyboard KBD as shown in Figure 2, they can as well be fixed parameters in a en- /decryption device, not to be altered by the user, but the manufacturer.
  • Input a PIN (personal identification number) with 4 figures, e. g. [ 1234 ]
  • Input b Bank account number with up to 16 characters or any other identifier of the sender with arbitrary blanks, according to his choice, e. g. [ 9876-543-ABC ]
  • Input c Password with up to 16 characters (with arbitrary blanks) , e. g. [ Mount Everest ]
  • Two internal check values Kl , K2 may additionally be given in step 110 or may be generated from the key data which are used for identification of the sender and for checking the inputs a, b and c at the addressee's end. These check values will be incorporated in the message to be encrypted.
  • the method will calculate a first irregular sequence of the numbers from 0 to 9 (or from 0 up to the highest number of the respectively used number system) .
  • the irregular sequence may e. g. be generated from the logarithm to the base of 10 (common logarithm) , the natural logarithm (base e) , the logarithm to the base of 2, the square root, sine, cosine, tangent, arc tangent or the comparable mathematical operations with at least 10 places behind the decimal point.
  • a respectively longer irregular sequence is determined for higher number systems .
  • An example of such sequence may be seen from Figure 5c.
  • the length may be adapted to the size of the matrices to be used for encryption:
  • Matrix 10x10 e. g. [ 0961742538 ]
  • Matrix 16x16 e. g. [ 0ADBE96174253F8C ]
  • a second irregular sequence will be generated according to the same principle but with a changed starting point.
  • Matrix 10x10 e. g. [ 6741289503 ]
  • Matrix 16x16 e. g. [ 6D7C41A289FE50B3 ]
  • First and second sequence will be combined in step 101 to form one matrix to the extent of the respectively used number system (matrix A) , i. e., in such a way that there will be in toto an irregular but complete distribution of all elements of the matrix in all lines and columns of the matrix (this is called the filled distribution matrix) .
  • a second matrix (matrix B) will be generated similar to step 101 and according to the same principle but with changed starting point (third sequence and fourth sequence), again with a complete, but different, distribution of all elements of the matrix in step 102.
  • ASCII characters may be used as elements of the respective matrix up to a length of 16 lines and 16 columns; other characters will have to be' selected beyond that. In this embodiment, the combination of two each letters or ASCII characters is implemented.
  • the respective ASCII number (digit) of the input data, to be encrypted is consecutively transformed to a four-digit number ABCD (decimal: between 0000 and 9999) in steps 120 and 121.
  • a multiplicity of operations and combinations may form the transformation (addition, subtraction, multiplication, division, shifting of bits) .
  • the transformed number should not fall below the value 0000 and should not exceed the value 9999 (decimal) , EEEE (15x15) in the number system to the base of 15, JJJJ
  • the four-digit number ABCD is then split up into two halves (AB -> ' ab ' and CD -> 'cd') .
  • the respective pertinent ASCII character is alternately indexed for in Matrix A and Matrix B (lines 0 to 9 for a,c and columns 0 to 9 for b,d) and linked to form the encrypted file or data stream in step 130.
  • the encrypted data is double the length of the initial input data.
  • the coded data is four times longer than the input data.
  • the method may in a further embodiment determine a check value K3 as sum of all ASCII characters of the plaintext and will incorporate this check value in the message to be encrypted according to step 110.
  • program steps (1) to (7) as above will first be performed in the same manner as for encryption.
  • Program steps (8) and (9) will be performed in reverse order. In doing this the respective indices (line and column) will be established in the appropriate matrix if there is a conformity between the transmitted coded character and the corresponding character in Matrix A or Matrix B and the found two digits each will again be combined to form the four-digit number.
  • the initial number is then determined from the four-digit number by reverse transformation of step (8) . From that, the pertinent plaintext ASCII character searched for in the plaintext matrix.
  • the sequence of decryption will first of all, decrypt the data containing the check values Kl and K2 to compare them with the addressee's inputs a, b and c. If there is a conformity, the decryption of the data stream or file will continue.
  • the sum of all deciphered ASCII characters will be determined and compared with the transmitted and deciphered check value K3 in the further embodiment as mentioned in step (10) .
  • the decrypted plaintext or clear picture will only be released for readable representation if there is a conformity.
  • a first input step 100 the key data is given by the user, to define the distribution of the elements in the matrices A and B in step 101.
  • the input 100 can also be a fixed input if the chip according to Figure 2 is a pre-programmed chip having a fixed key data as supplied by the manufacturer. From the key input 100, not only the distribution 102 according to the generation step 101 are performed, but also the input data to be encrypted, as supplied in step 120, are transformed to a first and second index in step 121 to address the array in step 102.
  • the same key input is used to supply both encryption steps, the distribution 101 and 102 of the matrices and the row/column indexing or addressing in step 121.
  • the internal check values Kl , K2 in step 110 may also be generated by the key input 100, the latter check values may in a further embodiment however also be supplied separately.
  • the output encrypted text from the indexing step 121 as selected from the central matrix with their distributed elements will after step 102 be stored in a file, which can be transferred via a link or can be stored on a disc or other memory device.
  • This is the encrypted characters level, whereas the input level in steps 100,110,120 are the readable characters and thus the readable level .
  • characters is not to only mean written characters, they may also be picture characters to define pixels or parts of pixels of video pictures.
  • the hardware implementation employs in one embodiment of Figure 2 the process as described in Figure 1.
  • the two RAM areas 10 and 11 define in a certain place of the chip 90 the areas where the distributed elements according to step 101 and 102 are placed.
  • the distribution is controlled by control means 30 via the address bus to address the RA s, and when addressing a certain RAM 10 or 11 the data on the data bus will carry the character to be stored in a certain place of this RAM.
  • the data bus DATA and the address bus ADDRESS are further used to transfer the key values from the keyboard 60 via the interface 40, when the interrupt along the interrupt or control bus CC interrupts the control 30 to indicate that key values are now present.
  • a fixed value key can be placed in a certain ROM area of the chip or can be implemented in other programmable fashion easily accessible by the manufacturer, but difficult to alter by the customer or user.
  • the chip then bears a number or a couple of keywords to be delivered on demand along the control bus CC from the control means unit 30 and via the data bus.
  • An output driving unit 70 supplies the encrypted character as taken from the distributed ASCII characters in RAM 1 and RAM 2.
  • the chip implementation of Figure 2 may be by program inversed to be operated as a de-encrypting device, when having the input driver 71, providing the encrypted characters to the data bus, as shown in phantom.
  • This device operates according to the steps described before as decryption process and the skilled man will be in the position to build the decryption chip from the information given above.
  • Figure 3a to Figure 4b are examples of distributed matrices or arrays as they may be stored in RAM areas 10 or 11 according to Figure 2 or in steps 101 and 102 according to Figure 1.
  • Matrix A in Figure 4a shows 225 ASCII characters uniquely distributed - no value appears twice - but freely arranged according to the key inputs.
  • the matrix A has less than 256 ASCII values, due to 31 ASCII values are used as control characters and cannot be represented pictographically .
  • Figure 5a and 5b show 10x10 matrices, as can also be used in RAM areas 10 and 11 of Figure 2.
  • the distribution works along a sequencing step, and the control unit 30 operates along the character string or digit line of Figure 5c and takes one character at a time to define the next character to be placed in the RAM area 10 or to define the indexing addresses of an input character to be encrypted.
  • the irregular distribution of the ASCII characters in e.g. matrix A will be explained by the help of Figures 5a, 5c and 5d, using an analytic mathematical function, e.g. the logarithm and a key data value, as provided by the user in step 100 as input variable a, b or c .
  • an analytic mathematical function e.g. the logarithm and a key data value
  • the logarithm will provide a digit sequence, which is no pseudo random sequence of digits.
  • the inventive sequence having each digit more than one time.
  • the distribution of digits seems irregular, but can be reproduced at the other end (the receiver's end) by employing the same analytical function, e.g. the logarithm, and the same key input value "a", as for example communicated between receiver and sender. It is a predetermined digit sequence (numbers 0 ... 9) , depending on the user keys and the chosen analytical function.
  • the invention operates in one embodiment to select the digits one by one and to clear the sequences of Figure 5c into a digit sequence of Figure 5d where no digit appears twice.
  • the first digits may illustrate this embodiment, the digits "13694" of the first line in Figure 5c are transferred 1:1 into the first sequence of digits in Figure 5d.
  • another digit "4" appears in Figure 5c, which would be a dual use of the digit "4" and therefore it is deleted from the sequence of digits in the first line of Figure 5c.
  • the next digit used for Figure 5d sequencing is the digit "5", which has the place 39 in the first line of Figure 5c.
  • the position 39 and the further positions to select digits from the first line of Figure 5c may be fixed positions as defined by internal program or by programmed devices. Each time the next place has a digit, which already appeared, the next but one position in the digit sequence is checked.
  • the shown examples of positions 1, 2, 3, 4, 5, 39, ... is a mere example of any positions of digits to be programmed.
  • the sequence of Figure 5d may according to one embodiment used for distributing the regularly arranged ASCII characters in standard sequence according to the ASCII code into ten lines and ten columns filled up with digits according to Figure 5d, where in each row there is no dual appearance of the digits 0 to 9. Having provided such a control matrix for distribution purposes it is one of multiply possible distribution rules, to exchange the positions of a regularly arranged ASCII code in a regularly arranged matrix with rows and columns along the dual digit free lines. A few characters will be explained. The left upper character of the ASCII code would stay at its place, since a "1" is mentioned in Figure 5d. The ASCII character right hand to the "1" encounters a "3", it would be placed at the third position in the row.
  • the third position would be placed at the sixth position, the fourth position would be placed at the ninth position, each time in the same row. Such happens for each row.
  • This is one step of distributing many steps of distributing may be chained one to each other, they may also be organized in column fashion, which can be easily understood when transferring the row fashion as described in vertical arrangement.
  • the matrix A appears as the control matrix for encrypting an input data to an encrypted output data file 130.
  • the sender's side and the receiver's side such distribution of matrices can be performed exactly in the same manner, just agreeing a few analytical mathematical functions or according to the above exemplary embodiments positions of digits to be taken sequentially for achieving a distribution control scheme according to Figure 5d.
  • the used arguments for the analytical mathematical functions may be transmitted before forming the distribution matrices A and B. They may also be contained in custom made encryption or decryption chips and therefore not known to the user. As a further embodiment they may also be transmitted via the data link, before encryption takes place, e.g. encrypted according to a standard encryption method not necessarily having high safety requirements, since the key words to be transmitted are only short.
  • FIG. 6 An example of how the invention works is shown in Figure 6 and Figure 7.
  • a difficult encrypting problem is a matrix or a stream of characters which are all the same for a lengthy period. This lengthy period is for example 50 lines of "e” in Figure 6 and this is encrypted according to two 10x10 matrices in Figure 3a and Figure 3b and with the help of the key values mentioned in item 1 earlier along this description, where the user key data was described.
  • Figure 7 has virtually no remaining correspondence if compared to a stream of "e", there is no cycle deter inable and the encrypted data looks like a complicated text or graphical representation, no demonstrance of a stream of only "e” appears. From Figure 7, it can be taken that two indexes were used. The amount of characters is twice after being encrypted.
  • the method according to the invention may be attacked from three sides :
  • the attacker knows the principle of the method and he is trying to find the matrix system and the transformation factors .
  • Transformation to a 4 -digit number of the respective number system includes variations ranging from the initial number to the 4-digit number itself (addition, subtraction, multiplication, division, shifting of bits) . In addition, transformation is also depending on user inputs (key data) which will influence the determination of the 4-digit number.
  • the cipher characters are depending on the following determination factors :

Landscapes

  • Storage Device Security (AREA)

Abstract

L'invention porte sur des procédés de cryptage de données en vue de leur transmission sûre sur des réseaux électroniques. Elle porte également sur un dispositif en forme de puce servant à l'exécution du susdit procédé, la puce pouvant être conçue pour crypter le texte (à l'extrémité émettrice) et également pour décrypter les données cryptées (à l'extrémité réceptrice). Les étapes suivantes sont suggérées: introduction d'au moins un paramètre d'entrée de champ au cours d'une étape de codage pour définir au moins un premier réseau ou matrice d'éléments ASCII répartis, lesdits éléments ASCII remplissant ladite matrice ou réseau de manière précise et univoque mais répartie. Lesdites données d'entrée sont transformées par une transformation en au moins un premier et un deuxième indice en adressant uniquement le ou lesdits réseaux ou matrices de manière à déterminer les caractères cryptés.
EP97934547A 1996-07-26 1997-07-25 Cryptage multimatriciel pour transmission privative de donnees Withdrawn EP0914733A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP97934547A EP0914733A1 (fr) 1996-07-26 1997-07-25 Cryptage multimatriciel pour transmission privative de donnees
DE0914733T DE914733T1 (de) 1996-07-26 1997-07-25 Multimatrixverschlüsselung für vertrauliche datenübertragung

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
DE19630354 1996-07-26
DE1996130354 DE19630354A1 (de) 1996-07-26 1996-07-26 Verschlüsselung zur Datenübertragung
EP97102436 1997-02-14
EP97102436 1997-02-14
EP97934547A EP0914733A1 (fr) 1996-07-26 1997-07-25 Cryptage multimatriciel pour transmission privative de donnees
PCT/EP1997/004062 WO1998005142A1 (fr) 1996-07-26 1997-07-25 Cryptage multimatriciel pour transmission privative de donnees

Publications (1)

Publication Number Publication Date
EP0914733A1 true EP0914733A1 (fr) 1999-05-12

Family

ID=56289782

Family Applications (1)

Application Number Title Priority Date Filing Date
EP97934547A Withdrawn EP0914733A1 (fr) 1996-07-26 1997-07-25 Cryptage multimatriciel pour transmission privative de donnees

Country Status (2)

Country Link
EP (1) EP0914733A1 (fr)
DE (1) DE914733T1 (fr)

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
DE914733T1 (de) 1999-10-07

Similar Documents

Publication Publication Date Title
US6064738A (en) Method for encrypting and decrypting data using chaotic maps
US6219421B1 (en) Virtual matrix encryption (VME) and virtual key cryptographic method and apparatus
US20020131590A1 (en) Key matrix methodology
US4195196A (en) Variant key matrix cipher system
CN101895390B (zh) 一种加解密方法、装置及系统
US20070189518A1 (en) 3-D quaternion quantum fractal encryption
Gautam et al. An enhanced cipher technique using vigenere and modified caesar cipher
CN1551559A (zh) 密码系统中基于用户定义识别码编制公用密钥的方法及装置
CN116032474A (zh) 一种基于大数据计算机网络安全防护系统
US20020159588A1 (en) Cryptography with unconditional security for the internet, commercial intranets, and data storage
Murtaza et al. A new symmetric key encryption algorithm with higher performance
CN110543778A (zh) 一种字符数据线性随机加密和解密算法
CN104396182A (zh) 加密数据的方法
CN1241352C (zh) 加密二进制编码信息的方法
US20020150240A1 (en) Key matrix system
CN116418481A (zh) 一种文本隐私数据双重加密保护方法、装置及设备
CN112152775B (zh) 基于二维Henon-Chebyshev混沌映射和基因操作的图像加密方法
WO1998005142A1 (fr) Cryptage multimatriciel pour transmission privative de donnees
Sermeno et al. Modified Vigenere cryptosystem: An integrated data encryption module for learning management system
CN115664639B (zh) 一种金融资产交易数据传输加密方法
EP0914733A1 (fr) Cryptage multimatriciel pour transmission privative de donnees
US11038668B2 (en) Transposition encryption alphabet method (TEAM)
CN110061832B (zh) 以汉字作为密码的对称密码算法的实现方法
CN109409106B (zh) 一种新型无穷字母表的香农完美保密方法
Lauria On neurocrytology

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: 19990224

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT DE GB

TCAT At: translation of patent claims filed
DET De: translation of patent claims
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20040203