Java Utililty Methods String Descrypt

List of utility methods to do String Descrypt

Description

The list of methods to do String Descrypt are organized into topic(s).

Method

byte[]decrypt(String str)
decrypt
StringBuffer sb = new StringBuffer();
byte[] data = str.getBytes("US-ASCII");
int len = data.length;
int i = 0;
int b1, b2, b3, b4;
while (i < len) {
    do {
        b1 = base64DecodeChars[data[i++]];
...
StringDecrypt(String str)
Decrypt
return encryStr("IBMExtract", Unicode2Str(str));
Stringdecrypt(String str)
Decrypts a string encrypted with encrypt.
if (str == null) {
    return null;
StringBuffer buf = new StringBuffer();
for (int i = 0; i < str.length(); i++) {
    buf.append(decrypt(str.charAt(i)));
return buf.toString();
...
Stringdecrypt(String str)
decrypt
return encrypt(encrypt(str));
Stringdecrypt(String string)
decrypt
char chars[] = string.toCharArray();
int len, i = 0;
for (len = chars.length; i < len; i++)
    chars[i] = (char) (~chars[i]);
return new String(chars);
Stringdecrypt(String string)
decrypt
char[] chars = string.toCharArray();
for (int i = 0; i < chars.length; i++) {
    chars[i] = decrypt(chars[i]);
String result = new String(chars);
return result;
intdecrypt2(byte[] arg0, int arg1, String arg2, byte arg3)
decrypt
int var17 = 0;
try {
    int var4 = arg1;
    int var5 = arg2.length();
    int var6 = 0;
    int var10000;
    while (true) {
        if (var5 > var6) {
...
byte[]decryptBytes(final byte[] b, final int i)
decrypt Bytes
byte temp;
int startKey = i * 12345;
int mulKey = startKey >>> 8;
int addKey = startKey >>> 16;
int j;
for (j = 0; j < b.length; j++) {
    temp = b[j];
    b[j] = (byte) (b[j] ^ (startKey >>> 8));
...
chardecryptChar(String pwd, int offset, int pos)
decrypt Char
int xor = ENCRYPTION[offset % ENCRYPTION.length];
char c1 = pwd.charAt(pos);
char c2 = pwd.charAt(pos + 1);
char c = (char) (((c1 - (int) 'A') * 16 + (c2 - (int) 'A')) ^ xor);
return c;
chardecryptCharcode(char c, int start, int end, int offset)
decrypt Charcode
int n = (int) c;
n = n + offset;
if (offset > 0 && n > end) {
    n = start + (n - end - 1);
} else if (offset < 0 && n < start) {
    n = end - (start - n - 1);
return (char) n;
...