DE102006045224A1 - Front page inconsistent with disclosure, abstract based on front page. Patent Office notified - User data transfer integrity connection authentication and checking method, involves authenticating and checking between two or more patterns - Google Patents

Abstract

The method involves authenticating and checking between two or more patterns and between one or more hierarchies. A linking of detected and separation mechanism of prime number sets is utilized in the method. A decipher area in content security at statistical tables before generating rightful separation has the character of a complex book key and an identification of both communication of partners is assumed. The method describes the authentication and checking between two or more patterns, between one or more hierarchies and thus gradated rights. Documented is done in a simple manner such that the authentication and checking method are used for a content decoding. The authentication and checking are not to be decoded with current statistical methods or other decipher methods and at the same time uses the linking of detected and new separation mechanism of the prime number sets. The decipher area in the content security at statistical tables before generating rightful separation has the character of a complex book key and assumes the identification of both communication of the partners.

Description

The The method described below describes the authentication and authentication between two or more partners, between one or more hierarchies and thus graded rights.

On a simple way is documented that for authentication and authentication methods also for content encryption be used with common statistical methods or other deciphering methods decipher are, and at the same time the link recognized and fundamentally new decomposition mechanisms of the prime worlds uses.

Of the in the content security kept decryption space at static Has tables of previously generated lawfully decomposition the character of a complex book key and sets the knowledge of both communicating partner ahead.

The implementation process in the hardware implementation

The Method uses previously unknown crypto methods, which from the decomposition arbitrarily large number rooms of prime numbers or not prime numbers.

description 1 :
Source (A) and sink (B) are separated by a communication area.

Source Components are represented with Arabic numbers, sink components Shown with underlined Arabic numbers.

The main program unit = CPU ( 1 ) communicates permanently with the volatile memory ( 2 ) and the non-volatile memory ( 4 ) in which applications are kept and, if necessary, in ( 2 ) are uploaded.

A programmable device ( 3 ) communicates with ( 2 ) and loads the program SynD high, at the same time it causes ( 4 ) To activate programs at the network filter level and with the software embedding of the CPU (central processor unit), the BIOS (Binary input and output system) ( 5 ) via network interface cards ( 6 ) to communicate. The remote site ( 6 ) indicates ( 2 ) and causes ( 3 ) to start the program SynD, the generated prime / non-prime number is generated by a separate program in ( 3 ) into an Internet Control Management Program (ICMP) stack as a pattern and from 6 ) to ( 6 ) Posted. A subroutine ( 7 ) of SynD gets from ( 1 ) and leads to the check whether the sink is authorized. The under ( 3 ) generated prime number / non-prime number is with ( 4 ) and accepted or rejected. If the authentication is accepted, the information accepted for this sink and as a mark is verified = Acknowledge (ACK) under Transport Control Protocol (TCP) and a security tunnel (VPN, virtual network path) is established. If the sink does not recognize (identify) a prime / non-prime number via Pattern and ICMP, then that location remains ready to call in a queue and the ICMP Request = ICMP Request is sent as the default ping by the operating system until the registered repetition is finished. Outwardly, this ICMP request acts like a standard echo request. The sink (B), which recognizes the sent prime or non-prime number, is activated and rollingly sends the complementary prime or non-prime number to the source (A).

In this figure ( 2 ) portrays the basic functionalities according to concatenated Goldbach decompositions.

The Variety of applications, in particular the use of mobile communications equipment, let yourself derived from it paradigmatically.

2 describes in principle the primary exchange of information, which is complemented by the principle of synchronously rolling encryption.

(A) and (B) represent two computer systems interconnected via the public network communicate. (B) receives the request from (A) and responds with an "alive." Thus, (A) knows that the communication link is via ICMP and later over TCP is buildable.

process (a) leads after finding that (B) is achievable by means of ICMP, that Process (b) at the sink - a any client that authenticate to the source (A) must, is called. This process (b) triggers the return of an identification number on (A) off.

Of the Initial process is triggered by hand or automatically by (A). there sends (A) to the point to be authenticated (B) a combination of numbers. This number combination was for the main process (d) (SynD) determined and in a central memory stored safely. The sink (C) in which this number / numbers are not saved is / are not addressed by this / these numbers / numbers (activated). These numbers and other numbers stored in the sink, can e.g. above Secure transmission of the ICMP tunnel become. The SynD algorithm generates two numbers, the valid and after Goldbach's or Anti-Goldbach's decomposition were formed. [MNDA-Cwienk2006]

The numbers implemented as numerical values Z ₁ ... Z _n are the starting point for the principle of synchronously rolling encryption (see 3 ) and can also be changed at intervals.

These Numbers are sent from (B) to (A) and vice versa. The education this number happens in the microsecond range and has no effect on the performance of an overall system. After (A) this number from (B), (B) is considered authenticated and vice versa. For subsequent transfer of a payload data block is coupled to the authentication Number (x) upstream, which after the end of the data block (DBL) a Coupled number (y) follows.

This Procedure can be continued as often as you like (user-dependent) (see the example in the NDA part).

To same principle (suitable) user data transmissions from individual sinks (even at the same time) to the source.

The for 3 Exemplary numerical values (the implemented rolling) numerical values Z ₁ ... Z _n can be changed at intervals.

The genesis of these numbers Z ₁ ... Z _n is incumbent on the licensee, to whom a lot of these numbers of n-tuples are made available.

Regarding the algorithm is referred to the monographs (under NDA standing). [MNDA-Cwienk2006]

Principle of Synchronous Scrolling Encryption

The prime / non-prime number stored at (3) is sent to (4) and accepted or discarded. The source then transports the cyclically succeeding prime / non prime number to the sink. There, the cyclically following prime number / non-prime number Z _{3 is} called and then the payload is transmitted to the sink. The payload is preceded by 1 (x1) is a "coupled" number TMI and the end of the payload is indicated by the coupled number GZW 2 (y2). The sink acknowledges the receipt of this Nutzteilblocks with transmission of the cyclically succeeding prime / non-prime number Z ₄ to the source, whereupon the source generates the following number (prime or non-prime number) Z ₅ and sends it to the sink associated with the second payload block The reception of this block is confirmed by sending the number Z _6. This cycle can be done in subsequent steps be continued analogously, if the user calls such a high-grade encryption as necessary.

Principle Summary

• (1) A sends ICMP and Z ₁ as a pattern to B.
• (2) B receives Z ₁ and immediately rolls through the number Z ₂ sent to A via ICMP.
• (3) A receives Z ₂ , rolls on Z ₃ and sends user data via TOP, the user data is fragmented and marked in blocks.
• (4) B receives payload data block 1 up to the mark. After receiving the marking, the system rolls to Z ₄ and restarts the authentication procedure.

State of the art

The common encryption method support essentially based on the small Fermat's theorem and the prime factorization, which had been initiated with RSA. Offset, replacement, book key and other common ones Methods for converting plain text in cipher always have there the border, where transmission method without authentication and block text encryption.

Table 1 lists the most recent patents registered with the DPMA. In focus, these patents modify the already common key algorithms and methods. Table 1: The last 10 patent applications in the field of data encryption (as of 13.09.2006)

The Authentication is the process of verifying the identity of a person Counterpart, e.g. a person, a computer program or an organizational unit (e.g., company).

The Authentication defines the process of proof of one's own Identity.

For both methods, there are already different technical characteristics. These procedures do Minimize the credit card system as well as the creation of a secure connection over the Internet (VPN). Integrity assurance can be achieved by using different key methods that use the same keys for encryption and decryption (symmetric) as well as methods that use different keys for decryption and encryption (asymmetric keys).

The method has the following problem inherent:
Both communicating bodies must have keys. The nature of key distribution is a critical starting point for disclosure.
If a public key is used, the problem of generating the associated asymmetric keys remains for the opening of the crypted text.

Of the common Schlüsselalgorythmus RSA is based on the small Fermat theorem (watch calculator with mod p, where p is a prime / non-prime number. You get for each number, which is multiplied p times with itself, the starting number). This system was further developed by Rivest, Schamir and Adleman. Cryptographic systems with public key known as asymmetric systems, have difficulties perform an operation with a bit count greater than 512 bits is. Due to this fact, in addition a "repeating Customer structure " has been emerging as a keen competition for the RSA key for some time Procedure, especially against the background of Mobile IP ideas utilized where elliptic curves identified by equation and thus become the last Fermatian theorem approach.

With the transmission protocols TCP / IP and the increasing importance of IPsec of today's Internet Standards were set up to implement source-sink mappings On the one hand enables and authentication method on the other hand containerized recording capacity for different key processes guaranteed.

A Another perspective is offered by the new Internet Protocol IP Next Generation (IPnG / IPv6). For The methods already described will extend the addressing spaces and along with the expansion of the overhead to accommodate more complex Schlüsselalgorythmen, be this symmetrical or asymmetrical nature, allows.

The known RADIUS protocol for authentication and authentication, in the long title means It also Remote Authentication Dial in User Service, is a protocol according to an industry standard described in RFC2865 and RFC2866 is. A RADIUS client, usually a default client or VPN server or wireless access point, sends to user credentials and connection parameters in the form of a RADIUS message to the RADIUS server. The RADIUS server authenticates and authorizes the RADIUS client request and sends the RADIUS response message back. RADIUS clients also send RADIUS-Kontoführungsmeld Ungen to RADIUS servers. About that support out the RADIUS standards use RADIUS proxies. A RADIUS proxy is the computer that supports the RADIUS messages between RADIUS Sends computers. The RADIUS messages are always called UDP messages (User Datagram Protocol) sent. The UDP port 1812 is for the authentication messages and the UDP port 1813 for the RADIUS accounting messages used. When using UDP security risks are in purchase taken. UDP has neither sequence numbers nor its own connection setup procedure. That's the door and gate opened for one falsified Introduction of UDP packets. As well as the specification of the source port optional, lets no reliable ones Identify the sender based on the IP address or port carry out. All applications that use UDP must have appropriate authentication mechanisms bring in yourself. Generally speaking, UDP is an extension of the IP protocol is. The extension consists in the transmission from source and destination port, via which an assignment to the Processes happens. UDP packets are transmitted in the data field of IP packets. Contains UDP no further action for connection control, is thus connectionless and is considered an unsecured transmission service.

Comparative consideration

In In summary, the internet security protocols become one another related.

Here S-HTTP, a protocol which from the point of view of the user is very easy to handle, which offers only horizontal and within the applications a granularity of security functions, vertically with hosts and subnets this possibility does not exist. In addition, only end-to-end security can be formed here. With S-HTTP, security certificates are offered in advance, which the initiator uses as a be trusted. This requires the procedure of exchanging information that takes place in an unsecured environment. The method is therefore not an authentication method, but merely checks the authenticity of an entry.

PGP (Pretty Good Privacy)

at This method does not encrypt the whole message asymmetrically, but instead the message is symmetric and the key used is asymmetric (Hybrid encryption). possibility the 1: n encryption, no ONLINE authentication, the communication base remains unsecured, CONTENT-Security is the goal. No authentication, probably but finding the authenticity and message with the disadvantage that the entry of an unauthenticated body can (use RSA, DH / DSS algorithms).

PGP is easy to difficult to handle from the user's point of view, depending on the corresponding client integration. The application transparency is not required here. The application dependencies are very high, Signature functions are available, the granularity of the safety functions are neither horizontal (equivalent stations) nor vertical (server technology, hierarchically higher arranged technique) existent. The administration is relative costly and again, it's all about end-to-end security.

S / MIME is mail encryption, an authentication (in principle an evolution of PGP). E-mails are transmitted in encrypted form. Sender and receiver information stay open. S / MIME uses public key procedures. Only by retrieving the existing public additionally and Dedicated Hidden Public Keys allows for a conditional source-sink identification realize.

S / MIME is for the user easy to difficult to handle. The application transparency is not necessary here, but the application dependency is very high, signature functions are present, the granularity of the safety functions are neither horizontal nor vertical possible. A relatively simple administration is only mediated here an end-to-end security.

SSH is considered a very easy to handle protocol. An application transparency is not necessary, the application dependencies are through tunnel possibilities medium high. A very crucial thing is that signature functions are not available. The granulability of the safety functions is not present horizontally and only very slightly vertically Tunnel link functions given. The administration is very easy with key distribution initialization and only end-to-end security features in multi-level complex network structures are possible.

SSH allows the exchange between source and sink over a largely secure authenticated and encrypted Connection between two network computers. It can only be over TCP / IP be used. SSH is for Point-to-point connections exclusively via the Internet interesting.

n: n ability when mapping authentications when using SynD.

following become the skills from SynD for producing n: n compounds and to often used cryptoprograms demarcated.

The often used program SSH can not authenticate n: n connections and not be granulated so that just graduated hierarchically Rights of use can be mapped, as SynD allows.

SSL is very easy to handle, the application transparency is high, the application dependency relatively high, but the signature functions are not available the granularity of the safety functions is horizontal and vertically low. independent integration capabilities in hardware and software are difficult and where it is, it is very inflexible. The administration is dependent Infrastructure complex to simple. The multi-sided security requirements in complex network structures are relatively difficult to build and only allow end-to-end encryption.

IPsec plus IKE are extremely easy to handle. Granulizabilities of the safety functions are horizontally non-existent, but vertically high. There is an independent integration capability in hardware and software. The manageability is complex to simple, depending on the policy and multi-page security requirement requirements. In complex network structures, IPsec and IKE are very flexible.

at The presentation of the existing security mechanisms is shown that in particular the end-to-end connectivity in Internet protocols come too short. Furthermore, IPsec and IKE are key procedures here applied with 3DES or IDEA or with AH. To IPsec lets generally say that IPsec essentially transmits the data protects two mechanisms: The Authentication Header (AH) and Encapsulating Security Payload (ESP). The cryptographic methods of use are not fixed. Only minimum requirements are defined here (DES / CBC for ESP, HMAC / SHA for AH). Overarching security architectures are discussed in other publications specified. It has been shown that at packet level no asymmetric Cryptographic methods can be used. This is for a reason in that there is obviously a poor performance of the algorithms gives. At today's network speeds of more than 100 MB / sec can not handle even the most powerful workstation for each Package an RSA or encryption or decryption are made. Even highly optimized hardware implementations still come today no over the limit of 1 MB / sec. Therefore, as state of the art At the IP level only symmetric cryptographic methods are used brought. The patent-pending SynD process corrects this Bottleneck.

ESP serves the payload data encryption, is currently performed only with symmetric keys and plays during the authentication / authentication of the described and patent pending.

Firewall independence of SynD

Synd already uses the authentication for the first connection via IP and determination possibility the authenticity port independently. If the ICMP request is blocked by a firewall, none occurs Authentication. The possibility the discrimination of the pattern within the ping can be with little effort already on the firewal plane possibly with database in the corporate LAN.

independence SynD of the used transmission protocol

Synd is in principle independent the type of transmission protocol used, although described in this document the application using IP / ICMP is.

Also in the area of synchronous data transmission or the use of cell-oriented methods (ISDN, ATM) can be Apply SynD. Especially the platform independence and easy portability is a key advantage of this authentication / authentication process. SynD offers the possibility of combination with all other common ones key resources (RSA, DH ...).

Out of the unique features deriving task for Synd

Task:

The Registered invention provides a technical solution to a problem Cryptography system and a data encryption method, which in are able, already mentioned shortcomings Turn off the state of the art and thus the safety of data transfer massively increase.

Short summary for SynD:

In a microcomputer-based technical implementation innovative methods for secure communication authentication provided. The use of this encryption, the high-level encryption From communication terminals takes place starting from a trust center via a dedicated and distributable to any user hierarchical or non-hierarchical ordered encryption point to realize. Contrary to the previously known methods for over-encryption / encryption offers this solution a very high performance gain and the possibility for miniaturization the hardware and thus a high burglar resistance.

Borders and dependencies from SynD in relation to the state of the art

Requirements for the SynD system and delimitation:

The The patent presented here describes the field of authentication with its interfaces and extremely secure block data transmission.

A Combination between asymmetric key method and symmetric key processes is introduced. The asymmetric key method are used to cryptographically secure the data transport and over to realize your own trust hierarchy verification processes.

The Providing the keys, the transmission paths and the form of the overkey are given in algorithms that asymmetrically the individual Reach partners.

Principle based on a transfer from source to sink on the Internet, here: use of a specific protocol type

Description of the principle of operation from SynD:

Synd is the acronym for System of non-decipherable authentication and based on one new form of prime number decomposition. It uses the ICMP protocol. ICMP (Internet Control Message Protocol) is used to error messages, Transfer control information or status messages. ICMP is not an independent transport protocol, but uses the data field of IP for transmission. In this way Is it possible, that the IP software on different systems and end systems Information and messages transmitted. Also higher Protocols and applications can over it error conditions be informed. The fact that transmits data and information will be seen at the relevant RFC 792, which describes the echo request. Regardless, in the RFC ICMP (last update of 25.07.2006) a plurality of information fields identified as so-called Typfelder. In the type area 19 is a Reservation for Security requests given. In fields 20 to 29 is the possibility the reservation for so-called robustness experiments. Both types of fields 19 and 20 to 29 play a significant role in SynD. So be on this With an ICMP request to one or more stations Authorization key sent, then over the echo request is sent back becomes. This can be either a system that is in a point-to-point relationship with the Source is. It can also be a whole network or several Operate stations at the same time. Here the mechanisms are used, which provide ICMP and IP, e.g. is it possible to do a general ping to send to a broadcast address, whereupon all stations, the lie within this network, respond with their echo request, unless it has not been activated accordingly. As a carrier of the authentication method described, therefore, offers the ICMP protocol at. By using the ICMP protocol are additional Authentication protocols such as RADIUS protocol superfluous. The ICMP protocol operates Both users (user requests) and client-server relationships are more conventional Kind, as well as client server inquiries, in which machine addresses retrieved who the. In particular, by the possibility of Mobile IP and the extension of the address spaces in the field of IPv6, this protocol is useful. The connection the ICMP request with security features already on the connection-oriented Level before any streams of data have been used can, prevents a bad time-response behavior. The sent Information within field 19 or fields 20 to 29 are processed automatically by the machines and the authentication and the authentication takes place in a similar speed as with a standard ping.

to Hedge of all procedures are appropriate cryptographic Hash key functions which determine a printout in terms of a checksum required.

Released under RC4 and marketed by RSA Data Security Inc, this methodology, which plays an important role in Lotus Notes, Oracle or SQL features, utilizes a so-called typical stream cipher and is thus independent of plain text information. The individual key stream bytes are generated with a secret key. Again, the introduction of the Cwienk algorithm is quite possible and useful. The size of the given key space with 2 ^{1700 also} decomposes 256 ² × 256 !, can be easily overroubled in Cwienk's processing of the corresponding algorithms.

The Volume of the keys can be ordered according to various procedures and expanded as desired. An encryption system (VS) as part of SynD can have different properties use the prime number and the non-prime numbers, reducing the encryption space unlimited expandable.

to Definition of the consequences of prime numbers and not prime numbers that into the non-decipherable decompositions go into, is on known and previously unknown laws resorted referred to in the monographs sent under NDA.

The key structure and the key amount will be first determined by dl-DATEN GmbH. Subsets of this key can be the Company available who acquire this patent as a license to use it.

The Distribution of the hardware-implemented subsets of these keys the licensee.

Industrial Applicability:

• Secure authentication of any terminals (Users) with a central office or a hierarchy of control centers
• Ensure reviews of Data transmission integrity
• Mapping additional security measures in connection-based authentication through the use of additive Data flow interval encryptions
• For banks, savings banks, telecommunications of any kind, large and medium industry, pharmaceutical industry, insurance, health care, Health insurance, official security (Ministries, constitution protection, police, justice, Bundeswehr etc.)

In increasing development Miniaturization in the context of mobile telephony is of particular importance. The enormous freedom of communication possibilities is there today Limits where security in communication when establishing a connection and transfer initiation is not sufficient. Ensuring link integrity forms thus the basis for the minimization of the mentioned residual risks and allows a miniaturization the hardware to be implemented.

With Use of mobile IP and IPnG / IPv6 become ideal application scenarios and opportunities for SynD created. The shares of IPSec can thereby to a considerable extent be extended.

Further information:

The owned by dl-DATEN GmbH, not published Monographs by Dr. med. Georg Viktor Cwienk, 2006, based on it implemented encryption methods in big Quantity can be generated, according to various classification key method are structured.

These Monographs (attached) form the declarative basis of this patent and prove the following mentioned Laws.

Furthermore It is noted that the degree of encryption security through an implementation of multiple security keys Base of well-defined prime / non-prime numbers and well-defined even numbers can be substantially increased (see attached figures).

The pending patent shows, in the demarcation, that certain procedures which have been used in the past and partly as separate patents guided have, by the new patent specification to a far more complex, not more decipherable System leads.

In particular, below-stated working premises, which in the past have led to probabilistic procedures, have been substantially expanded by newly found regularities. The thesis that there is no pattern in the prime numbers has been greatly extended by the extension of the equation for the proof of the main theorem of prime theory and by the addition of Goldbach's theory. Prime numbers occurring as factors in the added or subtracted odd and even numbers, respectively, must not occur in the given even or odd numbers. This premise leads to systems of equations containing prime numbers or numbers in the prime factors with larger prime numbers than the prime numbers appearing in the numbers n _g and n _n , respectively.

In The annex contains the monographs of Dr. Ing. Cwienk "New Aspects the primal theory ", the u. a. in Part 1 and Part 2 to an extension of the equation of Theorem of the primal theory. It will be special on pages 115 ff., heading "20 Summary and Outlook " as well as on the summary of the equation of the main clause page 122 (see also lines 495/496).

The Findings from these mathematical proofs, the more immanent Component of the patent and the patent filed here are, lead to a much higher level Hedge opportunity than the methods used under RSA.

Supplementary declarative patent part

• 1) Authentisierung Definierte Tsunamiwellen (ZW)
• 2) Abgeleitete gekoppelte Zahlen zu den ZW = GZW Diese eröffnen die Textblockverschlüsselung und beenden diese.
• 3) Text-Verschlüsselung mit definierten Primzahlwellen (PW): jedem Buchstaben, jeder Ziffer, jedem Satzzeichen werden im Textblock unwiederholbare Primzahlen (PZ) zugeordnet.

Explanation to 4 :

• 1) Authentication Defined tsunami waves (ZW)
• 2) Derived coupled numbers to the ZW = GZW These open the text block encryption and terminate it.
• 3) Text encryption with defined prime number waves (PW): each letter, every digit, every punctuation mark in the text block are assigned unrepeatable primes (PZ).

The overlap avoidance (Exclusion)

A identity the block waves (numbers) with the GZW is thereby excluded, that the polling interval is higher is set, resulting in large GZW values result.

The attached to the patent application mathematical foundations of the "additive and subtractive "data encryption with Goldbach decompositions, quasi-Goldbach decompositions and anti-Goldbach decompositions and quasi-anti-Goldbach decompositions and their defined (selectable) Combinations are based on the following unpublished Monographs and the new insights described in them of legalities in the prime theory, which form the basis of the SynD procedure:

• 1. The unpublished monograph too the topic: "New Aspects of the Prime Theory - Part I "/ April 2006 Author: Dr. Georg Cwienk [MNda- Cwienk2006]
• 2. The unpublished Monograph on the subject: "New Aspects of Prime Theory - Part II" / August 2006 Author: Dr. Georg Cwienk [MNda- Cwienk2006]

On Request can be provided a corresponding example.

Supplementary Explanations to the patent SynD here: Supplementary declarative basic material

For the generation the prime-number waves and the prime-tsunami waves are of prime importance Meaning the laws in the monograph "New Aspects of the primal theory "Part I, block scheme I, block scheme II and block scheme III. These laws are listed on the cover page of the cited monograph. In This monograph was also submitted to prove that the Quasi-Goldbach partitions and the quasi-anti-Goldbach decompositions at equal intervals in an equal thickness (Number) occur.

The legality in Block I is an extension of the Euclidean law, that a natural one Number, which is factorially composed of primes, by addition The number 1 can lead to a new prime or to new primes. This Euclidean law, that builds on the evidence that there are infinitely many primes has been extended in block I by adding both odd numbers: +1, +3, +5 etc. or the odd-numbered subtraction Numbers: -1, -3, -5, etc. lead to new primes can, as well as the addition of even numbers: +2, +4, +6 and the subtraction of even numbers: -2, -4, -6, etc., yields new primes can.

In Block II are the progressions extended to two main groups: Upper group I, upper group II.

In the upper group I four classes of prime numbers appear with the final numbers 1, 3, 7, 9, at division give the remainder 1 by the number 4.

In the upper group II again four classes of primes are given, which, when divided by the number 4, gives the remainder 3.

in the Block III are the education laws for the consequences of the twins Mod 2n n = 1 indicated.

Textblock 2

The laws presented in Block I cause prime-number waves (by Goldbach's or Anti-Goldbach's decompositions) to be generated, and at fairly large, predetermined intervals. However, these laws of Block I also lead to the generation of prime tsunami waves, also at predetermined intervals, and these laws allow one to determine the numbers coupled to these prime tsunami waves that are placed before and after the text blocks - open and close them. Sample writing text block 1

Text block 2

Table GZw I

• for i from 6 * 10 ^ 6 to 10 ^ 7 do:
• if
• isprime (7! + 700 + i) and
• isprime (8! + 772 + 1) and
• isprime (12! + 820 + i) and
• isprime (14! + 940 + i) and
• isprime (17! + 1012 + i) and
• isprime (21! + 1180 + i)
• then print (i, 700 + i, 772 + i, 820 + i, 940 + i, 1012 + i, 1180 + i)
• end_if:
• end_for:

Table Pw I

• for i from 0 to 10 ^ 8 do:
• if
• isprime (7 ^ 2 + i) and
• isprime (11 ^ 2 + i) and
• isprime (13 ^ 2 + i) and
• isprime (17 ^ 2 + i) and
• isprime (19 ^ 2 + i)
• then_print ("i", i, 7 ^ 2 + i, 11 ^ 2 + i, 13 ^ 2 + i, 17 ^ 2 + i, 19 ^ 2 + i)
• end_if:
• end_for:

Table GZw II

• for i from 0 to 5 * 10 ^ 7 do:
• if
• isprime (2 ^ 12 + 10 + i) and
• isprime (2 ^ 32 + 12 + i) and
• isprime (2 ^ 52 + 16 + i) and
• isprime (2 ^ 62 + 18 + i) and
• isprime (2 ^ 82 + 28 + i) and
• isprime (2 ^ 212 + 30 + i)
• then print ("i", i, 10 + i, 12 + i, 16 + i, 18 + i, 28 + i, 30 + i)
• end_if:
• end_for:

Table Pw II

• for i from 0 to 10 ^ 7 do:
• if
• isprime (2 ^ 2 + 10 + i) and
• isprime (2 ^ 4 + 10 + i) and
• isprime (2 ^ 6 + 10 + i) and
• isprime (2 ^ 8 + 10 + i) and
• isprime (2 ^ 10 + 10 + i) and
• isprime (2 ^ 12 + 30 + i)
• then_print ("i", i, 2 ^ 2 + 10 + i, 2 ^ 4 + 10 + i, 2 ^ 6 + 10 + i, 2 ^ 8 + 10 + i, 2 ^ 10 + 10 + i, 2 ^ 12 + 30 + i)
• end_if:
• end_for:

Claims (8)

All claims, which stem from the additive decomposition of primes and implementable component of static, dynamic table contents for encryption after Goldbach's and Anti-Goldbach's laws to lead. need protection is the principle of synchronous rolling authentication, which based on the exchange of encrypted core numbers of a dedicated Algorithm and based on additive prime number decompositions based. All claims, arising from the educational laws of the attached monographs of Dr. Ing. Cwienk result. The way of process and implementation forms the prototypically described exchange of information that Dedicated to one or more sinks from one or more sources additive decomposition forms of prime numbers or not prime numbers he follows. Particularly protective is the possibility the hardware-related implementation forms of the described method forms of additive prime number decompositions for the formation of keys in Data exchange between any authorized and each other authenticating sources and sinks. Is worth protecting any possibility a key process setup, the data storage related implementation of additively calculated Algorithms for authentication, authentication and data stream ciphering to lead can and on the mentioned is based on additive decompositions of primes and not prime numbers. As worthy of protection The use of the ICMP protocol is seen to secure crypto-remedies to exchange in different forms of authentication. protection Worthy is the system inherent block cipher and the mapping to differently formed, mutually complementary Types of decomposition of the additive formation laws as in the monographs of Dr. Cwienk described.