Patent classifications
H04L9/3093
Systems and methods for disparate quantum computing threat detection
Systems, methods, and computer program products are provided for disparate quantum computing (QC) detection. An example system includes QC detection data generation circuitry that generates a first set of QC detection data and generates a second set of QC detection data. The system also includes cryptographic circuitry that generates a first public cryptographic key and a first private cryptographic key via a first post-quantum cryptographic (PQC) technique and generates a second public cryptographic key and a second private cryptographic key via a second PQC technique. The cryptographic circuitry further generates encrypted first QC detection, second QC detection data, and destroys the first private cryptographic key and the second private cryptographic key. The system further includes data monitoring circuitry that monitors for the first encrypted QC detection data and the second encrypted QC detection data.
Cryptographic machines characterized by a Finite Lab-Transform (FLT)
Digital n-state switching devices are characterized by n-state switching tables with n greater than 4. N-state switching tables are transformed by a Finite Lab-transform (FLT) into an FLTed n-state switching table. Memory devices, processors and combinational circuits with inputs and an output are characterized by an FLTed n-state switching table and perform switching operations between physical states in accordance with an FLTed n-state switching table. The devices characterized by FLTed n-state switching tables are applied in cryptographic devices. The cryptographic devices perform standard cryptographic operations or methods that are modified in accordance with an FLT. One or more standard cryptographic methods are specified in Federal Information Processing Standard (FIPS) Publications. Security is improved by at least a factor n.sup.2.
Preventing fraud in aggregated network measurements
Methods, systems, and apparatus, including a method for preventing fraud. In some aspects, a method includes: receiving, from multiple client devices, a measurement data element that includes a respective group member key and a group identifier for a given conversion as a result of displaying a digital component. Each client device uses a threshold encryption scheme to generate, based at least on network data that includes one or more of impression data or conversion data for the conversion, a group key that defines a secret for encrypting the network data and generate, based on data related to the application, the respective group member key that includes a respective share of the secret. In response to determining that at least the threshold number of measurement data elements having the same group identifier have been received, the network data is decrypted using the group member keys in the received measurement data elements.
ELECTRONIC APPARATUS, CONTROL METHOD THEREOF AND SERVER
Disclosed is an electronic apparatus. The electronic apparatus includes a memory storing a composite function in which at least two polynomials are composed and a processor configured to, based on a comparison operation command being received for a plurality of homomorphic ciphertexts, perform operation by reflecting the plurality of homomorphic ciphertexts to the composite function, and obtain a comparison result of the plurality of homomorphic ciphertexts based on the operation result, each of the at least two polynomials may output a value in a preset range for a value in a preset domain, and a domain of one of the at least two polynomials may be determined based on a range of a previous polynomial.
Calculation device for encryption using public key and encryption method thereof
An encryption method includes: calculating a second random matrix using a first random matrix and a secret key, and generating a ciphertext corresponding to a message using the second random matrix. The generating of the ciphertext includes: performing a rounding process for sending the generated ciphertext to a smaller modulus area. The generating of the ciphertext includes performing message encryption without Gaussian sampling.
UNIVERSAL ZERO-KNOWLEDGE SUCCINCT NON-INTERACTIVE ARGUMENT OF KNOWLEDGE PROOF SYSTEM FOR STACK-BASED VIRTUAL MACHINE PROGRAM
The present invention relates to a zero-knowledge proof technique, and more particularly, to a succinct and non-interactive zero-knowledge proof system for a universal stack machine program, and a method thereof. According to an embodiment of the present invention, when a universal and concise zero-knowledge SNARK is applied to a smart contract of a blockchain, the transaction processing speed may be increased only for the operation proof of the stack machine program by using the simple structural features of a stack machine.
CERTIFICATE BASED SECURITY USING POST QUANTUM CRYPTOGRAPHY
Establishing secure communications by sending a server certificate message, the certificate message including a first certificate associated with a first encryption algorithm and a second certificate associated with a second encryption algorithm, the first certificate and second certificate bound to each other, signing a first message associated with client-server communications using a first private key, the first private key associated with the first certificate, signing a second message associated with the client-server communications using a second private key, the second private key associated with the second certificate, the second message including the signed first message, and sending a server certificate verify message, the server certificate verify message comprising the signed first message and the signed second message.
Systems and methods for post-quantum cryptography optimization
Systems, apparatuses, methods, and computer program products are disclosed for post-quantum cryptography (PQC). An example method includes receiving data, a set of data attributes about the data, and a risk profile data structure indicative of a vulnerability of the data in a PQC data environment. The example method further includes retrieving PQC cryptographic performance information associated with a set of PQC cryptographic techniques. The PQC cryptographic performance information may comprise a set of PQC cryptographic performance attributes for a plurality of PQC cryptographic techniques in the set of PQC cryptographic techniques. The example method further includes selecting a PQC encryption algorithm for encrypting the data based on the set of data attributes, the risk profile data structure, the PQC cryptographic performance information, and a PQC optimization machine learning model. Subsequently, the example method includes encrypting the data based on the selected PQC encryption algorithm.
Systems and methods for post-quantum cryptography optimization
Systems, apparatuses, methods, and computer program products are disclosed for post-quantum cryptography (PQC). An example method includes receiving data. The example method further includes receiving a set of data attributes about the data. The set of data attributes comprises one or more sets of data environment data attributes that are each representative of a set of data environments associated with the data. The example method further includes receiving one or more sets of data environment threat data structures associated with one or more data environments in the one or more sets of data environments associated with the data. The example method further includes selecting one or more cryptographic techniques for encrypting the data for at least the one or more data environments based on the set of data attributes, the one or more sets of data environment threat data structures, and a cryptograph optimization machine learning model.
SECRET MATERIAL EXCHANGE AND AUTHENTICATION CRYPTOGRAPHY OPERATIONS
Aspects of associative cryptography key operations are described. In one embodiment, a first cryptographic function is applied to secret data to produce a first encrypted result. The first encrypted result is transmitted by a first device to a second device. The second device applies a second cryptographic function to the first encrypted result to produce a second encrypted result. At this point, the secret data has been encrypted by two different cryptographic functions, each of them being sufficient to secure the secret data from others. The two different cryptographic function can be inversed or removed, in any order, to reveal the secret data. Thus, the first device can apply a first inverse cryptographic function to the second encrypted result to produce a first result, and the second device can apply a second inverse cryptographic function to the first result to decrypt the secret data.