Comment has been collapsed.
Off hand, no. But it looks like you want the inverse of the modulo function. Maybe you can search out some information on that. If you can provide a bit more info on what's known and unknown in that formula, since there are three variables (a,k,n), that might help a little bit in figuring it out.
Comment has been collapsed.
Hmm, if it's doing what I think it's doing (namely shifting an alphabet, a
, by k
and cycling around the alphabet size n
) then the following should work to reverse it:
f(a) = ((a + n) - (k mod n)) mod n
Shifting forwards by the size of the alphabet to prevent values of a
from going negative when shifted backwards (which would make using mod n
to constrain it to the bounds of the alphabet size not work), then shifting it backwards by a value k
constrained to the alphabet size (to again prevent it going negative), and then using mod n to constrain the end result to the alphabet size.
This may not be the most efficient or concise way of doing it, but if I've interpreted correctly, I think it should work for what you are doing.
Comment has been collapsed.
28 Comments - Last post 13 minutes ago by Chris76de
271 Comments - Last post 1 hour ago by DragRedSim
338 Comments - Last post 1 hour ago by DragRedSim
21 Comments - Last post 1 hour ago by Chris76de
16,496 Comments - Last post 3 hours ago by Channel28
78 Comments - Last post 4 hours ago by Guard1aNRB
960 Comments - Last post 5 hours ago by Axelflox
70 Comments - Last post 17 minutes ago by 86maylin
83 Comments - Last post 31 minutes ago by ShroudOfLethe
17,211 Comments - Last post 49 minutes ago by GeekDoesStuff
1,256 Comments - Last post 57 minutes ago by MouseWithBeer
18 Comments - Last post 1 hour ago by thoughtfulhippo
51 Comments - Last post 1 hour ago by MouseWithBeer
74 Comments - Last post 2 hours ago by MarvashMagalli
f(a)=(a+k) mod n
Anybody know how to reverse it?
Comment has been collapsed.