Re: Encryption for a log and Unicode Characters...? Yikes!

Tech-Archive recommends: Speed Up your PC by fixing your registry

If you just want something simple, it is easy to typecast characters to
integers and visa versa. You could use an algorithm like ROT13
(http://www.wikipedia.org/wiki/ROT13). If you want to use an algorithm
like that, character '0' is decimal 48, and 'z' is 122.

Loop through each character and get the integer, then add a value to
it, and convert back to a character.

int dec = (int)currentChar;
dec += 15;
if (dec > 122) dec -= 75;
newString += (char)dec;

That should confuse the "novices."

.

Relevant Pages

  • Re: Reading and writing a big file in Ada (GNAT) on Windows XP
    ... memory for a substring; this is very descriptively called memmemand ... common cases (no mapping, single character patterns, and so on). ... So in this case a better algorithm is probably the way to go (and I ... the source length is>M and the pattern length is>N, ...
    (comp.lang.ada)
  • Re: Regular Expression for validating a url field
    ... (Do not use the tab character for indentation, ... against a supposed string value, and since you do not do perform a strict ... If x is NaN, return false. ... `false' is returned to the calling algorithm, ...
    (comp.lang.javascript)
  • Re: Reading and writing a big file in Ada (GNAT) on Windows XP
    ... this kind to compile the 'needle' into some automaton which could skip ... If the automaton sees a character that is ... So in this case a better algorithm is probably the way to go (and I ... write your programs with a standard library routine, ...
    (comp.lang.ada)
  • Re: Paper & pencil password algorithm
    ... but I have to try to find an algorithm ... need for algorithmic passwords is rather great and increasingly urgent, ... I would look at bigger character sets and here are the results. ... There are other uses for these bases, 66 is good for a stream cipher, ...
    (sci.crypt)
  • Re: Question about bit strength
    ... Make good guesses about strength of an encryption soultion is not very ... The algorithms used to derive the key and for actual encryption process ... algorithm is at most equal to the number of steps needed to break it; ... method 2 using every character in the bit range bar the first 15. ...
    (sci.crypt)