Abstract:
Various aspects are directed to random number generation. A request from a game terminal for a random number may be received. Whether a new seed is required may be determined, for example, based on the time or quantity of random numbers generated since the last re-seeding. Conditioned on determining that the new seed is required, a pseudo-random number generator may re-seeded, wherein the re-seeding comprises setting a current seed value equal to the new seed. The pseudo-random number generator may generate a random number based at least in part on the current seed value; and transmit information based on the random number to the game terminal.
Abstract:
A cryptographic system (1000) is provided. The cryptographic system includes a data stream receiving means (DSRM), a number generator (NG), a mixed radix accumulator (MRA) and an encryptor. The DSRM (1002) receives a data stream (DS). The NG (702) generates a first number sequence (FNS) contained within a Galois Field GF[M]. The MRA (750) is configured to perform a first modification to a first number (FN) in FNS. The first modification involves summing the FN with a result of a modulo P operation performed on a second number in FNS that proceeds FN. The MRA is also configured to perform a second modification to FN utilizing a modulo P operation. The MRA is further configured to repeat the first and second modification for numbers in FNS to generate a second number sequence (SNS). The encryptor (1004) is configured to generate a modified data stream by combining SNS and DS.
Abstract:
A data hashing system operative to hash an incoming string of message words, thereby to generate a hash value tag comprising a deterministic random number string which uniquely identifies the incoming string, the system comprising at least first and second register arrays, at least one 1-way at least pseudo-randomizing functionality; and a set of at least first and second orthogonal feedback word stream generators operative to generate a set of at least first and second orthogonal feedback streams of message words respectively, including applying respective permutations to the incoming string, wherein the first and second feedback streams are combined into the first and second register arrays respectively, the at least pseudo-randomizing functionality accepts input from the register arrays and generates at least pseudo-random output which, in combination with a present word in the incoming string, is provided to the stream generators, and the first feedback stream is a first function of a present word in the incoming stream and the second feedback stream is a second function of a present and previous words, in the incoming stream.
Abstract:
A system, method, and computer program for for text-based encryption, comprising accessing a text file with a plurality of lines of text characters; re- sequencing each of said text characters; translating a decimal representation for each of said text character by an offset of a decimal value so that a resulting translated character is printable; inserting a plurality of characters between each of said translated text characters on each of said line to form a random character string; inserting a plurality of random numbers of random characters before and after said random character string to output to a resultant file; and including a translated seed with said resultant file and appropriate means and computer- readable instructions.
Abstract:
The present invention relates to a method for transmission of a digital signal from a first unit (2), operating according to a transmission mode, to a second unit (3), operating according to a reception mode, through a transmission channel (4), said first unit carrying out the following steps: (a) division of said digital signal in data blocks, each data block comprising n elementary units each having a set time duration; and (b) permutation of elementary unit order of each block on the basis of a permutation instruction, said permutation instruction being selected from a permutation instruction table calculated beforehand, by generation of an address by a pseudo-random address generator (11) by a synchronism seed (12); and said second unit (3) carrying out the following step: (c) permutation of order of said elementary units of each data block received on the basis of a permutation instruction corresponding to the permutation instruction applied to each one of said data blocks during said step (b) from said first unit (2), said permutation instruction being selected from a permutation instruction table calculated beforehand corresponding to the table contained in said first unit (2), following the generation of an address by a pseudo-random address generator (11) by the synchrony seed (12) corresponding to the synchrony seed (12) used by said pseudo-random address generator (11). The present invention also relates for a system (1) for carrying out said method.
Abstract:
A system for securing information is disclosed. The system includes a key, a sub-key generator, and an encryptor/decryptor. The sub-key generator includes a first security module. The encryptor/decryptor includes a second security module. At least a portion of the key is an input to the sub-key generator, and a sub-key is an output. At least a portion of the sub-key is an input to the encryptor/decryptor, and a cipher text or a plain text, depending on the operational, is an output. In an aspect, the first security module and the second security module are substantially the same.
Abstract:
L'invention se rapporte au domaine général de la sécurité numérique et plus particulièrement de la cryptographie. Elle propose notamment un dispositif et un procédé de chiffrement d une séquence de données. L invention concerne également un dispositif (1) et un procédé cryptographiques de génération d une séquence de données pseudo- aléatoire (13) et ainsi que leur utilisation privilégiée dans le domaine de la sécurité numérique, à savoir notamment pour le chiffrement et le déchiffrement de données et pour le hachage cryptographique de messages.
Abstract:
Procédé pour générer des chaînes de bits pseudo-aléatoires dans un système dans lequel les échanges de données entre un premier utilisateur et un deuxième utilisateur sont protégés caractérisé en ce qu'il comporte au moins les étapes suivantes : utiliser une application f K de taille de sortie n bits, déterminer une valeur x et à partir de cette valeur x et en appliquant l'application f K , générer t valeurs v i , à partir des t valeurs v i et de u*t coefficients déterminer u blocs S i contenant des caractères pseudo-aléatoires. Application au domaine du codage ou de l'authentification
Abstract:
A system, method, and computer program for for text-based encryption, comprising accessing a text file with a plurality of lines of text characters; re- sequencing each of said text characters; translating a decimal representation for each of said text character by an offset of a decimal value so that a resulting translated character is printable; inserting a plurality of characters between each of said translated text characters on each of said line to form a random character string; inserting a plurality of random numbers of random characters before and after said random character string to output to a resultant file; and including a translated seed with said resultant file and appropriate means and computer- readable instructions.
Abstract:
中国人剰余定理(CRT)を用いたRSA復号処理を行う暗号処理装置であって、前記RSA復号処理は、暗号文を c 、法を n 、秘密鍵を d とおくと、 c d (mod n) で表され、また、法 n は二つの素数 p 、 q を用いて n = p×q と表されるものであって、乱数 r を用意する乱数生成手段と、前記p 、 q を法とする指数剰余演算を実行した後に平文を計算するステップにおいて前記乱数 r に応じて u = p -1 (mod q) を用いた計算方式かもしくは v = q -1 (mod p) を用いた計算方式かのいずれかを選択する復号化経路選択手段と、を含む暗号処理装置。