Hello, this is a project that can handle large numbers, it can only deals with positive integer... But that's all you need to work with the RSA encryption... It does the math the same way we do it by hand (so it's quite slow compared to the Scratch math blocks but you can have 100 digits numbers long (or more)) ex: 101 + 69 = 100(1 + 0) + 10(0 + 6) + (1 + 9) = 100 + 60 + 10 = 170 /!\ the longuer the number, the longuer the computation time /! if you have a number that got a length greather than 10^15 the multiplication won't work anymore (but should not happen) To work with the RSA use the [modular power % % %] block, it's quite fast (if you can improve the division script or the modulo block it will be faster)
Everything by me... except some usefull tip to optimise by @Mooshroom-09 Credits if you want to use it... change log : - added the addition and substarction; - added the multiplication and comparaison; - added the division and modulus; - added the power; - added the modular power (really slow); - improve the division by 2 (to get the binary faster); - added the Karatsuba multiplication and improved the addition; - fixed the binary switch; - fixed the Karatsuba multiplication; - added bitwise and, or and xor; - improved the division by 2 (to get the binary faster);
