In order to have a completely secure cryptographic system, it has been looked for a system unconditionally secure as the One Time Pad, but without its key distribution problem. It is herein disclosed a cryptographic system, which implements a cryptographic process based on a random sequence generating process (1), generating a random key as long as the data to process, for a ciphering process (2) or a deciphering process (3). The random sequences generated by the random sequence generating process (1), being perfectly random, are perfectly reproducible for those who have the correct random-transfer maps (4) and seeds (5). Therefore, we have a very strong cryptographic system without the problem of the key distribution. It even allows to implement an unconditionally secure communication channel over a network. Such cryptographic system can be implemented on very different hardwares, even with limited computing power like smart cards.

The invention relates to the field of computer engineering and cryptography and, in particular, to methods for implementing linear transformations which operate with a specified speed and require minimum amount of memory, for further usage in devices for cryptographic protection of data.

The technical result relates to enabling to select inter-related parameters (performance and required amount of memory) for a particular computing system when implementing a high-dimensional linear transformation.

The use of the present method allows to reduce the amount of consumed memory at a given word size of processors employed.

To this end, based on a specified linear transformation, a modified linear shift register of Galois-type or Fibonacci-type is generated according to the rules provided in the disclosed method, and the usage thereof enables to obtain the indicated technical result.

Implementations and techniques for asymmetrical chaotic encryption are generally disclosed. One disclosed method for asymmetrical encryption includes determining a ciphertext control block from data, where the ciphertext control block is based at least in part on one or more Chebyshev polynomials. The method also includes encrypting at least a portion of the data into an encrypted ciphertext block, where the encrypted ciphertext block is based at least in part on Logistic Mapping, and in which a final ciphertext includes the encrypted ciphertext block and the ciphertext control block.

In a method for performing symmetric stream encryption of data using a keystream and for transmitting the encrypted data, wherein the keystream is generated using at least one feedback shift register, which is initialized by filling with a defined bit sequence, the data to be encrypted is distributed into data packets, wherein each data packet is encrypted separately. The one or more feedback shift register(s) is/are re-initialized in order to encrypt each data packet, wherein at least a first bit sequence and a second bit sequence are used in each case to initialize the one or more feedback shift registers, wherein the first bit sequence is added to each encrypted data packet in clear text or in coded form and the second bit sequence represents a secret key that is not added to the encrypted data packets. The encrypted data packets are transmitted in packet switching mode together with the respectively added bit sequence and optionally header data.

System and methods for encrypting data, such as plaintext or binary data, on electronic devices are described. An electronic device can encrypt the data by receiving a string of one or more characters associated with the data to be encrypted, determining an entropy for an encrypted string, determining a position for each character of the one or more characters, generating an encrypted string for each character using the determined entropy and position of the respective character, and generating an encrypted message by concatenating the encrypted strings of the one or more characters together. In some examples, the electronic device encrypts the data using one or more pseudo-random number generators. In some examples, the electronic device can offset the one or more characters before the encrypting and/or offset characters in the encrypted strings after the encrypting. The electronic device can then send the encrypted message to another electronic device for decrypting.

A streaming one time Pad cipher using a One Time Pad (OTP) provides secure data storage and retrieval. The data that is encrypted using the one time pad is stored in a repository that is separate from the generation and/or storage for the one time pad.

A method for serialization of items, comprising encrypting a serial number of each item using an encryption key k to obtain unique serial numbers and marking the unique serial numbers on the items. The unique serial numbers having a length L are included into a string of symbols having a length L′, with L′ larger than L, and marked on the items. A corresponding method for recovering a unique code and corresponding serial number from a string of symbols marked on an item, as well as corresponding serialization and recovering systems are disclosed.

Systems and methods are provided for obtaining data to be secured based on a secret sharing technique, the data being associated with a file identifier and a split specification that includes at least a number of splits n and a minimum number of splits m required for reconstructing the data, and a Repeatable Random Sequence Generator (RRSG) RRSG scheme. An RRSG state can be initialized based at least in part on a given data transformation key to provide repeatable sequence of random bytes. For every m bytes of data: a polynomial whose coefficients are determined based at least in part on m bytes of the data and a portion of the repeatable sequence of random bytes can be determined; the polynomial can be evaluated at n unique values determined by a portion of repeatable sequence of random bytes to generate n bytes. Each byte can be stored into one of the n split stores.

A streaming one time Pad cipher using a One Time Pad (OTP) provides secure data storage and retrieval. The data that is encrypted using the one time pad is stored in a repository that is separate from the generation and/or storage for the one time pad.

Shannon's equivocation, the conditional entropy of key or message with respect to a specific ciphertext, is the primary indicator of the security of any secrecy system, in that when key equivocation H E (K) or message equivocation H E (M) attain log 0 (or 1) under a brute-force attack, the system is compromised and has no security. We propose a simplistic equivocation definition of security which distinguishes between “secure/unsolvable” and “insecure/solvable” encipherments. Whilst equivocation may be used practically in a passive manner to cryptanalyse finite-length key “insecure/solvable” secrecy systems to determine the length of ciphertext required to compromise the secrecy system, the invention in this patent offers a cryptographic design framework which allows for the equivocation of finite-length key systems to be actively engineered using equivocation augmentation, such that the residual key and message equivocation of any cryptosystem may be continuously augmented at a faster rate than it is lost, effectively ensuring that equivocation can never attain log 0. In short, it allows for the encryption of any length of message with any finite length key into a ciphertext with “secure/unsolvable” security characteristics. Alternatively, it allows for the cryptographic engineering of information theoretic security in all finite length key systems. The invention is primarily aimed at solving two major problems: (a) a viable practical security solution against future quantum computing/artificial intelligence threats (the QC/AI problem), and (b) a viable practical security solution to the privacy/national interest dichotomy problem, in that it allows for the engineering of security systems which are capable of simultaneously supporting both the absolute privacy of individual users and the security interests of the user group at large. Various methods, apparatuses, and systems are described which allow for the implementation of a “secure/unsolvable” secrecy system which is fast, extensible, simple to implement in hardware and software, and able to be incorporated by or with any existing security solution or cryptographic primitives.