OH - Pasión al código

This is the code...

These are the images of the week

CRYPTON INTRODUCTION The block cipher CRYPTON is designed based on the latter approach. In fact, its design is much influenced by SQUARE. CRYPTON processes each date blaock by representing into a 4x4 byte array as in SQUARE. The round trasformation of CRYPTON consists of four parallelizable steps: byte-wise sustitutions, column-wise bit permutation, column-to-row transposition, and then key addition. The encryption process invloves 12 repetitions of (essentially) the same round transformation. The decryption process can be made the same as the encryption process, except that diferrent subkeys are applied in each round. Figure 1 shows the high level structure of CRYPTON. The block cipher CRYPTON has the following features: 12-round self-reciprocal cipher with block length of 128 bits. Key lengths supported: 64 + 32k(0 <= k <= 6) bits(may allow any number of key lenght up to 256 bits). Identical process for encryption and decryption(with different subkeys). Strong se...

To this entry did WEB authentication with RSA, the algorithm. The language used was PHP with a MySQL database, what we do in relatively simple, but I was too complicated for me my little experience (very little) with PHP .   This code is the main page, which generates "x", choose your "user" and gives you access to a link which downloads a script with which to generate "r", also has a button to "validate" that tells if really you. (These authenticated).   Clarification when clicking the Generate button will show a value of "x" random, but the field will empty this is where I fail, you have to add the field to the "X" on hand. By clicking on Send you send a second window where you show your data are generated and whether or not you. Screenshot

For this post we have auntentificacion implentar the RSA in python for a client-server system with sockets.  entire theory about how the algorithm and definitions found in the biography. What I did was create a program in which you generate all the data and saves them in one. "dat" Here's how they communicate the client and server data is sent and if the key is the same time creates an "infinite connection" otherwise ends the program. Servidor.py cliente.py This entry was working with Rene Camacho. Referencias: RSA Algorithm Algoritmo de Euclides Extended Euclid's Algorithm criptografia asimetrica rsa rsa wolframalpha

For this week we play " Alice, Bob and Eve " the goal was for each person on your team had to go through one of them at least once, and try to find the numbers in that thought. As rules had to be small numbers so that we could make in pencil.

La entrada para esta semana era hacer un programa que evaluara si nuestras claves eran realmente random.   Pero ¿porque es importante saber si es realmente random? Bueno, unos de los problemas mas comunes en criptografía es que un mensaje se puede descubrir con ataques de frecuencia, haciendo este método nos aseguramos y hacemos que nos ataquen de otra forma mas complicada, en otras palabras, se las ponemos mas difícil. Existen como 8 pruebas (de lo que alcance a ver, checa el link de las referencias) para evaluar si tus números o caracteres son realmente random, en mi programa use la de prueba de frecuencia monobit; pero ¿cual es el propósito o como funciona esta prueba? El propósito de esta prueba, es determinar si el número de unos y ceros en una secuencia son aproximadamente la misma que sería de esperar para una secuencia verdaderamente aleatoria. La aparición de un cero o un uno en la secuencia debería ser igualmente probables, de modo que el defecto detectado por ...

Seguridad de la información y criptografía.