Anyone interested in finding the modular inverse of a number should check out my implementation of the Extended Euclidean Algorithm. Change ‘a’ and ‘b’ in the URL to find different inverses.
Anyone interested in finding the modular inverse of a number should check out my implementation of the Extended Euclidean Algorithm. Change ‘a’ and ‘b’ in the URL to find different inverses.
Thank you very much for this!
Cool stuff especially your trick of inputting (a,b) into the url. Some time back I tried to figure out how to calculate the multiplicative inverse of each individual byte in GF(2^8) without success any ideas?