Skip to content

A recursive modular reduction of mine, that only uses powers of 2 division and modulus calculation.

License

Notifications You must be signed in to change notification settings

fbv81bp/Another_mod

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This morning I tried to understand the Montgomery modular reduction algorithm. Frankly put: I still don't succeed. But I invented this recursive modular division algorithm, that solely uses division and modulus of two's next power, while furthermore only multiplication and subtraction. It's likely vast weakness again't Montgomery's solution must lie in the indefinite runtime, that may very well be characteristic to the numbers being crunched and thus leak information if applied for cryptography in form of a side channel... :/

Then I found out it can easily be described in a loop too.

testing.txt is the output of loop_mod.py: it wasn't easy to find a test case, where the subtraction in the end needs to be performed.

About

A recursive modular reduction of mine, that only uses powers of 2 division and modulus calculation.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages