US 12,079,594 B2
Fast precomputation for Montgomery multiplier
Adir Zevulun, Beer Sheva (IL); Uria Basher, Ganei Tal (IL); Nir Shmuel, Bet Shemesh (IL); and Ben Witulski, Tel Aviv (IL)
Assigned to MELLANOX TECHNOLOGIES, LTD., Yokneam (IL)
Filed by Mellanox Technologies, Ltd., Yokneam (IL)
Filed on Feb. 22, 2021, as Appl. No. 17/180,999.
Prior Publication US 2022/0269488 A1, Aug. 25, 2022
Int. Cl. G06F 7/72 (2006.01); G06F 21/60 (2013.01)
CPC G06F 7/728 (2013.01) [G06F 21/602 (2013.01)] 14 Claims
OG exemplary drawing
 
1. A Montgomery pre-compute circuit, comprising a carry-save-adder (CSA), a sum-shifter and a carry-shifter, which are to compute a Montgomery pre-compute value for a Montgomery multiplication operation by performing a series of iterations, wherein, in a given iteration in the series:
the CSA is to produce a sum-output and a carry-output; and
the sum-shifter and the carry-shifter are to left-shift the sum-output and the carry-output, respectively, and to feed-back the left-shifted sum-output and the left-shifted carry-output to respective inputs of the CSA.