cryptography - Big List Python for Charm-Crypto group element -


while working charm-crypto package, need lots , lots of group element exponentiation. group elements come bi-linear pairing group. order of group element 1024 bit integer. reduce average cost of exponentiation, wanted use memoization.

but came know list not support long indices (which need much). went dictionary taking lot of time & space.

could suggest other methods/data structure in python reduce exponentiation cost. using iterative square-multiply technique exponentiation.


Comments

Popular posts from this blog

python - mat is not a numerical tuple : openCV error -

c# - MSAA finds controls UI Automation doesn't -

wordpress - .htaccess: RewriteRule: bad flag delimiters -