Acceleration of elliptic curve-based isogeny cryptosystems

    公开(公告)号:US11683171B2

    公开(公告)日:2023-06-20

    申请号:US17337541

    申请日:2021-06-03

    发明人: Rajat Rao

    摘要: Provided are embodiments for a circuit comprising for performing hardware acceleration for elliptic curve cryptography (ECC). The circuit includes a code array comprising instructions for performing complex modular arithmetic; and a data array storing values corresponding to one or more complex numbers. The modular arithmetic unit includes a first multiplier and a first accumulation unit, a second multiplier and a second accumulation unit, and a third multiplier and a third accumulation unit, wherein the first, second, and third multiplier and accumulation units are cascaded and configured to perform hardware computation of complex modular operations. Also provided are embodiments of a computer program product and a method for performing the hardware acceleration of super-singular isogeny key encryption (SIKE) operations.

    Method of Designing of Multi-Party System in QAP-Based Homomorphic Encryption

    公开(公告)号:US20230188343A1

    公开(公告)日:2023-06-15

    申请号:US18077262

    申请日:2022-12-08

    IPC分类号: H04L9/30 H04L9/00

    摘要: A method of designing a multi-party system in quotient algebra partition-based homomorphic encryption (QAPHE), which is based on the framework of quotient algebra partition (QAP) and the computation of homomorphic encryption (HE), wherein the method comprises: increasing single model provider A to multiple ones, wherein the number of the multiple model providers is L and let A1≤i≤L and L≥2; increasing single data provider B to multiple ones, wherein the number of the multiple data providers is R and let B1≤j≤R and R≥2; and encoding plaintexts, each of which is of kj qubits, from all data providers into ciphertexts respectively; aggregating the ciphertexts by a form of tensor product and generating an encoded state for computation; and preparing a model operation to conduct the encrypted computation via an encoded operator and the encoded state in a cloud. The method can improve the security of public-key/semi-public-key system and be applied to a threshold HE or a multi-key HE to solve actual problems.

    CRYPTOGRAPHIC SYSTEM, ENCRYPTION DEVICE, DECRYPTION DEVICE, AND KEY GENERATION DEVICE

    公开(公告)号:US20230179397A1

    公开(公告)日:2023-06-08

    申请号:US18163485

    申请日:2023-02-02

    IPC分类号: H04L9/06 H04L9/30 H04L9/08

    摘要: A cryptographic system (1) performs a cryptographic process in which a Richelot isogeny sequence φs whose starting point is an abelian surface A0 and whose end point is an abelian surface As is a secret key and the abelian surface As is a public key. An encryption device (28) computes an abelian surface Am by transitioning the abelian surface As, which is the public key, by a Richelot isogeny sequence φm generated by encoding a plaintext m, and sets the abelian surface Am as a ciphertext. A decryption device (30) computes a Richelot isogeny φm whose starting point is the abelian surface As, which is the public key, and whose end point is the abelian surface Am, which is the ciphertext, based on the Richelot isogeny sequence φs, which is the secret key.

    PROTECTING THE INPUT/OUTPUT OF MODULAR ENCODED WHITE-BOX RSA

    公开(公告)号:US20190251233A1

    公开(公告)日:2019-08-15

    申请号:US16391437

    申请日:2019-04-23

    申请人: NXP B.V.

    IPC分类号: G06F21/14 G06F21/62 H04L9/30

    摘要: A method of obscuring the input and output of a modular exponentiation function, including: receiving modular exponentiation parameters including an exponent e having N bits and a modulus m; generating randomly a pre-multiplier; calculating a post-multiplier based upon the pre-multiplier, exponent e, and modulus m; multiplying an input to the modular exponentiation function by the pre-multiplier; performing the modular exponentiation function; and multiplying the output of the modular exponentiation function by the post-multiplier, wherein multiplying an input to the modular exponentiation function by the pre-multiplier, performing the modular exponentiation function, and multiplying the output of the modular exponentiation function by the post-multiplier are split variable operations.