Discussion :

[steph68b]

Hello!

J'ai répondu à ce post pour essayer de filer un coup de main:

http://www.developpez.net/forums/d83...n/#post6948666

Pour moi codage/décodage fonctionnent.

Par contre, maintenant se pose le problème du stockage dans une base sqlite android:

-> quel doit être le type du champs de la table?

Une idée peut être?

J'ai déjà essayer de passer ma table de (string param, string valeur) à (string param, integer valeur) vu que le but est de stocker un byte, mais j'ai tjs la même exception.......

Et rien trouvé en ligne non plus, mais il faut dire que les critères de recherches sont super génériques et ramène 12M de pages.

Merci.

[hotcryx]

passer par des méthodes encrypt/decrypt c'est facilement piratable avec le pwd.

Il y a le projet sqlcipher mais ne suis pas encore parvenu à le faire fonctionner

Je ne connais pas ton programme mais un byte c'est un entier => INTEGER

Edit: mais pour en stocker plusieurs, ça ne va pas le faire (hum) => TEXT du style 50 51 66 32 ... ou en hexa.

[nicroman]

Si le but est de stocker un tableau de byte, il y a les BLOB, mais pour plus de simplicité il vaut parfois mieux passer par un VARCHAR avec les données encodées (base64, UU, ...)

[steph68b]

C'est effectivement ce que j'ai fini par faire oui.

J'ai posté "ma" solution sur l'autre post, tu peux y jeter un oeil et me dire ce que tu en penses STP?

[steph68b]

Bon là je nage en plein *****!!
Y a-t-il plusieurs algo 3DES?

Coté Android, aucun problème codage/décodage..... mais quand j'envoie des tests au serveur Php, ça me donne n'importe quoi!

Je poste mes fct Android & Java parce que je n'ai plus la moindre idée!

ANDROID 3DES

Code :

Sélectionner tout - Visualiser dans une fenêtre à part

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
import java.security.MessageDigest;
import java.util.Arrays;
 
import javax.crypto.Cipher;
import javax.crypto.SecretKey;
import javax.crypto.spec.IvParameterSpec;
import javax.crypto.spec.SecretKeySpec;
 
public class Cryptage3DES 
{
    private static final String CONST_PASSWORD = "toto";
 
 
    public static byte[] encrypt(String message) throws Exception 
    {
        final MessageDigest md = MessageDigest.getInstance("md5");
        final byte[] digestOfPassword = md.digest(CONST_PASSWORD.getBytes("utf-8"));
        final byte[] keyBytes = Arrays.copyOf(digestOfPassword, 24);
 
        for (int j = 0, k = 16; j < 8;) 
        	{ keyBytes[k++] = keyBytes[j++]; }
 
        final SecretKey key = new SecretKeySpec(keyBytes, "DESede");
        final IvParameterSpec iv = new IvParameterSpec(new byte[8]);
        final Cipher cipher = Cipher.getInstance("DESede/CBC/PKCS5Padding");
 
        cipher.init(Cipher.ENCRYPT_MODE, key, iv);
 
        final byte[] plainTextBytes = message.getBytes("utf-8");
        final byte[] cipherText = cipher.doFinal(plainTextBytes);
 
        return cipherText;
    }
 
    public static String decrypt(byte[] message) throws Exception 
    {
        final MessageDigest md = MessageDigest.getInstance("md5");
        final byte[] digestOfPassword = md.digest(CONST_PASSWORD.getBytes("utf-8"));
        final byte[] keyBytes = Arrays.copyOf(digestOfPassword, 24);
 
        for (int j = 0, k = 16; j < 8;) 
        	{ keyBytes[k++] = keyBytes[j++]; }
 
        final SecretKey key = new SecretKeySpec(keyBytes, "DESede");
        final IvParameterSpec iv = new IvParameterSpec(new byte[8]);
        final Cipher decipher = Cipher.getInstance("DESede/CBC/PKCS5Padding");
 
        decipher.init(Cipher.DECRYPT_MODE, key, iv);
 
        final byte[] plainText = decipher.doFinal(message);
 
        return new String(plainText, "UTF-8");
    }
 
}

ANDROID BASE64

Code :

Sélectionner tout - Visualiser dans une fenêtre à part

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
public class Base64
{
	private static final char[] CA = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".toCharArray();
	private static final int[] IA = new int[256];
	static {
		Arrays.fill(IA, -1);
		for (int i = 0, iS = CA.length; i < iS; i++)
			IA[CA[i]] = i;
		IA['='] = 0;
	}
 
	// ****************************************************************************************
	// *  char[] version
	// ****************************************************************************************
 
	/** Encodes a raw byte array into a BASE64 <code>char[]</code> representation i accordance with RFC 2045.
         * @param sArr The bytes to convert. If <code>null</code> or length 0 an empty array will be returned.
         * @param lineSep Optional "\r\n" after 76 characters, unless end of file.<br>
         * No line separator will be in breach of RFC 2045 which specifies max 76 per line but will be a
         * little faster.
         * @return A BASE64 encoded array. Never <code>null</code>.
         */
	public final static char[] encodeToChar(byte[] sArr, boolean lineSep)
	{
		// Check special case
		int sLen = sArr != null ? sArr.length : 0;
		if (sLen == 0)
			return new char[0];
 
		int eLen = (sLen / 3) * 3;              // Length of even 24-bits.
		int cCnt = ((sLen - 1) / 3 + 1) << 2;   // Returned character count
		int dLen = cCnt + (lineSep ? (cCnt - 1) / 76 << 1 : 0); // Length of returned array
		char[] dArr = new char[dLen];
 
		// Encode even 24-bits
		for (int s = 0, d = 0, cc = 0; s < eLen;) {
			// Copy next three bytes into lower 24 bits of int, paying attension to sign.
			int i = (sArr[s++] & 0xff) << 16 | (sArr[s++] & 0xff) << 8 | (sArr[s++] & 0xff);
 
			// Encode the int into four chars
			dArr[d++] = CA[(i >>> 18) & 0x3f];
			dArr[d++] = CA[(i >>> 12) & 0x3f];
			dArr[d++] = CA[(i >>> 6) & 0x3f];
			dArr[d++] = CA[i & 0x3f];
 
			// Add optional line separator
			if (lineSep && ++cc == 19 && d < dLen - 2) {
				dArr[d++] = '\r';
				dArr[d++] = '\n';
				cc = 0;
			}
		}
 
		// Pad and encode last bits if source isn't even 24 bits.
		int left = sLen - eLen; // 0 - 2.
		if (left > 0) {
			// Prepare the int
			int i = ((sArr[eLen] & 0xff) << 10) | (left == 2 ? ((sArr[sLen - 1] & 0xff) << 2) : 0);
 
			// Set last four chars
			dArr[dLen - 4] = CA[i >> 12];
			dArr[dLen - 3] = CA[(i >>> 6) & 0x3f];
			dArr[dLen - 2] = left == 2 ? CA[i & 0x3f] : '=';
			dArr[dLen - 1] = '=';
		}
		return dArr;
	}
 
	/** Decodes a BASE64 encoded char array. All illegal characters will be ignored and can handle both arrays with
         * and without line separators.
         * @param sArr The source array. <code>null</code> or length 0 will return an empty array.
         * @return The decoded array of bytes. May be of length 0. Will be <code>null</code> if the legal characters
         * (including '=') isn't divideable by 4.  (I.e. definitely corrupted).
         */
	public final static byte[] decode(char[] sArr)
	{
		// Check special case
		int sLen = sArr != null ? sArr.length : 0;
		if (sLen == 0)
			return new byte[0];
 
		// Count illegal characters (including '\r', '\n') to know what size the returned array will be,
		// so we don't have to reallocate & copy it later.
		int sepCnt = 0; // Number of separator characters. (Actually illegal characters, but that's a bonus...)
		for (int i = 0; i < sLen; i++)  // If input is "pure" (I.e. no line separators or illegal chars) base64 this loop can be commented out.
			if (IA[sArr[i]] < 0)
				sepCnt++;
 
		// Check so that legal chars (including '=') are evenly divideable by 4 as specified in RFC 2045.
		if ((sLen - sepCnt) % 4 != 0)
			return null;
 
		int pad = 0;
		for (int i = sLen; i > 1 && IA[sArr[--i]] <= 0;)
			if (sArr[i] == '=')
				pad++;
 
		int len = ((sLen - sepCnt) * 6 >> 3) - pad;
 
		byte[] dArr = new byte[len];       // Preallocate byte[] of exact length
 
		for (int s = 0, d = 0; d < len;) {
			// Assemble three bytes into an int from four "valid" characters.
			int i = 0;
			for (int j = 0; j < 4; j++) {   // j only increased if a valid char was found.
				int c = IA[sArr[s++]];
				if (c >= 0)
				    i |= c << (18 - j * 6);
				else
					j--;
			}
			// Add the bytes
			dArr[d++] = (byte) (i >> 16);
			if (d < len) {
				dArr[d++]= (byte) (i >> 8);
				if (d < len)
					dArr[d++] = (byte) i;
			}
		}
		return dArr;
	}
 
	/** Decodes a BASE64 encoded char array that is known to be resonably well formatted. The method is about twice as
         * fast as {@link #decode(char[])}. The preconditions are:<br>
         * + The array must have a line length of 76 chars OR no line separators at all (one line).<br>
         * + Line separator must be "\r\n", as specified in RFC 2045
         * + The array must not contain illegal characters within the encoded string<br>
         * + The array CAN have illegal characters at the beginning and end, those will be dealt with appropriately.<br>
         * @param sArr The source array. Length 0 will return an empty array. <code>null</code> will throw an exception.
         * @return The decoded array of bytes. May be of length 0.
         */
	public final static byte[] decodeFast(char[] sArr)
	{
		// Check special case
		int sLen = sArr.length;
		if (sLen == 0)
			return new byte[0];
 
		int sIx = 0, eIx = sLen - 1;    // Start and end index after trimming.
 
		// Trim illegal chars from start
		while (sIx < eIx && IA[sArr[sIx]] < 0)
			sIx++;
 
		// Trim illegal chars from end
		while (eIx > 0 && IA[sArr[eIx]] < 0)
			eIx--;
 
		// get the padding count (=) (0, 1 or 2)
		int pad = sArr[eIx] == '=' ? (sArr[eIx - 1] == '=' ? 2 : 1) : 0;  // Count '=' at end.
		int cCnt = eIx - sIx + 1;   // Content count including possible separators
		int sepCnt = sLen > 76 ? (sArr[76] == '\r' ? cCnt / 78 : 0) << 1 : 0;
 
		int len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded bytes
		byte[] dArr = new byte[len];       // Preallocate byte[] of exact length
 
		// Decode all but the last 0 - 2 bytes.
		int d = 0;
		for (int cc = 0, eLen = (len / 3) * 3; d < eLen;) {
			// Assemble three bytes into an int from four "valid" characters.
			int i = IA[sArr[sIx++]] << 18 | IA[sArr[sIx++]] << 12 | IA[sArr[sIx++]] << 6 | IA[sArr[sIx++]];
 
			// Add the bytes
			dArr[d++] = (byte) (i >> 16);
			dArr[d++] = (byte) (i >> 8);
			dArr[d++] = (byte) i;
 
			// If line separator, jump over it.
			if (sepCnt > 0 && ++cc == 19) {
				sIx += 2;
				cc = 0;
			}
		}
 
		if (d < len) {
			// Decode last 1-3 bytes (incl '=') into 1-3 bytes
			int i = 0;
			for (int j = 0; sIx <= eIx - pad; j++)
				i |= IA[sArr[sIx++]] << (18 - j * 6);
 
			for (int r = 16; d < len; r -= 8)
				dArr[d++] = (byte) (i >> r);
		}
 
		return dArr;
	}
 
	// ****************************************************************************************
	// *  byte[] version
	// ****************************************************************************************
 
	/** Encodes a raw byte array into a BASE64 <code>byte[]</code> representation i accordance with RFC 2045.
         * @param sArr The bytes to convert. If <code>null</code> or length 0 an empty array will be returned.
         * @param lineSep Optional "\r\n" after 76 characters, unless end of file.<br>
         * No line separator will be in breach of RFC 2045 which specifies max 76 per line but will be a
         * little faster.
         * @return A BASE64 encoded array. Never <code>null</code>.
         */
	public final static byte[] encodeToByte(byte[] sArr, boolean lineSep)
	{
		// Check special case
		int sLen = sArr != null ? sArr.length : 0;
		if (sLen == 0)
			return new byte[0];
 
		int eLen = (sLen / 3) * 3;                              // Length of even 24-bits.
		int cCnt = ((sLen - 1) / 3 + 1) << 2;                   // Returned character count
		int dLen = cCnt + (lineSep ? (cCnt - 1) / 76 << 1 : 0); // Length of returned array
		byte[] dArr = new byte[dLen];
 
		// Encode even 24-bits
		for (int s = 0, d = 0, cc = 0; s < eLen;) {
			// Copy next three bytes into lower 24 bits of int, paying attension to sign.
			int i = (sArr[s++] & 0xff) << 16 | (sArr[s++] & 0xff) << 8 | (sArr[s++] & 0xff);
 
			// Encode the int into four chars
			dArr[d++] = (byte) CA[(i >>> 18) & 0x3f];
			dArr[d++] = (byte) CA[(i >>> 12) & 0x3f];
			dArr[d++] = (byte) CA[(i >>> 6) & 0x3f];
			dArr[d++] = (byte) CA[i & 0x3f];
 
			// Add optional line separator
			if (lineSep && ++cc == 19 && d < dLen - 2) {
				dArr[d++] = '\r';
				dArr[d++] = '\n';
				cc = 0;
			}
		}
 
		// Pad and encode last bits if source isn't an even 24 bits.
		int left = sLen - eLen; // 0 - 2.
		if (left > 0) {
			// Prepare the int
			int i = ((sArr[eLen] & 0xff) << 10) | (left == 2 ? ((sArr[sLen - 1] & 0xff) << 2) : 0);
 
			// Set last four chars
			dArr[dLen - 4] = (byte) CA[i >> 12];
			dArr[dLen - 3] = (byte) CA[(i >>> 6) & 0x3f];
			dArr[dLen - 2] = left == 2 ? (byte) CA[i & 0x3f] : (byte) '=';
			dArr[dLen - 1] = '=';
		}
		return dArr;
	}
 
	/** Decodes a BASE64 encoded byte array. All illegal characters will be ignored and can handle both arrays with
         * and without line separators.
         * @param sArr The source array. Length 0 will return an empty array. <code>null</code> will throw an exception.
         * @return The decoded array of bytes. May be of length 0. Will be <code>null</code> if the legal characters
         * (including '=') isn't divideable by 4. (I.e. definitely corrupted).
         */
	public final static byte[] decode(byte[] sArr)
	{
		// Check special case
		int sLen = sArr.length;
 
		// Count illegal characters (including '\r', '\n') to know what size the returned array will be,
		// so we don't have to reallocate & copy it later.
		int sepCnt = 0; // Number of separator characters. (Actually illegal characters, but that's a bonus...)
		for (int i = 0; i < sLen; i++)      // If input is "pure" (I.e. no line separators or illegal chars) base64 this loop can be commented out.
			if (IA[sArr[i] & 0xff] < 0)
				sepCnt++;
 
		// Check so that legal chars (including '=') are evenly divideable by 4 as specified in RFC 2045.
		if ((sLen - sepCnt) % 4 != 0)
			return null;
 
		int pad = 0;
		for (int i = sLen; i > 1 && IA[sArr[--i] & 0xff] <= 0;)
			if (sArr[i] == '=')
				pad++;
 
		int len = ((sLen - sepCnt) * 6 >> 3) - pad;
 
		byte[] dArr = new byte[len];       // Preallocate byte[] of exact length
 
		for (int s = 0, d = 0; d < len;) {
			// Assemble three bytes into an int from four "valid" characters.
			int i = 0;
			for (int j = 0; j < 4; j++) {   // j only increased if a valid char was found.
				int c = IA[sArr[s++] & 0xff];
				if (c >= 0)
				    i |= c << (18 - j * 6);
				else
					j--;
			}
 
			// Add the bytes
			dArr[d++] = (byte) (i >> 16);
			if (d < len) {
				dArr[d++]= (byte) (i >> 8);
				if (d < len)
					dArr[d++] = (byte) i;
			}
		}
 
		return dArr;
	}
 
 
	/** Decodes a BASE64 encoded byte array that is known to be resonably well formatted. The method is about twice as
         * fast as {@link #decode(byte[])}. The preconditions are:<br>
         * + The array must have a line length of 76 chars OR no line separators at all (one line).<br>
         * + Line separator must be "\r\n", as specified in RFC 2045
         * + The array must not contain illegal characters within the encoded string<br>
         * + The array CAN have illegal characters at the beginning and end, those will be dealt with appropriately.<br>
         * @param sArr The source array. Length 0 will return an empty array. <code>null</code> will throw an exception.
         * @return The decoded array of bytes. May be of length 0.
         */
	public final static byte[] decodeFast(byte[] sArr)
	{
		// Check special case
		int sLen = sArr.length;
		if (sLen == 0)
			return new byte[0];
 
		int sIx = 0, eIx = sLen - 1;    // Start and end index after trimming.
 
		// Trim illegal chars from start
		while (sIx < eIx && IA[sArr[sIx] & 0xff] < 0)
			sIx++;
 
		// Trim illegal chars from end
		while (eIx > 0 && IA[sArr[eIx] & 0xff] < 0)
			eIx--;
 
		// get the padding count (=) (0, 1 or 2)
		int pad = sArr[eIx] == '=' ? (sArr[eIx - 1] == '=' ? 2 : 1) : 0;  // Count '=' at end.
		int cCnt = eIx - sIx + 1;   // Content count including possible separators
		int sepCnt = sLen > 76 ? (sArr[76] == '\r' ? cCnt / 78 : 0) << 1 : 0;
 
		int len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded bytes
		byte[] dArr = new byte[len];       // Preallocate byte[] of exact length
 
		// Decode all but the last 0 - 2 bytes.
		int d = 0;
		for (int cc = 0, eLen = (len / 3) * 3; d < eLen;) {
			// Assemble three bytes into an int from four "valid" characters.
			int i = IA[sArr[sIx++]] << 18 | IA[sArr[sIx++]] << 12 | IA[sArr[sIx++]] << 6 | IA[sArr[sIx++]];
 
			// Add the bytes
			dArr[d++] = (byte) (i >> 16);
			dArr[d++] = (byte) (i >> 8);
			dArr[d++] = (byte) i;
 
			// If line separator, jump over it.
			if (sepCnt > 0 && ++cc == 19) {
				sIx += 2;
				cc = 0;
			}
		}
 
		if (d < len) {
			// Decode last 1-3 bytes (incl '=') into 1-3 bytes
			int i = 0;
			for (int j = 0; sIx <= eIx - pad; j++)
				i |= IA[sArr[sIx++]] << (18 - j * 6);
 
			for (int r = 16; d < len; r -= 8)
				dArr[d++] = (byte) (i >> r);
		}
 
		return dArr;
	}
 
	// ****************************************************************************************
	// * String version
	// ****************************************************************************************
 
	/** Encodes a raw byte array into a BASE64 <code>String</code> representation i accordance with RFC 2045.
         * @param sArr The bytes to convert. If <code>null</code> or length 0 an empty array will be returned.
         * @param lineSep Optional "\r\n" after 76 characters, unless end of file.<br>
         * No line separator will be in breach of RFC 2045 which specifies max 76 per line but will be a
         * little faster.
         * @return A BASE64 encoded array. Never <code>null</code>.
         */
	public final static String encodeToString(byte[] sArr, boolean lineSep)
	{
		// Reuse char[] since we can't create a String incrementally anyway and StringBuffer/Builder would be slower.
		return new String(encodeToChar(sArr, lineSep));
	}
 
	/** Decodes a BASE64 encoded <code>String</code>. All illegal characters will be ignored and can handle both strings with
         * and without line separators.<br>
         * <b>Note!</b> It can be up to about 2x the speed to call <code>decode(str.toCharArray())</code> instead. That
         * will create a temporary array though. This version will use <code>str.charAt(i)</code> to iterate the string.
         * @param str The source string. <code>null</code> or length 0 will return an empty array.
         * @return The decoded array of bytes. May be of length 0. Will be <code>null</code> if the legal characters
         * (including '=') isn't divideable by 4.  (I.e. definitely corrupted).
         */
	public final static byte[] decode(String str)
	{
		// Check special case
		int sLen = str != null ? str.length() : 0;
		if (sLen == 0)
			return new byte[0];
 
		// Count illegal characters (including '\r', '\n') to know what size the returned array will be,
		// so we don't have to reallocate & copy it later.
		int sepCnt = 0; // Number of separator characters. (Actually illegal characters, but that's a bonus...)
		for (int i = 0; i < sLen; i++)  // If input is "pure" (I.e. no line separators or illegal chars) base64 this loop can be commented out.
			if (IA[str.charAt(i)] < 0)
				sepCnt++;
 
		// Check so that legal chars (including '=') are evenly divideable by 4 as specified in RFC 2045.
		if ((sLen - sepCnt) % 4 != 0)
			return null;
 
		// Count '=' at end
		int pad = 0;
		for (int i = sLen; i > 1 && IA[str.charAt(--i)] <= 0;)
			if (str.charAt(i) == '=')
				pad++;
 
		int len = ((sLen - sepCnt) * 6 >> 3) - pad;
 
		byte[] dArr = new byte[len];       // Preallocate byte[] of exact length
 
		for (int s = 0, d = 0; d < len;) {
			// Assemble three bytes into an int from four "valid" characters.
			int i = 0;
			for (int j = 0; j < 4; j++) {   // j only increased if a valid char was found.
				int c = IA[str.charAt(s++)];
				if (c >= 0)
				    i |= c << (18 - j * 6);
				else
					j--;
			}
			// Add the bytes
			dArr[d++] = (byte) (i >> 16);
			if (d < len) {
				dArr[d++]= (byte) (i >> 8);
				if (d < len)
					dArr[d++] = (byte) i;
			}
		}
		return dArr;
	}
 
	/** Decodes a BASE64 encoded string that is known to be resonably well formatted. The method is about twice as
         * fast as {@link #decode(String)}. The preconditions are:<br>
         * + The array must have a line length of 76 chars OR no line separators at all (one line).<br>
         * + Line separator must be "\r\n", as specified in RFC 2045
         * + The array must not contain illegal characters within the encoded string<br>
         * + The array CAN have illegal characters at the beginning and end, those will be dealt with appropriately.<br>
         * @param s The source string. Length 0 will return an empty array. <code>null</code> will throw an exception.
         * @return The decoded array of bytes. May be of length 0.
         */
	public final static byte[] decodeFast(String s)
	{
		// Check special case
		int sLen = s.length();
		if (sLen == 0)
			return new byte[0];
 
		int sIx = 0, eIx = sLen - 1;    // Start and end index after trimming.
 
		// Trim illegal chars from start
		while (sIx < eIx && IA[s.charAt(sIx) & 0xff] < 0)
			sIx++;
 
		// Trim illegal chars from end
		while (eIx > 0 && IA[s.charAt(eIx) & 0xff] < 0)
			eIx--;
 
		// get the padding count (=) (0, 1 or 2)
		int pad = s.charAt(eIx) == '=' ? (s.charAt(eIx - 1) == '=' ? 2 : 1) : 0;  // Count '=' at end.
		int cCnt = eIx - sIx + 1;   // Content count including possible separators
		int sepCnt = sLen > 76 ? (s.charAt(76) == '\r' ? cCnt / 78 : 0) << 1 : 0;
 
		int len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded bytes
		byte[] dArr = new byte[len];       // Preallocate byte[] of exact length
 
		// Decode all but the last 0 - 2 bytes.
		int d = 0;
		for (int cc = 0, eLen = (len / 3) * 3; d < eLen;) {
			// Assemble three bytes into an int from four "valid" characters.
			int i = IA[s.charAt(sIx++)] << 18 | IA[s.charAt(sIx++)] << 12 | IA[s.charAt(sIx++)] << 6 | IA[s.charAt(sIx++)];
 
			// Add the bytes
			dArr[d++] = (byte) (i >> 16);
			dArr[d++] = (byte) (i >> 8);
			dArr[d++] = (byte) i;
 
			// If line separator, jump over it.
			if (sepCnt > 0 && ++cc == 19) {
				sIx += 2;
				cc = 0;
			}
		}
 
		if (d < len) {
			// Decode last 1-3 bytes (incl '=') into 1-3 bytes
			int i = 0;
			for (int j = 0; sIx <= eIx - pad; j++)
				i |= IA[s.charAt(sIx++)] << (18 - j * 6);
 
			for (int r = 16; d < len; r -= 8)
				dArr[d++] = (byte) (i >> r);
		}
 
		return dArr;
	}
}

ANDROID fcts cryptage/décryptage

Code :

Sélectionner tout - Visualiser dans une fenêtre à part

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
 
        //RETOURNE la chaine cryptée / NULL si erreur
	//*********************************
	public static String cryptage3DES(String s)
	{
		byte[] codedtext = null;
 
		//Log.d("**** CRYPTAGE entrée","("+s+")");
 
		//crypter la chaine en 3DES
		try 
		{
			codedtext = Cryptage3DES.encrypt(s);
			Log.d("**** CRYPTAGE valeur 3DES","("+codedtext+")");	
		} 
		catch (Exception e) 
		{
			e.printStackTrace();
			return null;
		}
 
		//l'encoder en B64
		return Base64.encodeToString(codedtext, true);
		//Log.d("**** CRYPTAGE valeur B64","("+svaleur64+")");
	}
 
	//RETOURNE la chaine décryptée / NULL si erreur
	//***********************************
	public static String decryptage3DES(String s)
	{
		String decodedtext = null;
		byte [] valeur64 = null;
 
		//Log.d("**** DECRYPTAGE entrée","("+s+")");
 
		//décoder B64 pour avoir du 3DES
		valeur64 = Base64.decode(s);
		//Log.d("**** DECRYPTAGE valeur B64 décodée","("+valeur64+")");	
 
		//décrypter la valeur 3DES
		try 
		{
			decodedtext = Cryptage3DES.decrypt(valeur64);
			//Log.d("**** DECRYPTAGE valeur 3DES décodée","("+decodedtext+")");
			return decodedtext.toString();
		} 
		catch (Exception e) 
		{
			e.printStackTrace();
			return null;
		}	
	}

PHP fcts cryptage/décryptage faites par qq'un d'autre & utulisées

Code :

Sélectionner tout - Visualiser dans une fenêtre à part

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
function cryptage3DESPwd($chaine,$passwordCryptage)
{
  $retour="";
  $td = mcrypt_module_open (MCRYPT_TripleDES, "", MCRYPT_MODE_ECB, "");
  $iv = mcrypt_create_iv (mcrypt_enc_get_iv_size ($td), MCRYPT_RAND);
  mcrypt_generic_init ($td, $passwordCryptage, $iv);
  $encrypted_data = mcrypt_generic ($td, $chaine);
//  mcrypt_generic_end ($td);
  $retour=base64_encode($encrypted_data);
  mcrypt_generic_deinit($td);
  mcrypt_module_close($td);
  return($retour);
}
 
function decryptage3DESPwd($chaine,$passwordCryptage)
{
  $aDecrypter=base64_decode($chaine);
  $td = mcrypt_module_open (MCRYPT_TripleDES, "", MCRYPT_MODE_ECB, "");
  $iv = mcrypt_create_iv (mcrypt_enc_get_iv_size ($td), MCRYPT_RAND);
  mcrypt_generic_init ($td, $passwordCryptage, $iv);
  $decrypted_data = mdecrypt_generic ($td, $aDecrypter);
  mcrypt_generic_deinit($td);
  mcrypt_module_close($td);
  $decrypted_data=str_replace("\0","",$decrypted_data);
  return($decrypted_data);
}

Le décodage coté PHP me donne n'imp'...... et bien sûr le mot de passe est le même des 2 cotés!

D'où ma question, au départ, de plusieurs alog 3DES?

[steph68b]

Cogitations du jour:

JAVA:
-> final Cipher cipher = Cipher.getInstance("DESede/CBC/PKCS5Padding");

PHP:
-> $td = mcrypt_module_open (MCRYPT_TripleDES, "", MCRYPT_MODE_ECB, "");

On n'est donc déjà pas sur le même mode de cryptage... normal donc que ça déconne!

J'ai donc essayé plusieurs combinaisons pour mettre le même mode des 2 cotés, sans succès:

1.) modif coté Java
final Cipher cipher = Cipher.getInstance("DESede/CBC/PKCS5Padding");
+
$td = mcrypt_module_open (MCRYPT_TripleDES, "", MCRYPT_MODE_CBC, "");
= décryptage KO

2.) modif coté Java 2
final Cipher cipher = Cipher.getInstance("DESede/CBC/NoPadding");
+
$td = mcrypt_module_open (MCRYPT_TripleDES, "", MCRYPT_MODE_CBC, "");
= valeur Java null, donc KO

3.) modif coté Php
final Cipher cipher = Cipher.getInstance("DESede/CBC/PKCS5Padding");
+
$td = mcrypt_module_open (MCRYPT_TripleDES, "", MCRYPT_MODE_CBC, "");
= KO

Donc en gros, est ce que qq'un pourrait me donner les bons paramètres à mettre des deux cotés, ou à défaut pourquoi en mettant du CBC / EBC des 2 cotés ça ne passe tjs pas?

Comment spécifier un padding coté PHP?
Et pourquoi un cryptage NoPadding coté Java me génère 1 chaine null?

Bref, comment harmoniser les 2 cotés!

Merciiiiiiiiiiiiiiiiiiii!