# Nonlinear (e.g., pseudorandom)

## Subclass of:

## 380 - Cryptography

## 380277000 - KEY MANAGEMENT

## 380044000 - Having particular key generator

### Patent class list (only not empty are listed)

#### Deeper subclasses:

Entries | ||

Document | Title | Date |
---|---|---|

20140341375 | RANDOM NUMBER GENERATING DEVICE, CIPHER PROCESSING DEVICE, STORAGE DEVICE, AND INFORMATION PROCESSING SYSTEM - A random number generating device includes an uncertain circuit which outputs uncertain data, and a cipher processing device. The cipher processing device encrypts input data using a cipher function of the cipher processing device, and generates a random number including higher uniformity than data outputted from said uncertain circuit using the cipher function of the cipher processing device and the data outputted from the uncertain circuit. | 11-20-2014 |

20090262929 | METHOD FOR SECURE STORAGE OF PLURAL KEYS IN DEVICE - A method for securely storing a plurality of keys in a device. The method comprises assigning the device with a random number, the random number being substantially unique to the device; generating an encryption key for encrypting each of the plurality of keys, the encryption key being generated by applying a one way function to the random number; encrypting one of the plurality of keys using the generated encryption key; securing the encrypted key by applying an XOR function to the encrypted key using the generated encryption key; storing the secured encrypted key in the device; and repeating the generating, encrypting, and securing steps for each of the remaining plurality of keys. | 10-22-2009 |

20100329455 | Cryptographic key generation using a stored input value and a stored count value - Embodiments of an invention for cryptographic key generation using a stored input value and a stored count value have been described. In one embodiment, a processor includes non-volatile storage storing an input value and a count value, and logic to generate a cryptographic key based on the stored input value and the stored count value. | 12-30-2010 |

20160087796 | STRING PROCESSOR - According to one embodiment is a string processor configured to output a biased output string having a first output value and a second output value. The string processor is given an unbiased input string of at least two input values. The string processor has a processing unit and a memory device, the memory device stores a code-word set. The code-word set has a plurality of code-words, each code-word having at least one input value, and each output value has at least one corresponding code-word. The processing unit is configured to: compare a comparison string to the code-word set, wherein the comparison string includes an input from the input string; and assign an output value to the output string when the comparison string matches a code-word. The assigned output value is that to which the matched code-word corresponds. An output probability of an output value is defined by the number and length of the code-words corresponding to that output value; and the output probability of the first output value is larger than the output probability of the second output value. | 03-24-2016 |

20140270162 | INSTRUCTION FOR PERFORMING A PSEUDORANDOM NUMBER GENERATE OPERATION - A machine instruction is provided that includes an opcode field to provide an opcode, the opcode to identify a perform pseudorandom number operation, and a register field to be used to identify a register, the register to specify a location in memory of a first operand to be used. The machine instruction is executed, and execution includes for each block of memory of one or more blocks of memory of the first operand, generating a hash value using a 512 bit secure hash technique and at least one seed value of a parameter block of the machine instruction; and storing at least a portion of the generated hash value in a corresponding block of memory of the first operand, the generated hash value being at least a portion of a pseudorandom number. | 09-18-2014 |

20160028543 | SYSTEM AND METHOD FOR GENERATING RANDOM KEY STREAM CIPHER TEXTS - A method for performing a cryptographic function on text to generate converted text comprises producing a random key stream having a first block size in a first frequency domain; converting the random key stream having a first block size in the first frequency domain to a random key stream in a second frequency domain; converting the random key stream having the first block size in the second frequency domain into smaller block sizes, thereby producing smaller block-sized random key stream of the second frequency domain; and converting the text using the smaller block-sized random key stream of the second frequency domain to produce the converted text. The frequency in the first frequency domain is preferably lower than the frequency in the second frequency domain. | 01-28-2016 |

20100329456 | SEMICONDUCTOR DEVICE INCLUDING ENCRYPTION SECTION, SEMICONDUCTOR DEVICE INCLUDING EXTERNAL INTERFACE, AND CONTENT REPRODUCTION METHOD - A secure LSI device | 12-30-2010 |

20110013771 | ASSERTION MESSAGE SIGNATURES - The invention relates to a method for providing an assertion message ( | 01-20-2011 |

20110075840 | METHOD AND SYSTEM FOR GENERATING RANDOM NUMBERS IN A STORAGE DEVICE - Random numbers are generated in a storage device based on the parity bits of successive position error signal (PES) samples. The parity bits of multiple PES samples are concatenated to form a random number having a desired number of bits. The random number may be further randomized by being processed with a deterministic random bit generator (DRBG) included in the firmware of the storage device. | 03-31-2011 |

20100128870 | PSEUDO-RANDOM NUMBER GENERATION DEVICE, PROGRAM, AND METHOD FOR STREAM ENCODING - A pseudorandom number generation apparatus used for a stream cipher comprises at least one internal state, a non-linear conversion means that updates numeric data saved in the internal state, and a transposition means that performs only bit transposition for the numeric data, updated by the non-linear conversion means, based on a predefined rule. | 05-27-2010 |

20120294441 | SECURE DATA TRANSFER ON A HANDHELD COMMUNICATIONS DEVICE - A handheld communications device and method for transmitting an encryption key are provided. The method comprises: generating an encryption key via the data processor, the encryption key comprising a bit sequence; and varying an output of the display device over a period of time to transmit the encryption key from the handheld communications device by varying at least one of a sequence at least one of colour rendered on the display device or a sequence of brightness levels output by the display device. | 11-22-2012 |

20110002462 | SECURITY SYSTEM AND METHOD - A device for generating a seedless pseudo-random number, according to one embodiment, includes a first register containing a secret code; a second register containing a first random number generated locally and a second random number generated at a remote device; and an exclusive OR (XOR) circuit receiving output from the first and second registers and applying an XOR function to the outputs, a result of the XOR function being fed into the second register in a subsequent cycle. | 01-06-2011 |

20150110269 | ENCRYPTION DEVICE, DECRYPTION DEVICE, ENCRYPTION METHOD, DECRYPTION METHOD, AND PROGRAM - An encryption device generates non-commutative matrices A1, A2 based on private data A and prime numbers p1, p2, and operates the non-commutative matrices A1, A2 on vectors v | 04-23-2015 |

20090304181 | Method for generating and/or imprinting a retrievable cryptographic key during the production of a topographic structure - The present invention relates to a method for generating and imprinting a retrievable cryptographic key during the fabrication of a topographic structure, in particular for microelectronic or micromechanical components. | 12-10-2009 |

20090262928 | Method and Apparatus For Seeding a Cryptographic Random Number Generator - The invention relates to a method and an apparatus for seeding cryptographic random number generators. For seeding a cryptographic random number generator, an image is used. Pixels of the inputted image are selected, each of which is provided with associated position and color information. That position and color information associated with the selected pixels is used to compute a predetermined number of bits which are then used for seeding the random number generator. The user can input the image by a camera, a scanner or a repository. | 10-22-2009 |

20140355757 | ENCRYPTION / DECRYPTION OF DATA WITH NON-PERSISTENT, NON-SHARED PASSKEY - The method herein teaches encrypting a Private Key using a Passkey from an RSA generated private key/public key pair; the encrypted Private Key is split and then the portions are stored in two different databases. To encrypt data a new AES key is created that encrypts the data that is stored in another database. All users have their AES key encrypted using their associated public encryption keys such that the encrypted AES keys are stored in another database. To decrypt data the user enters his PassKey that is used to decrypt a rejoined split private key from portions that were retrieved from their respective databases. Next the encrypted AES key is retrieved and decrypted using the decrypted Private Key. Finally the AES encrypted data is retrieved from a database and decrypted using the decrypted AES key. | 12-04-2014 |

20100278336 | METHOD AND APPARATUS FOR ESTABLISHING A SECURE MULTICAST COMMUNICATION SESSION - A system for establishing an encrypted multicast communication session over a communications network can include a client means (e.g., a radio, laptop, workstation, phone, PDA) and a server means. The client means can transmit a request for a first user to join a pre-defined collaborative group, including at least the first user and a second user. The client means can transmit a request for a first user to create or select a collaborative group based on specified criteria. The system can also include a server means that can retrieve, select or generate an encryption key for the collaborative group and transmit the encryption key to the first user via the client means. The server can transmit the encryption key to the second user via a second client means. The client means can communicate via multicast, encrypting end-to-end above the network layer using the encryption key received from the server means. | 11-04-2010 |

20100272256 | Method and Implementation for Information Exchange Using Markov Models - The replacement of secret keys is a central problem in key management. Typical solutions exchange handshaking messages, involve complex computations, or require the cooperation of trusted third parties. Disclosed herein is a key replacement method that exploits the randomness of Markov models to efficiently provide fresh keys to users. Unlike other methods, the proposed method removes the need for extra communications, intensive computation, or third parties. It is demonstrated that the proposed method has perfect forward secrecy as well as resistance to known-key attacks. | 10-28-2010 |

20100054465 | INFORMATION PROCESSING UNIT, TERMINAL UNIT, INFORMATION PROCESSING METHOD, KEY GENERATION METHOD AND PROGRAM - It relates to an information processing unit, a terminal unit, an information processing method, a key generation method and a program that enable reduction of the number of keys to be held by users and aims at providing an information processing unit capable of generating a directed-graph representing an encryption key generation logic to derive a set-key for encrypting a content or a content-key. The technique relates to a scheme that divides a set of user terminals into some subsets, allocates a set-key and an intermediate-key to each subset, and upon input of an intermediate-key correlated with a subset, outputs the set-key corresponding to the subset and the intermediate-key of the subset associated by the directed-edge. Further, it relates to a technique of replacing the directed-edge in the directed-graph with a shorter directed-edge. The effect of reducing the number of intermediate-keys held by each user is expected from the technique. | 03-04-2010 |

20100027788 | Asymmetric Cryptographic Device With Local Private Key Generation and Method Therefor - An asymmetric cryptographic integrated circuit | 02-04-2010 |

20120033810 | AUTHENTICATION OF INTEGRATED CIRCUITS - A group of devices are fabricated based on a common design, each device having a corresponding plurality of measurable characteristics that is unique in the group to that device, each device having a measurement module for measuring the measurable characteristics. Authentication of one of the group of devices is enabled by selective measurement of one or more of the plurality of measurable characteristics of the device. | 02-09-2012 |

20120033809 | SYSTEM FOR SCRAMBLING AND METHODS FOR USE THEREWITH - A system includes a key path generator that generates a key path based on a plurality of encryption keys. A block coding unit generates a plurality of codewords based on a plurality of data blocks. A block scrambling unit scrambles the plurality of codewords to generate a plurality of encrypted blocks by entropy processing, chaos processing and permutation processing each of the plurality of codewords, based on the plurality of encryption keys. | 02-09-2012 |

20110211691 | COMMON KEY BLOCK ENCRYPTION DEVICE, COMMON KEY BLOCK ENCRYPTION METHOD, AND PROGRAM - A common key block encryption device includes a first hash unit applying locked key permutation to a variable-length s-bit plaintext, and outputting a fixed-length n-bit first block and a second (s-n)-bit block; a first encryption processing unit outputting a third block encrypted by element of n-bit block tweakable block cipher using tweak, inputting the first block; a second encryption processing unit generating a random number (s-n)-bit block with a result of group computation of the third block and the first block as input by using an arbitrary cipher having theoretical security at least against a known-plaintext attack; and a second hash unit applying the locked key permutation to the result of the group computation of the random number block and the second block, and to the third block to output a fifth n-bit block and a sixth (s-n)-bit block. The fifth and sixth blocks are concatenated into an s-bit encryption. | 09-01-2011 |

20160117245 | APPARATUS, A SYSTEM, A METHOD AND A COMPUTER PROGRAM FOR ERASING DATA STORED ON A STORAGE DEVICE - An approach for erasing data being stored in a data storage apparatus is provided, which may be provided e.g. as an apparatus, as a method, as a system or as a computer program. A sequence of uncompressible data is obtained fulfilling predetermined criteria, which includes a statistical measure indicative of compressibility or uncompressibility of the sequence of uncompressible data meeting a predetermined criterion, wherein the sequence of uncompressible data is divided into one or more blocks of uncompressible data, the sum of the sizes of the one or more blocks of uncompressible data being larger than or equal to the storage capacity of the data storage apparatus. The one or more blocks of uncompressible data is provided to the data storage apparatus for storage therein to overwrite the data currently stored in the data storage apparatus. | 04-28-2016 |

20110211692 | Secure Computation Using a Server Module - A server module evaluates a circuit based on concealed inputs provided by respective participant modules, to provide a concealed output. By virtue of this approach, no party to the transaction (including the sever module) discovers any other party's non-concealed inputs. In a first implementation, the server module evaluates a garbled Boolean circuit. This implementation also uses a three-way oblivious transfer technique to provide a concealed input from one of the participant modules to the serer module. In a second implementation, the server module evaluates an arithmetic circuit based on ciphertexts that have been produced using a fully homomorphic encryption technique. This implementation modifies multiplication operations that are performed in the evaluation of the arithmetic circuit by a modifier factor; this removes bounds placed on the number of the multiplication operations that can be performed. | 09-01-2011 |

20140192980 | Data Encryption System and Method - An improved method for data encryption has been developed. The method includes storing data, multiple prime numbers and random numbers within an electronic memory storage device. Next, calculating a public number using the multiple prime numbers and providing a public number to a recipient apparatus that has knowledge of the multiple prime numbers. The method then encrypts the stored data with a randomly generated key and deletes the randomly generated key after use. Next, the method calculates a common shared secret between the sender and recipient using the prime numbers, a recipient public number and the second random number. The sender and recipient calculate parameters using a key equation based on the randomly generated key and random numbers and a common shared secret. Finally, the recipient calculates the randomly generated key for decryption using the common shared secret, one of the prime numbers, the parameters and the simultaneous equations for decryption of the data. | 07-10-2014 |

20120069999 | IMAGE FORMING APPARATUS, COMPUTER READABLE MEDIUM AND MEDIUM - The image forming apparatus includes: a random number information generation part that generates random number information; a first encryption part that encrypts the random number information generated by the random number information generation part with using a first encryption key; a second encryption key generation part that newly generates a second encryption key from the random number information generated by the random number information generation part; a second encryption part that encrypts specific information for identifying the apparatus with using the second encryption key generated by the second encryption key generation part; a code data creation part that creates code data based on encrypted random number information encrypted by the first encryption part and encrypted specific information encrypted by the second encryption part; and an image forming part that forms a code image based on the code data created by the code data creation part on a recording medium. | 03-22-2012 |

20130279692 | PROTECTING MODULAR EXPONENTIATION IN CRYPTOGRAPHIC OPERATIONS - The present invention proposes a method for executing a blinded modular exponentiation, based on a window method with a window size of k bits so using 2 | 10-24-2013 |

20120148041 | USER-CONTROLLED RANDOM-ID GENERATION FUNCTION FOR SMARTCARDS - A smartcard having a microcontroller kernel and a non-secure memory capable of storing a Random-ID code, where the non-secure memory is electrically coupled to the microcontroller kernel. A random number generator is for generating a new Random-ID code and the random number generator is electrically coupled to the microcontroller kernel. A user interface is electrically coupled to the random number generator so that the user may initiate generation of the new Random-ID code by the random number generator for storage in the non-secure memory. | 06-14-2012 |

20100172496 | KEY GENERATING APPARATUS, ENCRYPTING APPARATUS AND DECRYPTING APPARATUS - A calculation device for calculating two groups G and G | 07-08-2010 |

20140192979 | Method and Apparatus for Generating Large Numbers of Encryption Keys - Entropy obtained from a series of key generation exchanges may be combined with entropy from a strong entropy source to allow the strong entropy to be stretched to generate a larger number of keys for use on a communication network, without requiring additional information from the group members and without requiring the entropy source to be increased in size or in number. In one embodiment, nonces exchanged during an initial key exchange are used to generate additional key material that is then fed, together with a fresh random secret, to another pseudo-random function to generate an additional key stream. The methods are particularly useful for group key management where a large number of keys are required to be generated in a short time frame. | 07-10-2014 |

20110216901 | Keystream encryption device, method, and program - A stream encryption device generates a first pseudo random number sequence from key information, generates a second pseudo random number sequence according to clock control performed according to the first pseudo random number sequence, and subjects it to a nonlinear function calculation, thereby generating a key stream. The stream encryption device performs XOR operation with a plain text so as to create an encrypted text. | 09-08-2011 |

20150055778 | METHOD AND APPARATUS FOR A NON-DETERMINISTIC RANDOM BIT GENERATOR (NRBG) - A hardware-based digital random number generator is provided. In one embodiment, a processor includes a digital random number generator (DRNG) to condition entropy data provided by an entropy source, to generate a plurality of deterministic random bit (DRB) strings, and to generate a plurality of nondeterministic random bit (NRB) strings, and an execution unit coupled to the DRNG, in response to a first instruction to read a seed value, to retrieve one of the NRB strings from the DRNG and to store the NRB string in a destination register specified by the first instruction. | 02-26-2015 |

20130308776 | METHOD AND SYSTEM FOR CONDITIONAL ACCESS TO A DIGITAL CONTENT, ASSOCIATED TERMINAL AND SUBSCRIBER DEVICE - A secure method for transmitting a control word between a server and a plurality of processing entities so as to respectively produce and utilize the control word. Preferably such a method is applied to the field of conditional access methods and systems for preventing the fraudulent use of compromised decryption keys resulting from a coalition of pirate hackers. | 11-21-2013 |

20140314231 | System and Methods For Encrypting Data - A system and associated methods for encrypting data are disclosed. In at least one embodiment, a key manager is located in memory on an at least one computing device and configured for creating and managing an at least one encryption key to be used for encrypting the data. An at least one key file is also located in memory on the at least one computing device and is associated with an at least one authorized user. The key file contains a key field comprising a pseudo random string of bytes and a unique hash value used to associate the key file to the user. A set of base characters are randomly selected from the key field, such that the base characters are a subset of the key field. An encryption key is generated by inputting the base characters into an encryption algorithm. The data is encrypted using the encryption key. | 10-23-2014 |

20100008499 | Method and apparatus for generating random data-encryption keys - One embodiment of the present invention provides a system that facilitates generating random data-encryption keys for data files. During operation, the system receives a command at a computer system to create a data file that may include encrypted data. This data file includes a wrapped data-encryption key to facilitate encrypting and decrypting data. In response to the command, the system generates a bit pattern to be used as the wrapped data-encryption key. Finally, the system creates the data file, which includes the bit pattern as the wrapped data-encryption key. | 01-14-2010 |

20090296928 | Pseudorandom number generating system, encryption system, and decryption system - The present invention provides a pseudorandom number generating system, an encryption system, and a decryption system. The pseudorandom number generating system of the present invention repeatedly performs simple transformation of a non-secure pseudorandom number sequence that may be generated quickly, and thus may quickly generate a highly secure pseudorandom number sequence having a long period. In addition, the encryption system and the decryption system of the present invention do not generate a large encryption function difficult to be deciphered based on a shared key | 12-03-2009 |

20100142705 | CRYPTOGRAPHIC METHODS AND DEVICES FOR PSEUDO-RANDOM GENERATION, ENCRYPTING DATA, AND CRYPTOGRAPHICALLY HASHING A MESSAGE - The invention relates to the general field of digital security and more particularly cryptography. In particular it proposes a device and a method of encrypting a sequence of data. The invention also relates to a cryptographic device ( | 06-10-2010 |

20150043732 | STORAGE OF SENSITIVE DATA IN A DISPERSED STORAGE NETWORK - A method begins by a processing module applying a share encoding function on data to produce a plurality of encoded shares and generating a corresponding plurality of random numbers for the plurality of encoded shares. The method continues with the processing module generating an encryption key based on a common password and a corresponding one of the corresponding plurality of random numbers and encrypting the encoded share utilizing the encryption key to produce an encrypted share for each encoded share of the plurality of encoded shares. The method continues with the processing module facilitating storage of the corresponding plurality of random numbers and each of the encrypted shares. | 02-12-2015 |

20110064217 | System And Method For Providing Secure Access To System Memory - There is provided a method of providing secure access to data stored in a system memory of a computer system, the computer system comprising a memory controller for writing data to and reading data from the system memory. The method comprises generating a random encryption key each time the computer system is booted and storing the random encryption key in a volatile memory region of the memory controller. The method additionally comprises encrypting data using the random encryption key to create encrypted data, and storing the encrypted data in the system memory. Also provided are a memory subsystem and a computer system for performing the method. | 03-17-2011 |

20100104097 | SYSTEM AND METHOD FOR UCC CONTENTS PROTECTION - The present invention relates to a user created contents protection system and method. Copyright protection for protecting contents on user created contents is performed by using a contents upload server or a user terminal including a digital rights management (DRM) packager. Therefore, copyright protection of the user created contents is performed, and a user that legally provides user created contents can be rewarded. Also, when illegally distributed user created contents are generated, a person having initially attempted to distribute the contents is tracked to clarify responsibility. | 04-29-2010 |

20130230168 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND COMPUTER READABLE MEDIUM - To anonymize information from a service-providing apparatus and an information processing apparatus (device), this information processing apparatus is provided with: the an information receiver for receiving anonymized (concealed) information that has been anonymized with anonymizing information; the an anonymized random-number generator for generating random numbers or anonymized random numbers obtained by anonymizing the random numbers with anonymizing information; and a random-number-added information generator for generating random-number-added information on the basis of the anonymized information and the random numbers or anonymized random numbers. | 09-05-2013 |

20150049870 | INSTRUCTION FOR PERFORMING A PSEUDORANDOM NUMBER GENERATE OPERATION - A machine instruction is provided that includes an opcode field to provide an opcode, the opcode to identify a perform pseudorandom number operation, and a register field to be used to identify a register, the register to specify a location in memory of a first operand to be used. The machine instruction is executed, and execution includes for each block of memory of one or more blocks of memory of the first operand, generating a hash value using a 512 bit secure hash technique and at least one seed value of a parameter block of the machine instruction; and storing at least a portion of the generated hash value in a corresponding block of memory of the first operand, the generated hash value being at least a portion of a pseudorandom number. | 02-19-2015 |

20100034377 | CHAOTIC ASYMMETRIC ENCRYPTION PROCESS FOR DATA SECURITY - Disclosed is a method and apparatus for a chaotic asymmetric encryption system that is based on a mathematically proven chaotic dynamical system, the ergodic property of chaotic maps, conventional Diffie-Hellman key exchange procedure, a modified Diffie-Hellman key exchange procedure and a public key which is any number that could be chosen from the interval 0,1. | 02-11-2010 |

20130236009 | ENCIPHERING APPARATUS AND METHOD, DECIPHERING APPARATUS AND METHOD AS WELL AS INFORMATION PROCESSING APPARATUS AND METHOD - The invention provides an enciphering apparatus and method, a deciphering apparatus and method and an information processing apparatus and method by which illegal copying can be prevented with certainty. Data enciphered by a 1394 interface of a DVD player is transmitted to a personal computer and a magneto-optical disk apparatus through a 1394 bus. In the magneto-optical disk apparatus with which a change to a function is open to a user, the received data is deciphered by a 1394 interface. In contrast, in the personal computer with which a change to a function is open to a user, the enciphered data is deciphered using a time variable key by a 1394 interface, and a result of the decipherment is further deciphered using a session key by an application section. | 09-12-2013 |

20130058479 | HIERARCHICAL GROUP KEY MANAGEMENT APPROACH BASED ON LINEAR GEOMETRY - A hierarchical group key management approach based on linear geometry is disclosed. The approach includes the following steps: step 1, the central controller selects a finite field F, a mapping parameter f and a constant N for use in the group; the central controller selects a N-dimensional private vector for each subgroup; step 2, the central controller selects a mapping parameter r and maps the private vector to a new set of vectors in the vector space; step 3, the central controller selects a subgroup key for each subgroup and constructs n linear systems of equations, and solves the solution of the linear equation systems, that is, the public vector, and the n sets of public vectors form a public vector; the public vector and the mapping parameter r are broadcasted or multicasted by the central controller to all the subgroup controllers; step 4, each subgroup controller solves the confidential vector of its own, and a set of key vectors is obtained by linear transformation of the confidential vector and the public matrix. This invention is simple and flexible, and is effective against brute-force attacks. | 03-07-2013 |

20140185799 | METHOD FOR GENERATING LARGE PRIME NUMBER IN EMBEDDED SYSTEM - A method for generating a large prime number in an embedded system, comprising: (1) setting all identifiers in an identifier group in a first storage area; generating and storing a random number with preset bit length in a third storage area; modulizing the data in the third storage area by using the data stored in the storage unit of a second storage area as a modulus; determining the serial number of the identifier to be reset in the identifier group according to the modulized value and the data in the storage unit corresponding to the modulized value; and resetting the identifier corresponding to the serial number; (2) judging whether a set identifier exists in the identifier group, if yes, then executing step (3); otherwise, returning to step (1); and (3), determining a number to be detected according to the random number and the serial number of the set identifier in the identifier group; detecting the primality of the number to be detected; if the number to be detected passes the primality detection, then outputting the number to be detected; and if the numbers to be detected corresponding to all the set identifiers in the identifier group fail to pass the primality detection, then returning to step (1). The present method has high efficiency and is suitable for an embedded system. | 07-03-2014 |

20140355758 | METHOD OF GENERATING PRIME NUMBERS PROVEN SUITABLE FOR CHIP CARDS - The invention relates to a method for generating a prime number, implemented in an electronic device, the method including steps of calculating a candidate prime number having a number of bits, using the formula: Pr=2P·R+1, where P is a prime number and R is an integer, applying the Pocklington primality test to the candidate prime number, rejecting the candidate prime number if it fails the Pocklington test, generating the integer from an invertible number belonging to a set of invertible elements modulo the product of numbers belonging to a group of small prime numbers greater than 2, so that the candidate prime number is not divisible by any number of the group, the prime number P having a number of bits equal, to within one bit, to half or a third of the number of bits of the candidate prime number. | 12-04-2014 |

20140219445 | Processors Including Key Management Circuits and Methods of Operating Key Management Circuits - A system on chip includes a central processing unit and a key manager coupled to the central processing unit. The key manager includes a random number generator configured to generate a key and a key memory configured to store the key and a user setting value associated with the key. | 08-07-2014 |

20150110268 | METHOD FOR CODING AND DECODING INFORMATION ASSOCIATED WITH AN ITEM - A method for coding and decoding information ( | 04-23-2015 |

20100135486 | Nonlinear feedback mode for block ciphers - Plain text, a secret key and a primitive polynomial that defines a finite field of even characteristic are received. The plain text is divided into a plurality of plain text blocks. For each plain text block of the plurality of plain text blocks other than a first plain text block, the plain text block is multiplied by a preceding cipher text block over the finite field of even characteristic, modulo the primitive polynomial, to generate an intermediate block, wherein the preceding cipher text block was generated from a preceding plain text block. Each intermediate block is processed by a block cipher using the secret key to generate a subsequent cipher text block. The block cipher operates in a nonlinear feedback mode of operation. | 06-03-2010 |

20140321645 | APPARATUS AND METHOD FOR CONVERTING RANDOM BINARY SEQUENCE INTO RANDOM INTEGER - An apparatus and method for converting a random binary sequence into a random integer is provided. The present invention converts a random binary sequence into a random integer, and determines whether the corresponding random integer falls within a preset integer interval. Further, if it is determined that the random integer generated from the random binary sequence does not fall within the preset integer interval, the present invention repeatedly updates a random binary sequence until a random integer falling within the corresponding integer interval is obtained, thus outputting uniformly distributed random integers which fall within the preset integer interval. | 10-30-2014 |

20140270165 | Cryptographic system based on reproducible random sequences - A cryptographic system implementing a cryptographic process based on a random sequence generating process ( | 09-18-2014 |

20140270164 | CONFIGURABLE KEY-BASED DATA SHUFFLING AND ENCRYPTION - A data shuffling and encryption system may include data storage to store a key and a coding module to shuffle and encrypt an input data sequence. The shuffling and encrypting may include determining an n-dimensional space and populating the n-dimensional space with the input data sequence. A quasi-random function may be applied to sample the n-dimensional space, and samples may be used as an index into the n-dimensional space to determine an output data sequence from the n-dimensional space. | 09-18-2014 |

20140270163 | System And Method For Counter Mode Encrypted Communication With Reduced Bandwidth - In a counter mode encryption scheme, a sending device sends a first message including first cipher text and a first counter used to generate the first cipher text to a receiving device for decryption. The sending device subsequently generates a second counter for generating second cipher text. The sending device sends a second message including the second cipher text and intermediate state data corresponding to a change between the first counter second counter to the receiving device for decryption. The intermediate state data are represented by a smaller number of bits than the first counter. The method enables improved counter mode encrypted communication in networks that lose one or more intermediate messages between the first message and the second message. | 09-18-2014 |

20140205093 | METHOD AND SYSTEM FOR GENERATING A RANDOM NUMBER - For generating a seed, such as for a random number, a plurality of data storage location identifiers, such as sectors, can be combined. A random number can be calculated using the seed. The selection of the data storage location identifiers can be time varied based on commands received from a host. The seed that is generated can have enhanced unpredictability and complexity for secure data cryptography. | 07-24-2014 |

20110123022 | RANDOM NUMBER GENERATING DEVICE, RANDOM NUMBER GENERATING METHOD, AND SECURITY CHIP - A random number generating device includes: a random number generator configured to have a plurality of random number generating elements that generate a random number in response to supply of a spin-injection current; and a temperature controller. | 05-26-2011 |

20140294177 | IDENTITY BASED PUBLIC KEY CRYPTOSYSTEM - A method for generating cryptographic parameters comprises generating a private_IGTABLE based on an Euler totient function of a composite number (φ(n)), where the private_IGTABLE includes a plurality of random numbers (x). Further, a public_IGTABLE based on the private_IGTABLE, a composite number (n), and a group generator element (g) is generated, where the public_IGTABLE includes a corresponding modular exponentiation under modulo n for each of the plurality of random numbers with g as base. Further, a public key of a user is computed based on the public_IGTABLE, an identity number (ID) corresponding to the user, and n. Further, a secret key of the user is generated based on the ID, a master private key, the φ(n), and the private_IGTABLE. Thereafter, the cryptographic parameters are provided to the user for performing encryption and decryption, where the cryptographic parameters include at least one of the ID, the public key, and the secret key. | 10-02-2014 |

20140219444 | Method for Generating a Random Output Bit Sequence - A method and a random bit generator for generating a random output bit sequence. In this method, a configuration of 2 | 08-07-2014 |

20150117643 | SYSTEM AND METHOD FOR PERFORMING A SECURE CRYPTOGRAPHIC OPERATION ON A MOBILE DEVICE COMBINING DATA FROM MULTIPLE SENSORS - In a mobile communication device, multiple sets of sensor measurement data are obtained, each from a corresponding hardware sensor resident on the device. Insufficiently random data is filtered from each of the data sets to produce random data sets which are combined to produce entropy data which is stored in an entropy data cache. An entropy pool is monitored to determine a level of entropy data available and, based on the level determined, entropy data is provided from the entropy data cache to the entropy pool. Entropy data from the entropy pool is then applied to perform a cryptographic operation such as the generation of an encryption key for encrypting communications sent or received by the mobile communication device. | 04-30-2015 |

20150117644 | SYSTEM AND METHOD FOR PERFORMING A SECURE CRYPTOGRAPHIC OPERATION ON A MOBILE DEVICE BASED ON A USER ACTION - In a mobile communication device, multiple sets of sensor measurement data are obtained, each from a corresponding hardware sensor resident on the device. Insufficiently random data is filtered from each of the data sets to produce random data sets which are combined to produce entropy data which is stored in an entropy data cache. An entropy pool is monitored to determine a level of entropy data available and, based on the level determined, entropy data is provided from the entropy data cache to the entropy pool. Entropy data from the entropy pool is then applied to perform a cryptographic operation such as the generation of an encryption key for encrypting communications sent or received by the mobile communication device. | 04-30-2015 |

20120328098 | SYSTEM AND METHOD FOR GENERATING SESSION KEYS - The present disclosure describes systems and methods of generating a cryptographic session key based on a known master key shared between a sender communicator and a receiver communicator in a communication network. In one example, a method includes receiving a request from the receiver communicator, by the sender communicator, to establish a communication session between the sender and the receiver communicator. The method further includes generating an open random number signal at the sender communicator and combining the generated open random number signal with the known master key to generate the cryptographic session key. | 12-27-2012 |

20140369498 | ONE-TIME-PAD ENCRYPTION WITH CENTRAL KEY SERVICE - A one-time-pad encryption system where encrypted one-time-pad keys can be distributed to users on physical media or on a computer network from a central server. Each one-time-pad key has a key identification number that facilitates key management. Each encrypted data set includes a header specifying an offset within the one-time-pad key for commencement of decryption so that messages can be decrypted in any order. Before encryption begins, the length of remaining unused key is compared to the length of the data set to be encrypted. Encryption control buttons are added to a word processor and other programs as an addition to the user interface. | 12-18-2014 |

20150117642 | SYSTEM AND METHOD FOR PERFORMING A SECURE CRYPTOGRAPHIC OPERATION ON A MOBILE DEVICE USING AN ENTROPY POOL - In a mobile communication device, multiple sets of sensor measurement data are obtained, each from a corresponding hardware sensor resident on the device. Insufficiently random data is filtered from each of the data sets to produce random data sets which are combined to produce entropy data which is stored in an entropy data cache. An entropy pool is monitored to determine a level of entropy data available and, based on the level determined, entropy data is provided from the entropy data cache to the entropy pool. Entropy data from the entropy pool is then applied to perform a cryptographic operation such as the generation of an encryption key for encrypting communications sent or received by the mobile communication device. | 04-30-2015 |

20150098568 | METHOD FOR GENERATING A PSEUDORANDOM SEQUENCE, AND METHOD FOR CODING OR DECODING A DATA STREAM - The present invention relates to a method for coding a first data stream and a method for decoding a second data stream wherein the coding is the result of comparing the first data stream with a third data stream formed by a pseudorandom sequence by means of an exclusive comparison operation (XOR). Specifically, the invention relates to the methods based, on hyperchaotic coding methods for generating the pseudorandom, sequences used in coding and decoding. | 04-09-2015 |

20130243192 | Cryptographically Secure Pseudorandom Number Generator - A hardware- and software-efficient class of cryptanalytically-safe pseudorandom number generators is disclosed. Embodiments of the class can be implemented with only a modest use of program space and as few as 512 bytes of non-volatile data space, such embodiments suitable to a wide range of computer architectures, ranging from resource-constrained microcontrollers to high-end, multi-core processors. | 09-19-2013 |

20100091988 | PROGRAMMING ON-CHIP NON-VOLATILE MEMORY IN A SECURE PROCESSOR USING A SEQUENCE NUMBER - An improved secure programming technique involves reducing the size of bits programmed in on-chip secret non-volatile memory, at the same time enabling the typical secure applications supported by secure devices. A technique for secure programming involves de-coupling chip manufacture from the later process of connecting to ticket servers to obtain tickets. A method according to the technique may involve sending a (manufacturing) server signed certificate from the device prior to any communication to receive tickets. A device according to the technique may include chip-internal non-volatile memory to store the certificate along with the private key, in the manufacturing process. | 04-15-2010 |

20140219443 | GENERATION OF CRYPTOGRAPHIC KEYS - A method is provided of generating and distributing secret random data. The method requires a plurality of participating parties each to own an identical private-key generation device and to request a random signal over a shared publication communication network. At each iteration of the method, the parties process the public random signal with the internal states of their secret-key generation devices using two functions, the output of the first function being generated secret random data and the output of the second function being a new internal state. | 08-07-2014 |

20120281827 | Pseudo-random Number Generation Based on Periodic Sampling of One or More Linear Feedback Shift Registers - Disclosed are various embodiments for generating pseudo-random numbers. One such embodiment is an apparatus comprising digital hardware configured to generate pseudo-random numbers. The apparatus uses a linear feedback shift register in which the correlation between successive pseudo-random numbers is reduced. | 11-08-2012 |

20100054466 | METHOD OF GENERATING ARBITRARY NUMBERS GIVEN A SEED - The invention provides a method of generating arbitrary numbers given a seed, characterized by providing a challenge derived from the seed to a physical token, receiving an initial response from the physical token, combining the initial response with helper data associated with the challenge to produce a stable response, and generating the arbitrary numbers using a pseudo-random number generator using the stable response as a seed for the generator. Preferably one or more of these pseudo-random permutations are used as one or more round function(s) in a Feistel block cipher. The generated arbitrary numbers may also be used to create a cryptographic key. | 03-04-2010 |

20100002877 | ADAPTIVE GENERATION OF A PSEUDO RANDOM NUMBER GENERATOR SEED - A seed for use in a cryptographic operation for an electronic device is determined by estimating the number of entropy data bits needed to satisfy a predetermined security strength of the cryptographic operation. The estimation is based on an entropy strength of a string of entropy data bits. Entropy strength is a measure of randomness. Furthermore, guiding a determination of the seed differently according to the estimated number of entropy data bits may be performed. | 01-07-2010 |

20150124963 | AUTHENTICATION - A method in a first entity for authenticating itself to a second entity by proving to the second entity that it is in possession of a full secret without sending the full secret to the second entity, the method comprising: receiving in the first entity an input from a user, the full secret having been divided into at least a first factor and a second factor and the input relating to the second factor of the full secret; reconstructing in the first entity the full secret from at least the first factor and the input; and carrying out a calculation in the first entity using the reconstructed full secret and sending the results of the calculation to the second entity, wherein the results provide an input to a pairing calculation in the second entity. The second entity carries out the pairing calculation to determine whether the client is in possession of the secret. The first entity may be a client and the second entity may be a server. A trusted authority may have issued the client with the secret and may also have issued the server with another secret to allow it to carry out the calculation to determine whether the client is in possession of its secret. | 05-07-2015 |

20140321644 | METHOD AND SYSTEM FOR CALCULATIONS ON ENCRYPTED DATA - A method and device for generating a communal decryption key among participants to permit sharing of sensitive data, the method at a current participant includes generating a secret value; adding the generated secret value to an in progress key to create a modified in progress key; and forwarding the modified in progress key to a subsequent participant in accordance with a predetermined ordering of participants, over a predetermined number of rounds. Further a method for sharing of sensitive data among participants, the method at a current participant includes constructing an exponent by combining a secret value of the current participant and the sensitive data; creating an encrypted value using the constructed exponent; publishing the encrypted value; finding a product of encrypted values of all participants; and decrypting the product of encrypted values using a communal decryption key, wherein the communal decryption key includes secret values of all the participants. | 10-30-2014 |

20120008772 | MEMORY CONTROLLER, MEMORY CONTROL DEVICE MEMORY DEVICE, MEMORY INFORMATION PROTECTION SYSTEM, CONTROL METHOD FOR MEMORY CONTROL DEVICE, AND CONTROL METHOD FOR MEMORY DEVICE - A technique allowing an improvement in the confidentiality of information stored in a memory device. A memory controller includes a key generation part that newly generates key information for use in encryption and decryption of information at every predetermined timing, and a data conversion circuit that encrypts information to be outputted to a memory device based on the information and decrypts encrypted information inputted from the memory device based on the key information. In the data conversion circuit, each time the key generation part generates new key information, key information is updated so as to set the new key information as the key information. | 01-12-2012 |

20140003603 | DATA PROCESSING DEVICE, DATA PROCESSING METHOD, AND PROGRAM | 01-02-2014 |

20090310779 | METHOD FOR GENERATING CRYPTOGRAPHIC KEY FROM BIOMETRIC DATA - Data from biometric images such as minutiae of a fingerprint are represented in coordinates x- and y-, and the direction of the ridge flow of the minutia θ; in vector sets of (x | 12-17-2009 |

20110033046 | ENCRYPTION DEVICE AND ENCRYPTION SYSTEM - The present invention provides an encryption apparatus that prevents plaintext data from leaking even if accumulated data is analyzed, while preventing the size of encrypted data from increasing. An encryption apparatus for encrypting a data piece that is smaller than a unit length for encryption performs the following: storing management information indicating a used area within an encryption area defined based on the unit length, the used area being an area already used for encryption; when encrypting a new data piece that is smaller than the unit length, generating encrypted data by adding the new data piece to an unused area within the encryption area with reference to the management information, the unused area being an area not used for encryption; and updating the management information to include an area for the new data piece into the used area, after generating the encrypted data. | 02-10-2011 |

20090290708 | Generating and Securing Archive Keys - Described herein is a method and apparatus for managing archives. The archive management process receives a passphrase and an indicator of an archive to be managed. The passphrase is used to encipher or decipher an archive key dependent on whether data is to be inserted or extracted from the archive key. The passphrase can be changed by re-enciphering the archive key. | 11-26-2009 |

20160142206 | METHOD AND SYSTEM FOR DELEGATING CALCULATION OF A BILINEAR PAIRING VALUE TO A CALCULATION SERVER - One embodiment relates to a method for enabling an entity to delegate calculation of a bilinear pairing value e(A,B) between two values A and B to a calculation server. The entity may select public elements P | 05-19-2016 |

20140294176 | GENERATING DEVICE, ENCRYPTION DEVICE, DECRYPTION DEVICE, GENERATING METHOD, ENCRYPTION METHOD, DECRYPTION METHOD, AND COMPUTER PROGRAM PRODUCT - According to an embodiment, a generating device includes a first key generator, a second key generator, and an output unit. The first key generator is configured to generate a first key according to a first key rule in which the first key is generated from a random number, the first key being a bit sequence. The second key generator is configured to generate a plurality of second keys according to a second key rule in which the second keys are generated from the first key, the second keys being bit sequences partly correlated to one another. The output unit is configured to output the first key and at least one of the second keys. | 10-02-2014 |

20090262930 | METHOD FOR STRENGTHENING THE IMPLEMENTATION OF ECDSA AGAINST POWER ANALYSIS - A method of inhibiting the disclosure of confidential information through power analysis attacks on processors in cryptographic systems. The method masks a cryptographic operation using a generator G. A secret value, which may be combined with the generator G to form a secret generator is generated. The secret value is divided into a plurality of parts. A random value is generated for association with the plurality of parts. Each of the plurality of parts is combined with the random value to derive a plurality of new values such that the new values when combined are equivalent to the secret value. Each of the new values is used in the cryptographic operation, thereby using the secret generator in place of the generator G in the cryptographic operation. The introduction of randomness facilitates the introduction of noise into algorithms used by cryptographic systems so as to mask the secret value and provide protection against power analysis attacks. | 10-22-2009 |

20140334623 | RAPID DATA ENCRYPTION AND DECRYPTION FOR SECURE COMMUNICATION OVER OPEN CHANNELS WITH PLAUSIBLE DENIABILITY - Technologies are generally described for providing rapid data encryption and decryption for secure communication over an open channel with plausible deniability. In some examples, a single bit of information may be encoded by many alternative combinations of bits thus providing high security as well as enabling a single ciphertext to encrypt several different plaintexts of the same length simultaneously. The ability to encrypt several different plaintexts of the same length simultaneously may allow plausible deniability of messages. Encryption speed may be enhanced through accumulation of useful bit sets with desired properties in advance for later use. When the need arises, several plaintexts of the same size may be encrypted into a single ciphertext using accumulated bit combinations corresponding to different secret keys. | 11-13-2014 |

20090323944 | METHOD OF PUBLIC KEY GENERATION - A potential bias in the generation of a private key is avoided by selecting the key and comparing it against the system parameters. If a predetermined condition is attained it is accepted. If not it is rejected and a new key is generated. | 12-31-2009 |

20100086130 | Digital Content Rights Management Method and System - A digital content rights management method and system belongs to the digital content rights management technique field. The method of the invention includes the steps: registering the system, generating the time stamp, verifying the time stamp when the system starts up, acquiring the certificate, verifying the time before accessing the digital content. The system of the invention comprises a device for accessing the digital content and a server, wherein the device for accessing the digital content comprises: a registering module, a time stamp generating module, a time stamp verification module, a certificate of authorization acquiring module, and a time verification module. The method and system have solved the problem that the digital content can still be used beyond the time limit. | 04-08-2010 |

20100135487 | BUNDLE AUTHENTICATION SYSTEM AND METHOD - There is provided a bundle authentication system and method that can perform network access authentication and authentication at a service request in a next generation network utilizing a Bundled Authentication Key (BAK) generated by using an Extended Master Session Key (EMSK) that is an encryption key generated during access authentication. | 06-03-2010 |

20130003968 | METHOD AND APPARATUS FOR GENERATING SESSION KEY AND CLUSTER KEY - Disclosed herein are a method and apparatus for generating a session key and a cluster key using a network coding scheme. The apparatus includes a random number generation unit, a combination generation unit, a combination transmission unit, a coding result reception unit, and a restoration unit. The random number generation unit generates the random number of a node. The combination generation unit generates a combination based on a master key of the node and the random number. The combination transmission unit transfers the combination to a key distribution server. The coding result reception unit receives a result of a network coding, corresponding to an ID of the node, from the key distribution server. The restoration unit for generating a session key by restoring a random number, corresponding to a counterpart node of the node, using the result of the network coding and the random number. | 01-03-2013 |

20130195267 | PUBLIC KEY ENCRYPTION SYSTEM BASED ON THE QUADRATIC RESIDUOSITY ASSUMPTION - A public-key encryption system. Encryption of a k-bit plaintext m is performed by picking a random generating ciphertext and outputting the ciphertext. N is a non-prime integer (preferably the product of two primes p and q), y is an element in multiplicative group of integers modulo N, and k is an integer larger than 1, Decryption of ciphertext c using private key is performed by recovering such that holds and outputting plaintext m, wherein denotes the 2k-th power residue symbol modulo p, which is defined. Also provided are an encryption device and a decryption device. The encryption scheme provides better bandwidth than the Goldwasser-Micali encryption scheme. | 08-01-2013 |

20150010149 | UNPREDICTABLE NUMBER GENERATION - A method of generating an unpredictable number in a computing device is provided. The method comprises the computing device performing the following programmed steps: obtaining a plurality of data elements; performing a first one way function on an internal value P and the plurality of data elements to update the value P; and performing a second one way function on the value P to obtain the unpredictable number. A computing device adapted to perform this method is also described. | 01-08-2015 |

20120076295 | Message Key Generation - The disclosure relates to message encoding. One claim recites an apparatus comprising: electronic memory for storing a digital watermark plural-bit message; an electronic processor programmed for: providing a plural-bit seed; randomizing the plural-bit seed; and encoding the randomized plural-bit seed with convolutional encoding, the encoded, randomized plural-bit seed comprising a key for transforming the digital watermark plural-bit message. Of course, other claims and combinations are provided too. | 03-29-2012 |

20130034229 | SYSTEM AND METHOD FOR WIRELESS DATA PROTECTION - Disclosed herein are systems, methods, and non-transitory computer-readable storage media for wireless data protection utilizing cryptographic key management on a primary device and a backup device. A system encrypts a file with a file key and encrypts the file key twice, resulting in two encrypted file keys. The system encrypts each file key differently and stores a first file key on the primary device and transmits one of the encrypted file keys in addition to the encrypted file to a backup device for storage. On the backup device, the system associates the encrypted file key with a set of backup keys protected by a user password. In one embodiment, the system generates an initialization vector for use in cryptographic operations based on a file key. In another embodiment, the system manages cryptographic keys on a backup device during a user password change. | 02-07-2013 |

20120069998 | ENCRYPTION DEVICE - According to one embodiment, in an encryption device, a segmentation unit segments masked plain data into pieces of first segmented data. A first processing unit generates pieces of second segmented data from the pieces of first segmented data. A nonlinear transform unit generates pieces of third segmented data transformed from the pieces of second segmented data. A data integration unit integrates fourth segmented data to generate masked encrypted data. An unmask processing unit generates encrypted data from the masked encrypted data. The exclusive OR of the pieces of second segmented data matches the exclusive OR of input data, subjected to nonlinear transform processing and calculated from the plain data, and the first mask. The exclusive OR of the pieces of third segmented data matches the exclusive OR of transform data, obtained when the nonlinear transform processing is performed on the input data, and the second mask. | 03-22-2012 |

20150016606 | GENERATING DEVICE, RE-ENCRYPTING DEVICE, METHOD, AND COMPUTER PROGRAM PRODUCT - According to an embodiment, a generating device includes a first key generator, a second key generator, an output unit, and an update unit. The first key generator is configured to generate a first key that is a sequence of bits according to a first key rule on the basis of a random number. The second key generator is configured to generate multiple second keys that are sequences of bits partially having correlation with one another according to a second key rule on the basis of the first key. The output unit is configured to output the first key and at least one of the second keys. The update unit is configured to generate update information for updating a second key by updating a partial sequence of the second key, the partial sequence having no correlation with the other second keys not to be updated. | 01-15-2015 |

20120134495 | Cloud Storage Data Access Method, Apparatus and System Based on OTP - The present application relates to cloud storage technology and especially relates to a cloud storage data access method, apparatus and system based on OTP. This method includes: generating and storing true random numbers of a predetermined length and a random seed of a predetermined length composed of the true random numbers via a preset method; acquiring data from the random seed for several times and cascading the data acquired each time into a true random data string of no shorter than the length of plaintext; based on the true random data string, generating a true random cryptographic key of no shorter than the length of the plaintext, encrypting the plaintext using this cryptographic key and transmitting ciphertext to a cloud storage data center. This application also provides a cloud storage data access apparatus and system based on OTP. The method, apparatus and system introduced by this invention can generate and store sufficient true random cryptographic key with relatively small physical space occupancy in comparison with that of plaintext, thereby enabling OTP to be applied into cloud storage data security protection. | 05-31-2012 |

20130129088 | METHOD AND SYSTEM FOR GENERATING UNPREDICTABLE PSEUDO-RANDOM NUMBERS - The invention relates to a system for generating unpredictable pseudorandom numbers in a chaotic manner, comprising discrete chaotic map processing means and an XOR gate for generating unpredictable pseudorandom numbers. The method is based on introducing a high degree of entropy in the system by cyclically shifting chaotic maps to the right. | 05-23-2013 |

20110200190 | CRYPTOGRAPHY PROCESSING DEVICE AND CRYPTOGRAPHY PROCESSING METHOD - A cryptography processing device has: a round processing unit configured to obtain a processing-object data and generate an intermediate data by applying round processing to the processing-object data; a random number generation unit configured to generate a random number data; a memory circuit in which the intermediate data or the random number data is stored; and a selection control unit configured to select which one of the intermediate data and the random number data is to be stored in the memory circuit. The selection control unit selects the data to be stored in the memory circuit such that the random number data is stored after the intermediate data is stored. | 08-18-2011 |

20120008771 | Method of Accessing a Data Storage Device - A method of accessing a data storage device, the method including: transforming a first key to obtain a second key; assigning the second key to a logical unit of data of the data storage device; and using the second key to read data from the data storage device or to write data to the data storage device. | 01-12-2012 |

20140211940 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, PROGRAM, AND RECORDING MEDIUM - Provided is an information processing apparatus including a binary random number generation unit configured to generate a binary random number string expressed with binary numbers of M bits (where M≧2), and a ternary number string generation unit configured to generate a ternary number string by grouping the binary random number string in units of k bits and generating binary number strings of the k bits and by expressing the binary number strings of the k bits with ternary numbers of L symbols (where L is a maximum integer satisfying 3 | 07-31-2014 |

20120106733 | SYSTEM AND METHOD FOR DATA ENCRYPTION - A computer executable encryption/decryption system implementing a provably unbreakable cyphering technique having a repeat period of at least a googol with every computer/detachable device having its own unique provably unbreakable encryption. The system comprises an encryption processor, a Googol Production Engine module comprising a plurality of virtual wheels, a digital curtain module comprising a symbol encryption table, a decider module for selecting one of the input data element and the inert ingredient for encryption via the digital curtain, a column selector (Driveshaft) module for advancing the columns in the digital curtain module with a repeat of over a googol for encryption output, and a communications interface operatively connected to computer readable memory and the encryption processor. In an embodiment, the most recent encryption location becomes a new starting coordinate for the next encryption. With precision and controlled variables, the encryption process changes both with and within each encryption. | 05-03-2012 |

20120093310 | APPARATUS AND METHOD THAT GENERATES ORIGINALITY VERIFICATION AND VERIFIES ORIGINALITY VERIFICATION - Provided is an apparatus and method that may generate and verify an originality verification (OV). An OV generating apparatus may generate primary information that is based on generator information and a pseudorandom number, may generate at least one secondary information based on the pseudorandom number, may obtain parameters used when the pseudorandom number is generated, may generate the OV including the primary information, the at least one secondary information, and the parameters, and may distribute the OV to an OV request device. | 04-19-2012 |

20110317829 | Physically Unclonable Function Implemented Through Threshold Voltage Comparison - Electronic devices and methods are disclosed to provide and to test a physically unclonable function (PUF) based on relative threshold voltages of one or more pairs of transistors. In a particular embodiment, an electronic device is operable to generate a response to a challenge. The electronic device includes a plurality of transistors, with each of the plurality of transistors having a threshold voltage substantially equal to an intended threshold voltage. The electronic device includes a challenge input configured to receive the challenge. The challenge input includes one or more bits that are used to individually select each of a pair of transistors of the plurality of transistors. The electronic device also includes a comparator to receive an output voltage from each of the pair of transistors and to generate a response indicating which of the pair of transistors has the higher output voltage. The output voltage of each of the pair of transistors varies based on the threshold voltage of each of the pair of transistors. | 12-29-2011 |

20140241525 | RANDOM NUMBER GENERATOR BASED WIRELESS TRANSMISSION ENCODING CONTROL METHODOLOGY - The present invention relates to an algorithm methodology control means for creating esoteric unique encrypted key coding generation, by a random number generator means, for wireless transmitter and receiver communications pairing and identification. | 08-28-2014 |

20110293089 | Cryptographic Processing Apparatus and Cryptographic Processing Method, and Computer Program - There is provided a highly secure cryptographic processing apparatus and method where an analysis difficulty is increased. In a Feistel type common key block encrypting process in which an SPN type F function having a nonlinear conversion section and a linear conversion section is repeatedly executed a plurality of rounds. The linear conversion process of an F function corresponding to each of the plurality of rounds is performed as a linear conversion process which employs an MDS (Maximum Distance Separable) matrix, and a linear conversion process is carried out which employs a different MDS matrix at least at each of consecutive odd number rounds and consecutive even number rounds. This structure makes it possible to increase the minimum number (a robustness index against a differential attack in common key block encryption) of the active S box in the entire encrypting function. | 12-01-2011 |

20120087494 | METHOD FOR PROVIDING CRYPTOGRAPHICAL KEY PAIRS - The invention relates to a method for creating a second asymmetric cryptographic pair of keys ( | 04-12-2012 |

20140177832 | PROVISION TO AN APPLICATION OF A RANDOM NUMBER NOT GENERATED BY AN OPERATING SYSTEM - A data processing system includes data storage that stores an operating system and an application that performs a security operation and a processor communicatively coupled with the data storage and a random number generator separate from the operating system. The processor executes the operating system and the application. The processor receives a random number from the random number generator and provides the received random number to the application for use in the security operation. | 06-26-2014 |

20150304103 | METHOD OF GENERATING UNIQUE AND HARDLY PREDICTABLE NUMBERS OF COUPONS - The invention is related to generation of an unpredictable subsequent coupon number. The numbers are distributed evenly, and a complete usage of all digits that are allocated for the coupon number is guaranteed. The storage of all previously generated numbers is not required; only a coupon index number is required to obtain the next coupon number. The encryption scheme uses two step of the encryption keys implementation. | 10-22-2015 |

20150304104 | ONE-TIME-PAD ENCRYPTION WITH CENTRAL KEY SERVICE - A one-time-pad encryption system where encrypted one-time-pad keys can be distributed to users on physical media or on a computer network from a central server. Each one-time-pad key has a key identification number that facilitates key management. Each encrypted data set includes a header specifying an offset within the one-time-pad key for commencement of decryption so that messages can be decrypted in any order. Before encryption begins, the length of remaining unused key is compared to the length of the data set to be encrypted. Encryption control buttons are added to a word processor and other programs as an addition to the user interface. | 10-22-2015 |

20150304107 | Extracting Entropy from Machine Vibration - Generating a pool of random numbers for use by computer applications. Vibration sensors are placed throughout a machine and collects information theoretic entropy data from the measurement of the vibration sensors. The data is then filtered and added to an entropy pool. Applications needing a random number may acquire a number from the pool. A method, computer program product and system to generate the pool are provided. | 10-22-2015 |

20150301803 | Extracting Entropy from the Vibration of Multiple Machines - Generating a pool of random numbers for use by computer applications. Vibration sensors are placed throughout a machine and collect entropy data from the measurements of the vibration sensors. The data is then filtered and sent via secure connection to a second machine to be added to the second machine's entropy pool. Applications needing a random number may acquire a number from the pool. A method, computer program product and system to generate the pool are provided. | 10-22-2015 |

20120300925 | RANDOMNESS FOR ENCRYPTION OPERATIONS - Methods, systems, and computer programs for generating random values for encryption operations are described. In some examples, information from a message to be encrypted can be used to refresh the state of a pseudorandom generator. In some aspects, a state parameter of the pseudorandom generator is modified based on information in the message. Modifying the state parameter changes the state parameter from a prior state to a refreshed state based on the information in the message. A random output value is obtained by the pseudorandom generator in the refreshed state. The message is encrypted based on the random output value. | 11-29-2012 |

20110286594 | STORAGE OF SENSITIVE DATA IN A DISPERSED STORAGE NETWORK - A method begins by a processing module applying a share encoding function on data to produce a plurality of encoded shares and generating a corresponding plurality of random numbers for the plurality of encoded shares. The method continues with the processing module generating an encryption key based on a common password and a corresponding one of the corresponding plurality of random numbers and encrypting the encoded share utilizing the encryption key to produce an encrypted share for each encoded share of the plurality of encoded shares. The method continues with the processing module facilitating storage of the corresponding plurality of random numbers and each of the encrypted shares. | 11-24-2011 |

20110135088 | CRYPTOGRAPHIC SECRET KEY DISTRIBUTION - The present invention relates to cryptographic secret key distribution, wherein a value for a number of iterations can be individually set, so that the number of messages to be exchanged during generating a cryptographic secret keycan be varied based on the set value of the iteration number. | 06-09-2011 |

20100111300 | SERVER CERTIFICATE ISSUING SYSTEM - In a server certificate issuing system according to the invention, the Web server includes a control panel which configures and manages a Web and a mail. The control panel is loaded with an entry screen generator to input application items for an issuance of a server certificate, password generator for generating a password which is used to encrypt, and a verification page generator to indicate intention of requesting the issuance of the certificate. On the verification page, the generated password is indicated as verification information for example. The registration server retrieves the password from the received server certificate request and accesses the Web server to read out the verification information indicated on the verification page, and compares the read verification information with the password. As the result of the verification, the verification information read from the Web server is identical to the password, the registration server decides that the Web server for which is to be issued the server certificate exists. Then, the registration server generates the key pair and the CSR and transmits the generated CSR to the certificate issuing server. | 05-06-2010 |

20120257747 | METHOD OF SECURE CRYPTOGRAPHIC CALCULATION, IN PARTICULAR, AGAINST ATTACKS OF THE DFA AND UNIDIRECTIONAL TYPE, AND CORRESPONDING COMPONENT - A method of secure cryptographic calculation includes formulating a first list of first random quantities, formulating a first non-linear substitution operator masked with at least part of the first list, and formulating a second list determined from the first list. The second list includes second random quantities respectively determined from the first random quantities. A second non-linear substitution operator masked with at least part of the second list is formulated. At least two successive implementations of a cryptographic calculation algorithm are performed that includes N rounds of calculations carried out successively to obtain output data based on input data and of a secret key, with a data path of the cryptographic calculation algorithm being masked. | 10-11-2012 |

20140146967 | Secure Modulation and Demodulation - A system and method are disclosed for securely transmitting and receiving a signal. A nonlinear keying modulator is used in the transmitter to encrypt the signal using a nonlinear keying modulation technique. A nonlinear keying demodulator is used in the receiver to decrypt the signal. | 05-29-2014 |

20140079215 | EFFICIENT CRYPTOGRAPHIC KEY STREAM GENERATION USING OPTIMIZED S-BOX CONFIGURATIONS - Application of a ZUC cryptographic functions in wireless communication includes receiving a data stream at the wireless communication apparatus and applying the ZUC cryptographic function to the data stream. The ZUC cryptographic function includes generating at least one multi-byte pseudo-random number that provides an index to one of a plurality of substitution boxes. Each of the substitution boxes is further based on one or more normative substitution boxes. The ZUC cryptographic function further includes retrieving a value from each of the substitution boxes using each byte of the multi-byte pseudo-random number, assembling the retrieved values into at least one substituted values, and generating at least one key value based on the substituted values, wherein the key value is used in applying the ZUC cryptographic function to the data stream. The method also includes processing the data stream after application of the ZUC cryptographic function. | 03-20-2014 |

20140050318 | RE-ENCRYPTION KEY GENERATOR, RE-ENCRYPTION APPARATUS, AND PROGRAM - A re-encryption key generator according to an embodiment generates a re-encryption key required to re-encrypt, without decrypting, ciphertext data obtained by encrypting plaintext data by means of a first public key of a first user device to obtain re-encrypted text data which can be decrypted by a second private key of a second user device. The first storage device stores a first private key corresponding to the first public key. The second storage device stores a second public key corresponding to the second private key. The re-encryption key generation device generates the re-encryption key based on the first private key, the second public key, and the first random number. | 02-20-2014 |

20140016776 | ESTABLISHING UNIQUE KEY DURING CHIP MANUFACTURING - Methods and systems related to producing chips with the uniqueness property are disclosed. A random bit vector is generated using a hardware random number generator on the chip or “on the fly” as a hardware component is being produced. The generated random bit vector is stored in a one-time programmable memory of the chip. A value is derived in the chip from the random bit vector programmed in the one-time programmable memory of the chip. The derived value is exported to an external receiving module communicably connected to the chip to enable a security application provider to encrypt a message that is decryptable by the chip using a key based on the random bit vector programmed in the one-time programmable memory of the chip. | 01-16-2014 |

20140037089 | ENCRYPTION PROCESSING DEVICE AND METHOD - An encryption processing device includes: a memory configured to store a first secret key and a first agitation value operated with the first secret key; and a processor coupled to the memory and configured to: receive a first random number, generate a second agitation key based on the first secret key and the first agitation value, generate a first encryption information based on the second secret key and the first random number, update the first agitation value stored in the memory, and output the first agitation value and the first encryption information. | 02-06-2014 |

20140056425 | One Pad Communications - Perfect secrecy can only be assumed if the length of the key is as long the message sent and the cardinality of the key space is the same as that of the message. The preferred embodiment will demonstrate how to implement a one-pad communication system between a transmitter and a receiver where only a few parameters need to be transferred to the receiver. The preferred embodiment will also demonstrate that a true random number will be generated and used. In an M-sequence LFSR, the integers N+K=M will be used. 2 | 02-27-2014 |

20120288090 | APPARATUS AND METHOD FOR COMMUNICATION SECURITY IN A NATIONWIDE WIRELESS NETWORK USING WIRELESS ROUTERS - Systems and methods for security in a nationwide wireless network with geographically dispersed wireless routers are described. The wireless routers have an interface function with an ability to receive telephone calls from an authorized caller. The router, in response and on demand generates a set of bounded random numbers (BRN) as a random seed for use in generation of encryption keys for communication security between the router and a portable wireless device of the caller. | 11-15-2012 |

20140192981 | INFORMATION PROCESSING APPARATUS, SIGNATURE GENERATION APPARATUS, INFORMATION PROCESSING METHOD, SIGNATURE GENERATION METHOD, AND PROGRAM - Provided is an information processing apparatus including a random number generation unit configured to generate a pair of random numbers from a seed, a message generation unit configured to generate a message based on a pair of multi-order multivariate polynomials F=(f | 07-10-2014 |

20160080147 | AUTHENTICATOR, AUTHENTICATEE AND AUTHENTICATION METHOD - According to one embodiment, an authenticator which authenticates an authenticatee, which stores first key information (NKey) that is hidden, includes a memory configured to store second key information (HKey) which is hidden, a random number generation module configured to generate random number information, and a data generation module configured to generate a session key (SKey) by using the second key information (HKey) and the random number information. The authenticator is configured such that the second key information (HKey) is generated from the first key information (NKey) but the first key information (NKey) is not generated from the second key information (HKey). | 03-17-2016 |

20160080146 | METHODS AND SYSTEMS FOR RANDOMIZED MESSAGE GENERATION FOR CRYPTOGRAPHIC HASH FUNCTIONS - Methods and systems for generation of randomized messages for cryptographic hash functions are described herein. The method includes obtaining a random value in a binary bit form for randomizing a message. The method also includes splitting the message into multiple message blocks, where a length of each of the multiple message blocks is based on a length of the random value and a block length of a compression function. The method further includes prepending and appending each of the multiple message blocks with at least a portion of the random value and concatenating the prepended and appended message blocks to obtain a message envelope for generating the randomized message. | 03-17-2016 |

20110286595 | STORING ACCESS INFORMATION IN A DISPERSED STORAGE NETWORK - A method begins by a processing module applying a share encoding function on data to produce a plurality of encoded shares and generating a plurality of random numbers. The method continues with the processing module obtaining a set of personalized authenticating values regarding user access to the data and generating a plurality of hidden passwords based on the set of personalized authenticating values. The method continues with the processing module generating an encryption key based on a corresponding one of the plurality of hidden passwords and a corresponding one of the plurality of random numbers and encrypting the encoded share utilizing the encryption key to produce an encrypted share for each encoded share of the plurality of encoded shares. The method continues with the processing module facilitating storage of the plurality of random numbers and each of the encrypted shares. | 11-24-2011 |

20110268270 | Method of Public Key Generation - A potential bias in the generation of a private key is avoided by selecting the key and comparing it against the system parameters. If a predetermined condition is attained it is accepted. If not it is rejected and a new key is generated. | 11-03-2011 |

20110274273 | Generation of registration codes, keys and passcodes using non-determinism - In an embodiment, a secure module is provided that provides access keys to an unsecured system. In an embodiment, the secure module may generate passcodes and supply the passcodes to the unsecured system. In an embodiment, the access keys are sent to the unsecured system after the receiving the passcode from the unsecured system. In an embodiment, after authenticating the passcode, the secure module does not store the passcode in its memory. In an embodiment, the unsecured module requires the access key to execute a set of instructions or another entity. In an embodiment, the unsecured system does not store access keys. In an embodiment, the unsecured system erases the access key once the unsecured system no longer requires the access key. In an embodiment, the unsecured system receives a new passcode to replace the stored passcode after using the stored passcode. In an embodiments, a registration code is generated using non-determinism. In an embodiments, a key is generated using non-determinism. Each of these embodiments may be used separately. | 11-10-2011 |

20080260146 | Electronic Circuit Arrangement and Method of Operating Such Electronic Circuit - In order to provide an electronic circuit arrangement ( | 10-23-2008 |

20080298584 | Variable length private key generator and method thereof - The present invention relates to a variable length private key generator. According to one embodiment, the variable length private key generator includes a permuter. The permuter is configured to generate a key stream of a desired length by permuting a plurality of shift registers. The permuter includes the plurality of shift registers, a plurality of clocking modules, and/or an output module. Each clocking module corresponds to a different one of the plurality of shift registers and is configured to generate a clocking signal based on selected bits of the corresponding shift register. The output module is configured to output the key stream based on at least one clocking signal and output of at least one of the plurality of shift registers. | 12-04-2008 |

20090080651 | SEMICONDUCTOR WITH HARDWARE LOCKED INTELLECTUAL PROPERTY AND RELATED METHODS - A computer readable medium includes executable instructions to describe an intellectual property core with a key check mechanism configured to compare an external key with an internal key in response to a specified event. A pending instruction is executed in response to a match between the external key and the internal key. An unexpected act is performed in response to a mismatch between the external key and the internal key. | 03-26-2009 |

20080279373 | Method and System for Electronically Securing an Electronic Device Using Physically Unclonable Functions - The invention is directed to a system for securing an integrated circuit chip used in an electronic device by utilizing a circuit or other entity to produce physically unclonable functions (PUF) to generate a security word, such as an RSA public or private key. A PUF, according to its name and configuration, performs functions that are substantially difficult to be duplicated or cloned. This allows the invention to provide a unique and extremely secure system for authentication. In operation, the stored parameters can be used to more efficiently and quickly authenticate the device without the need to run the burdensome security key generation processes without compromising the level of security in the device. Such a system can be used to substantially eliminate the time to produce security keys when a user needs to authenticate the device at power up or other access point. | 11-13-2008 |

20080304664 | SYSTEM AND A METHOD FOR SECURING INFORMATION - 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. | 12-11-2008 |

20090190755 | STEGOTEXT ENCODER AND DECODER - The invention comprises an encoder for encoding a stegotext and a decoder for decoding the encoded stegotext, the stegotext being generated by modulating the log power spectrogram of a covertext signal with at least one key, the or each key having been added or subtracted in the log domain to the covertext power spectrogram in accordance with the data of the watermark code with which the stegotext was generated, and the modulated power spectrogram having been returned into the original domain of the covertext. The decoder carries out Fast Fourier Transformation and rectangular polar conversion of the stegotext signal so as to transform the stegotext signal into the log power spectrogram domain; subtracts in the log power domain positive and negative multiples of the key or keys from blocks of the log power spectrogram and evaluates the probability of the results of such subtractions representing an unmodified block of covertext in accordance with a predetermined statistical model. | 07-30-2009 |

20080260147 | METHOD AND APPARATUS FOR ENCRYPTING MESSAGE FOR MAINTAINING MESSAGE INTEGRITY, AND METHOD AND APPARATUS FOR DECRYPTING MESSAGE FOR MAINTAINING MESSAGE INTEGRITY - A method of encrypting a message for message integrity is provided. In the method, a random number is generated, a first ciphertext is generated by encrypting the message by using the generated random number, a hash value of the first ciphertext is calculated, an encryption key is generated by using the hash value of the first ciphertext and a shared key, a second ciphertext is generated by encrypting the random number by using the encryption key, and the first and second ciphertexts are combined. | 10-23-2008 |

20080260145 | Selection of a lookup table with data masked with a combination of an additive and multiplicative mask - Processing of masked data using multiple lookup tables (LUTs), or sub-tables, is described. For each input value, an appropriate sub-table provides an output value that is the result of a non-linear transformation (e.g., byte substitution) applied to the input value. An additive mask can be applied to the input data. A transformation can be applied to the masked input data to transform the additive mask into a multiplicative-additive mask. Selected bits of the masked input data and the bits in the additive component of the multiplicative-additive mask can be used in combination to select one of the sub-tables. An entry in the selected sub-table, corresponding to a transformed version of the input data, can then be identified. | 10-23-2008 |

20080219441 | Arrangement Comprising an Integrated Circuit - An integrated circuit ( | 09-11-2008 |

20090060179 | Method and an apparatus to generate pseudo random bits from polynomials - Some embodiments of a method and an apparatus to generate pseudo random bits from polynomials have been presented. In one embodiment, a set of finite field polynomials is used to generate a series of pseudo random bits in one or more cycles. Then a cryptographic key is generated from the series of pseudo random bits. | 03-05-2009 |

20090196418 | Encryption Apparatus with Diverse Key Retention Schemes - An encryption apparatus ( | 08-06-2009 |

20080298583 | System and method of quantum encryption - The present invention relates to a crypto-system. According to one embodiment, the crypto-system includes a key synchronizer and/or cryptographic circuitry. The key synchronizer is configured to synchronize a cryptographic key stream with another communication entity using polarized photons. The cryptographic circuitry is configured to generate cipher text from plain text and/or plain text from cipher text, based on the synchronized key stream. | 12-04-2008 |

20090003598 | ENCRYPTING APPARATUS FOR COMMON KEY CIPHER - The first route selection device re-arrays a plurality of extended key mask values at random according to the value of a random number generated by a random number generation device. An extended key operation device generates an exclusive logical OR of a plurality of the re-arrayed extended key mask values, a data string representing extended key and an input data string. The second route selection device re-arrays the data string of the exclusive logical OR by performing a re-array conversely with the first route selection device according to the value of the random number. A non-linear conversion device applies non-linear conversion to the re-arrayed data string and outputs a data string masked by a plurality of non-linear conversion mask values. The third route selection device re-arrays the masked data string by performing the same re-array as the first route selection device according to the value of the random number. | 01-01-2009 |

20090122983 | IMAGE FORMING APPARATUS, COMPUTER READABLE MEDIUM AND MEDIUM - The image forming apparatus includes: a random number information generation part that generates random number information; a first encryption part that encrypts the random number information generated by the random number information generation part with using a first encryption key; a second encryption key generation part that newly generates a second encryption key from the random number information generated by the random number information generation part; a second encryption part that encrypts specific information for identifying the apparatus with using the second encryption key generated by the second encryption key generation part; a code data creation part that creates code data based on encrypted random number information encrypted by the first encryption part and encrypted specific information encrypted by the second encryption part; and an image forming part that forms a code image based on the code data created by the code data creation part on a recording medium. | 05-14-2009 |

20090208005 | KEY GENERATING DEVICE, ENCRYPTING DEVICE, RECEIVING DEVICE, KEY GENERATING METHOD, ENCRYPTING METHOD, KEY PROCESSING METHOD, AND PROGRAM - A key generating device according to an embodiment of the present invention includes: a parameter determining unit that randomly determines a plurality of parameters that are needed when generating a secret key and a public key; a bilinear group selecting unit that selects a plurality of bilinear groups and bilinear mapping on the basis of the plurality of parameters; and a key generating unit that generates the secret key and the public key on the basis of the parameters and the plurality of bilinear groups. | 08-20-2009 |

20090103726 | Dual-mode variable key length cryptography system - In a cryptography system, client and server terminals each generate a private key constituting a randomized compilation of dynamic system parameters. Public keys are then generated based on the private keys, exchanged between the terminals, and used to generate a shared secret. Key stream generators generate a randomized key stream at each terminal using the shared secret, based on self-generating primitive polynomials. Key length is user selected, and may be modified during an ongoing encryption session. The generator includes a plurality of linear feedback shift registers whose lengths are self-configuring based on the user-specified key length. The registers are interconnected so that their output, namely, the key stream, is non-linear and random. Data is converted to binary form and encrypted by XOR'ing the binary-format data with the key stream. The system may be used in both a static secure transfer mode and a dynamic secure real time transfer mode. | 04-23-2009 |

20090067624 | System and method of protecting content of an electronic file using a computer - A system and method of protecting the content of an electronic file using at least one computer. The invention includes providing at least one local key file having unique local encryption key data. In addition, the method includes selecting a random portion of the local encryption key data, and selecting a portion from the electronic file. The method further includes encrypting the portion of the electronic file by utilizing the portion of the local encryption key and at least one encryption formula or algorithm. | 03-12-2009 |

20090060180 | Method and an apparatus to generate pseudo random bits for a cryptographic key - Some embodiments of a method and an apparatus to generate pseudo random bits for a cryptographic key have been presented. In one embodiment, a set of Blum-Blum-Shub (BBS) pseudo random number generators is executed substantially in parallel. Each of the BBS pseudo random number generators may generate a series of pseudo random bits. A subset of pseudo random bits is extracted from each of the series of pseudo random bits from each of the plurality of BBS pseudo random number generators. Subsets of the series of pseudo random bits from the BBS pseudo random number generators are combined to generate a cryptographic key. | 03-05-2009 |

20090041239 | PSEUDO-RANDOM FUNCTION CALCULATING DEVICE AND METHOD AND NUMBER-LIMITED ANONYMOUS AUTHENTICATION SYSTEM AND METHOD - An efficient pseudo-random function and an efficient limited number of times authentication system using such a function are realized. A pseudo-random function calculating device comprises a key creating means and a pseudo-random function calculating means. The key creating means creates a public key made of a set of at least a first component and a second component as components constituting an element of a finite group and a secret key made of an integer and secretly saves the created secret key in a secret key memory section but makes the public key public. The pseudo-random function calculating means outputs the element of a finite group as function value of the pseudo-random function upon receiving an integer as input. The pseudo-random function calculating means outputs the product of multiplication of the first element of the value obtained by calculating the modular exponentiation, using the first component of the public key and the input integer respectively as base and exponent, and the second element of the value obtained by calculating the modular exponentiation, using the second component of the public key and the reciprocal of the sum of the secret key and the input integer in a finite field respectively as base and component. | 02-12-2009 |