Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


looking for fast modulo exponation code (386 compatible)

I looking for a fast modulo exponation code (RSA crypto). Something that use hardware multiply for exponation, montgomery's method for modulo division. It could be other methods if it's even faster.

I would like to implement it on a 386



  • Andre YoungAndre Young USAMember Posts: 0

    { } free ebooks and video tutorials about \ Go, JavaScript, C++, Python, R, PL/SQL, PHP, Delphi, C#, Java, Assembly, Scratch, MATLAB, Visual Basic .NET, Ruby, Objective-C, Perl, Swift, Visual Basic, C LabVIEW, Ada, Dart, Prolog, Logo, Lua, FoxPro, D, Awk, ML, Hack, Scala, Crystal, Erlang, Alice, Fortran, ABAP, Kotlin, Rust, Bash, Apex, SAS, Julia, Lisp, Clojure, COBOL, VBScript, Scheme, F#, Transact-SQL \ _

Sign In or Register to comment.