L7 wrote: > Easy to guess is relative. > Actually, any mapping from int to int is an (equally) easy one to > guess. The encryption part would be to change the mapping on each int > or sequence of ints by a rotation or equation. > > int -> int ( '->' represents a map from one to another) > Provides 0xffff possibilities (decreases for each case unless > duplicates are permitted). > Once the map is found, brute force would actually be rather simple in > this case, it is static and the 'encryption' is broken. > > However, > int -> f(n) -> int (where f(n) is some function or rotation scheme) > is not static and even though the possibilities of each int are only > 0xffff, it changes to a different value each time. This means the even > locating one 'match' you could not use that to find another match for > the same number. (unless you actually derive the rotation/function > being used). > > Is this more clear?
yes, so and f(n) is good choice? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
