OPTIMIZATION TECHNIQUE FOR MODULAR MULTIPLICATION ALGORITHMS

    公开(公告)号:US20230401037A1

    公开(公告)日:2023-12-14

    申请号:US18237859

    申请日:2023-08-24

    CPC classification number: G06F7/722 G06F7/728

    Abstract: Methods and apparatus for optimization techniques for modular multiplication algorithms. The optimization techniques may be applied to variants of modular multiplication algorithms, including variants of Montgomery multiplication algorithms and Barrett multiplication algorithms. The optimization techniques reduce the number of serial steps in Montgomery reduction and Barrett reduction. Modular multiplication operations involving products of integer inputs A and B may be performed in parallel to obtain a value C that is reduced to a residual RES. Modular multiplication and modular reduction operations may be performed in parallel. The number of serial steps in the modular reductions are reduced to L, where L serial steps, where w is a digit size in bits, and L is a number of digits of operands=[k/w].

    GALOIS FIELD MULTIPLY REDUCTION AND PARALLEL HASH

    公开(公告)号:US20240028341A1

    公开(公告)日:2024-01-25

    申请号:US18375476

    申请日:2023-09-30

    CPC classification number: G06F9/3887 G06F9/3877

    Abstract: Examples described herein relate to a non-transitory computer-readable medium comprising instructions, that if executed by circuitry, cause the circuitry to: configure circuitry to perform cryptographic operations on packets based on Advanced Encryption Standard with Galois/Counter Mode (AES-GCM) hash (GHASH), wherein the cryptographic operations comprise a reduction operation and wherein the reduction operation comprises a single Galois territory multiplication 64 bit operation. The circuitry can include one or more of: a central processing unit (CPU), CPU-executed microcode, an accelerator, or a network interface device.

Patent Agency Ranking