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.

Disclosed are a calculation device for encryption using a public key and an encryption method thereof. The present method comprises: a step for setting a secret key, and generating a public key using the secret key and an error extracted from a discrete Gaussian distribution or a distribution that is within a short statistical distance thereto; and a step for applying the public key to a message, and then performing a rounding process to encrypt the message. Accordingly, encryption efficiency can be enhanced.

A method of digital media processing includes performing a conversion between a media segment and a bitstream of the media segment. The conversion conforming to a format rule and an encryption rule. The format rule specifying that verification information, which includes an indication of an integrity of a portion of the media segment, is signaled in the bitstream.

A communication brokering device receives, from a first device, a measurement of at least one of a bit-error-rate (BER) or a signal-to-noise ratio (SNR) associated with receipt of a transmission at the first device. The communication brokering device determines whether the first device is vulnerable to message interception or eavesdropping based on the measurement of the at least one of the BER or the SNR. The communication brokering device controls communications between at least one second device and the first device based on the determination of whether the first device is vulnerable to message interception or eavesdropping.

Methods and systems described herein authenticate a user and help secure transaction. A display screen presents images that are difficult for malware to recognize but a person can recognize. In at least one embodiment, a person communicates transaction information using visual images received from the service provider system. In at least one embodiment, a user selects a sequence of visual images as a means of authenticating the user and logging into a financial account or other corporate account. In some embodiments, methods and systems are provided for determining whether to grant access, by generating and displaying visual images on a screen that the user can recognize, and select. In an embodiment, a user presses his or her finger or fingers on a display screen to select images as a method for authenticating and protecting communication from malware. In an embodiment, non-determinism in hardware helps unpredictably vary the image selected, the image location, generate noise in the image, or change the shape or texture of the image. In some embodiments, visual image authentication helps Alice and Bob detect if Eve has launched a man-in-the-middle attack on their key exchange.

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.

The invention discloses an error reconciliation method for a Learning With Errors (LWE) public key cryptography. The method includes an encoding algorithm and a decoding algorithm. The input of the encoding algorithm is a binary message vector u∈{0,1}.sup.k with a length of k, the output is a q-ary vector z∈Z.sub.q.sup.m with a length of m, where Z.sub.q={−q/2, . . . , q/2−1}; the input of the decoding algorithm is a q-ary vector w=z+e∈Z.sub.q.sup.m containing errors with a length of m, and the output is a binary vector u∈{0,1}.sup.k corresponding to z; the error reconciliation method for the LWE public key cryptography provided by the present invention combines a binary linear code with a Gray code to realize the error reconciliation scheme in LWE public key cryptography. The error reconciliation method can be used to solve the problem of error reconciliation in LWE public key cryptography. The scheme of the invention has good fault tolerance and can significantly improve the transmission rate of encrypted information.

A method is provided for quantum-resistant secure key distribution between a peer and an extendible authentication protocol (EAP) authenticator by using an authentication server. The method may include receiving requests for a COMMON-SEED and a McEliece public key from a peer and an EAP authenticator by an authentication server using an EAP method, encrypting the COMMON-SEED using the McEliece public key of the peer and the McEliece public key of the EAP authenticator by the authentication server, and sending the encrypted COMMON-SEED from the authentication server to the peer along with a request for a PPK_ID from the peer using the EAP method to complete authentication of the peer. The method may also include receiving the PPK_ID from the peer using the EAP method, where the PPK_ID is from a key pair consisting of PPK_ID and PPK obtained from a first SKS server in electrical communication with the peer based upon the encrypted COMMON-SEED. The method may also include sending the encrypted COMMON-SEED and PPK_ID from the authentication server to the EAP authenticator, and establishing a quantum-resistant secure channel between the peer and the EAP authenticator, where a message of EAP success is delivered from the EAP authenticator to the peer when the peer and the EAP authenticator share the same COMMON-SEED and the same PPK-ID.

Systems and methods are provided for quantum-resistant secure key distribution between a peer and an EAP authenticator by using an authentication server. The systems and methods include receiving requests for a COMMON-SEED and a quantum-safe public key from a peer and an EAP authenticator. The COMMON-SEED is encrypted using the quantum-safe public key of the peer and the quantum-safe public key of the EAP authenticator, and the encrypted COMMON-SEED is sent to the peer along with a request for a PPK_ID from the peer to complete authentication of the peer. The PPK_ID is received from the peer, and the encrypted COMMON-SEED and PPK_ID is sent to the EAP authenticator. A quantum-resistant secure channel is established between the peer and the EAP authenticator when the peer and the EAP authenticator share the same COMMON-SEED and the same PPK-ID.

Some protocols for the transmission of data on a communication network, such as the LoRaWAN protocol, use frames comprising payloads intended to transport useful data, the size of which may vary from one frame to another. A communication method is proposed in order to transmit data on this type of network. This method is based on a division of a payload packet into a set of blocks and then an insertion of the blocks thus formed into at least one segment. Each segment comprises a number of blocks suited to a payload size at the time of creation of the segment. The segments are next supplemented with verification information enabling an addressee of the data packet to determine whether it has received all the blocks. In the event of non-reception of all the blocks, the sender of the blocks retransmits at least the blocks not received.