# Plural generators

## Subclass of:

## 380 - Cryptography

## 380277000 - KEY MANAGEMENT

## 380044000 - Having particular key generator

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

#### Deeper subclasses:

Class / Patent application number | Description | Number of patent applications / Date published |
---|---|---|

380047000 | Plural generators | 13 |

20110228930 | METHOD AND DEVICE FOR KEY GENERATION - A method of generating a segment key KSmt from a given basic key KmT and a given modification key K′ | 09-22-2011 |

20130243193 | DIGITAL SIGNATURE GENERATION APPARATUS, DIGITAL SIGNATURE VERIFICATION APPARATUS, AND KEY GENERATION APPARATUS - A digital signature generation apparatus includes memory to store finite field F | 09-19-2013 |

20140198914 | METHOD AND APPARATUS FOR ESTABLISHING A KEY AGREEMENT PROTOCOL - A system and method for generating a secret key to facilitate secure communications between users. A first and second and a function between the two monoids are selected, the function being a monoid homomorphism. A group and a group action of the group on the first monoid is selected. Each user is assigned a submonoid of the first monoid so that these submonoids satisfy a special symmetry property determined by the function, a structure of the first and second monoids, and the action of the group. A multiplication of an element in the second monoid and an element in the first monoid is obtained by combining the group action and the monoid homomorphism. First and second users choose private keys which are sequences of elements in their respective submonoids. A first result is obtained by multiplying an identity element by the first element of the sequence in a respective submonoid. Starting with the first result, each element of the user's private key may be iteratively multiplied by the previous result to produce a public key. Public keys are exchanged between first and second users. Each user's private key may be iteratively multiplied by the other user's public key to produce a secret key. Secure communication may then occur between the first and second user using the secret key. | 07-17-2014 |

20120275596 | CRYPTOGRAPHIC KEY ATTACK MITIGATION - Cryptographic keys and, subsequently, the data they are intended to protect, are safeguarded from unwarranted attacks utilizing various systems and methodologies designed to minimize the time period in which meaningful versions of cryptographic keys exist in accessible memory, and therefore, are vulnerable. Cryptographic keys, and consequently the data they are intended to protect, can alternatively, or also, be protected from attackers utilizing systems and a methodology that employs a removable storage device for providing authentication factors used in the encryption and decryption processing. Cryptographic keys and protected data can alternatively, or also, be protected with a system and methodology that supports data separation on the storage device(s) of a computing device. Cryptographic keys and the data they are intended to protect can alternatively, or also, be protected employing a system and methodology of virtual compartmentalization that effectively segregates key management from protected data. | 11-01-2012 |

20130114810 | CRYPTOGRAPHIC SYSTEM, CRYPTOGRAPHIC COMMUNICATION METHOD, ENCRYPTION APPARATUS, KEY GENERATION APPARATUS, DECRYPTION APPARATUS, CONTENT SERVER, PROGRAM, AND STORAGE MEDIUM - A cryptographic communication technology that is based on functional encryption and that can operate flexibly is provided. A conversion rule information pair is determined in advance, which has attribute conversion rule information prescribing a conversion rule for converting attribute designation information to attribute information used in a functional encryption algorithm and logical expression conversion rule information prescribing a conversion rule for converting logical expression designation information to logic information used in the functional encryption algorithm. One kind of conversion rule information included in the conversion rule information pair is used to obtain first attribute information or first logic information from input information. The first attribute information or the first logic information is used for encryption. Encryption information is decrypted with a decryption key generated by using second attribute information or second logic information obtained from user information by using the other kind of conversion rule information. | 05-09-2013 |

20130336481 | DEVICE - According to one embodiment, a memory being used to store a host identification key, a host constant (HC), and a first key, the first key being generated based on the host constant (HC); a first generator configured to decrypt a family key block read from an external device with the host identification key to generate a family key; a second generator configured to decrypt encrypted secret identification information read from the external device with the family key to generate a secret identification information; a third generator configured to generate a random number; a fourth generator configured to generate a session key by using the first key and the random number; a fifth generator configured to generate a first authentication information by processing the secret identification information with the session key in one-way function operation | 12-19-2013 |

20120087495 | METHOD FOR GENERATING AN ENCRYPTION/DECRYPTION KEY - The present invention relates to a method for generating an encryption/decryption key, and especially for generating a one-time encryption/decryption key used for symmetric encryption, i.e. where the same key is used both for encryption and decryption. In order to start key generation a first node sends a request to a central server for setting up communication with a second node. The central server sends a key generating file both the nodes. Each node generates a different intermediate data set, i.e a first and second data set. The first data set generated by the first node is sent to the second node, which based on this data set generates a third data set which is sent back to the first node. The generating of a first cryptographic key in node is based on bit by bit comparison between the third and the first intermediate data set and the generation of a second cryptographic key is based on bit by bit comparison between the first and the second intermediate data set. The first and second cryptographic key being the same. | 04-12-2012 |

20140369499 | CRYPTOGRAPHIC DEVICE, CRYPTOGRAPHIC PROCESSING METHOD, AND CRYPTOGRAPHIC PROCESSING PROGRAM - According to an embodiment, a cryptographic device includes a first operation unit that receives a shared key and generates plural expanded keys; and a second operation unit that receives plaintext or ciphertext and performs at least one of encryption and decryption using the expanded keys. First data pieces are obtained by dividing the plaintext into predetermined units of words or obtained by dividing the ciphertext into predetermined units of words. The second operation unit includes a data array determination unit that determines, at a time of encryption, an array order of the first data pieces included in the plaintext as a first order, and determines, at a time of decryption, an array order of the first data pieces included in the ciphertext as a second order; and a main data computation unit that performs, on the first data pieces, computation of at least one of encryption and decryption in the determined order. | 12-18-2014 |

20150318989 | METHOD AND APPARATUS FOR ESTABLISHING A KEY AGREEMENT PROTOCOL - A system and method for generating a secret key to facilitate secure communications between users. A first and second and a function between the two monoids are selected, the function being a monoid homomorphism. A group and a group action of the group on the first monoid is selected. Each user is assigned a submonoid of the first monoid so that these submonoids satisfy a special symmetry property determined by the function, a structure of the first and second monoids, and the action of the group. A multiplication of an element in the second monoid and an element in the first monoid is obtained by combining the group action and the monoid homomorphism. First and second users choose private keys which are sequences of elements in their respective submonoids. A first result is obtained by multiplying an identity element by the first element of the sequence in a respective submonoid. Starting with the first result, each element of the user's private key may be iteratively multiplied by the previous result to produce a public key. Public keys are exchanged between first and second users. Each user's private key may be iteratively multiplied by the other user's public key to produce a secret key. Secure communication may then occur between the first and second user using the secret key. | 11-05-2015 |

20140112470 | METHOD AND SYSTEM FOR KEY GENERATION, BACKUP, AND MIGRATION BASED ON TRUSTED COMPUTING - The present invention relates to the field of computer technologies and discloses a method and a system for key generation, backup, and migration based on trusted computing, including: receiving a key generation request input by a user; controlling a trusted platform module to generate a platform migratable key, encrypting the platform migratable key by using a public key of a root key of the trusted platform module, and storing a cipher-text key of the platform migratable key; controlling the trusted platform module to generate a user migratable key, encrypting the user migratable key by using a public key of the platform migratable key, and storing a cipher-text key of the user migratable key; and controlling the trusted platform module to generate a binding key of the user, encrypting the binding key by using a public key of the user migratable key, and storing a cipher-text key of the binding key. | 04-24-2014 |

20110216902 | Computation of garbled tables in garbled circuit - An efficient encryption system for improving the computation speed of a garbled circuit is set forth. The garbled circuit includes a number of garbled Boolean gates having first and second garbled Boolean gate input wires. The system includes a first key ki on a first garbled gate input wire. A second key kj is also provided on a second garbled gate input wire. A programmable function is provided for combining the first key ki and the second key kj to obtain an encrypted output key. A method for expediting encryption and decryption of a garbled circuit having a number of encryptions for a garbled table of a garbled gate is also set forth. The method includes the steps of: forming the garbled table with a number of secret keys by applying a function to the secret keys to produce less than twice the number of secret keys as the number of encryptions for the garbled table, and evaluating the garbled table to decrypt an output key of the garbled table. | 09-08-2011 |

20090110193 | SCHRYPTION METHOD AND DEVICE - A schryption of a text message is based on a schryption key for defining one or more aspects of an encryption and/or a decryption of the text message. For an encryption of the text message, the schryption key is derived from a user key in the form of an encryption key (e.g., a secret key or a public key), and the text message in the form of plaintext is encrypted as defined, at least partially, by the schryption key to thereby yield a ciphertext. For a decryption of the text message, the schryption key is derived from user key in the form of a decryption key (e.g., a secret key or a private key), and the text message in the form of a ciphertext is decrypted as defined, at least partially, by the schryption key to thereby yield a plaintext. | 04-30-2009 |

20080226066 | APPARATUS FOR BATCH VERIFICATION AND METHOD USING THE SAME - A batch verification apparatus and method wherein, the method includes: generating a plurality of secret keys, a plurality of public keys corresponding to the plurality of secret keys, and a plurality of verification values corresponding to the plurality of public keys; calculating a first batch verification value based on the plurality of verification values; calculating a second batch verification value based on the plurality of secret keys and the plurality of verification values; comparing the first batch verification value and the second batch verification value; and determining that a batch of the received plurality of verification values is verified when the first batch verification value is equal to the second batch verification value. | 09-18-2008 |