According to various embodiments, a method for code-based generation of a key pair for asymmetric cryptography is described including generating a private key defining a linear code, determining a parity check or generator matrix for the linear code, blinding a sub-matrix of the parity check or generator matrix, generating a blinded inverse matrix by inverting the blinded sub-matrix or by inverting a quadratic matrix contained in the blinded sub-matrix, de-blinding the blinded inverse matrix to generate an inverse matrix and generating a public key for the private key using the inverse matrix.

An authentication and encryption protocol is provided that can be implemented within a single clock cycle of an integrated circuit chip while still providing unbreakable encryption. The protocol of the present invention is so small that it can co-exist on any integrated circuit chip with other functions, including a general purpose central processing unit, general processing unit, or application specific integrated circuits with other communication related functionality.

An authentication and encryption protocol is provided that can be implemented within a single clock cycle of an integrated circuit chip while still providing unbreakable encryption. The protocol of the present invention is so small that it can co-exist on any integrated circuit chip with other functions, including a general purpose central processing unit, general processing unit, or application specific integrated circuits with other communication related functionality.

A method of providing credentials to enable a second party to verify an identity of a first party. The first party is associated with a first public key which is registered with a third party. One or more first credentials are provided to the second party. A request transaction is obtained, which comprises a) an input comprising a signature generated based on a respective private key of the third party, and b) an output locked to a second public key of the first party. The second public key is based on the first public key. A confirmation transaction is generated. The confirmation transaction comprises an input that references the output of the request transaction, and a signature generated based on a private key corresponding to the second public key of the first party. The confirmation transaction is transmitted to nodes of a blockchain network for inclusion in a blockchain.

The invention relates to a method for enrolling data in order to verify the authenticity of a security datum, the method comprising implementing by data processing means of a server the steps of: obtaining a reference security datum, generating a first encoded datum by applying to the reference security datum an obfuscated fuzzy Hamming distance encoding procedure, determining from the reference security datum, a plurality of derived data of the reference security datum, generating a first random datum, and determining a second encoded datum such that a variable point comparison predicate parameterized by the second encoded datum and the first random datum is true when said variable point has as coordinates said derived data, storing on a data storage means of the server at least said first and second encoded data. The invention also relates to a verification method and a server for this purpose.

Disclosed is a ciphertext computation method. The ciphertext computation method includes: receiving a modular computation command for a plurality of ciphertexts; performing a modular computation for the plurality of ciphertexts by using a lookup table storing a plurality of predetermined prime number information; and outputting a result of the computation.

A storage device having improved security reliability includes a non-volatile memory, and a storage controller configured to control an operation of the non-volatile memory, generate a key material, receive a key identification (ID) from a firmware, determine whether a salt value matching the key ID is stored in the non-volatile memory, generate a private key using the salt value stored in the non-volatile memory and the key material in response to determining that the salt value matching the key ID is stored in the non-volatile memory, and, in response to determining that the sale value matching the key ID is not stored in the non-volatile memory, receive a salt value from the firmware and generate the private key using the salt value from the firmware and the key material, and store the salt value used for generating the private key in the non-volatile memory.

A computer-implemented method and system for computing large-degree isogenies of a base degree raised to a power of form .sup.ak+b and including the steps of providing at least one computer processor resident on an electronic computing device, performing, with the at least one processor, a large-degree isogeny by chaining together a plurality of scalar point multiplications, a plurality of isogeny computations, and a plurality of isogeny evaluations, wherein the large-degree isogeny includes a sequence storing at least one pivot point computed by one of the plurality of scalar point multiplications followed by an isogeny computation of degree .sup.b, performing at least one of the plurality of isogeny evaluations following one of the plurality isogeny computations, and performing an .sup.ak-isogeny through another sequence of .sup.a isogeny computations.

A first device may determine a prime integer for generating public keys, wherein the prime integer is based on a set of distinct prime integers. The first device may generate a set of multiple public keys based on a set of secret keys. The first device may combine the set of multiple public keys into a single value based on the prime integer and the set of distinct prime integers. The first device may transmit the single value to a second device.

Disclosed is a calculation apparatus. The calculation apparatus comprises a memory which stores at least one instruction and a processor which executes the at least one instruction, wherein the processor executes the at least one instruction to store a predetermined base prime number, invert the bits of information about the pre-stored base prime number to generate first prime number information different from the base prime number information, and perform modular calculation on a plurality of ciphertexts by using the generated first prime number information.