bigint-mod-arith icon indicating copy to clipboard operation
bigint-mod-arith copied to clipboard

Published 20 hours ago • verified publisher icon juanelas

the redPow implementation could be improved to O(logN)

Open cliff0412 opened this issue 1 year ago • 0 comments

the implementation of redPow is N multiplications. it could be optimised to O(logN) using an approach as detailed here https://en.algorithmica.org/hpc/number-theory/exponentiation/

cliff0412 avatar Dec 08 '23 06:12 cliff0412