Programs to encripting picture

Well, here is the code to encrypt the message:

Code:

	import Image #library for use the picture
	archivoi = str(raw_input("nombre de la imagen con extencion: ")) ##take a picture
	imagen = Image.open(archivoi)
	archivom = str(raw_input("nombre del archivo del mensaje maximo 255 caracteres con extencion: ")) ##take a ## file of message
	archivo = open(archivom,"r")
	archivof = str(raw_input("Nombre final de la imagen extencion png: ")) ##take a final picture name
	#nlineas = 0
	mensaje = [] ##list for message
	#contador = 0
	conver = [] ##decimal list of message
	cont = 0 ##cont of conver
	sizem = 0 ##size for some utility
	#pixes = []
	ancho, altura = imagen.size ##dimension of picture
	#imagen2 = Image.new(imagen.mode, imagen.size)
	#f=open("nuevo.bmp","w")
	pixels = imagen.load() ##map of the picture
	contador = 0 ##cont for some utility
	#pixels2 = imagen2.load()
	#dis = 0
	tam = 0 ##cont for the algorithm
	#(r,g,b) = (0,0,0)
	#cont = 0 ##cont for the algorithm
	rgbb = 0 ##identify for some pixel
	identificador = 0 ##value for some caracter for message
	## variable's to save pixels for the algorithm
	a = 0
	b = 0
	c = 0
	## variable's save pixels for the algorithm
	letras = 0
	#recx = []
	#recy = []
	#recl = []
	##part to read message
	for i in archivo.xreadlines():
	dato = i
	mensaje.append(dato)
	cont = cont + len(dato)
	letras = letras + len(dato)
	sizem = len(mensaje) ##save the size of message
	##part to transform to messege at decimal format
	for i in range(sizem):
	size = len(mensaje[i])
	for j in range(size):
	conver.append(ord(mensaje[i][j]))
	#for x in range(ancho):
	# for y in range(altura):
	# pix = pixels[x,y]
	# pixes.append(pix)
	# contador = contador + 1
	#b = b + 1
	#a = a + 1
	####parameters for algoritm
	multi = ancho * altura ##calculate the area of picture in pixels
	##separar = multi/4 ##
	size = int(len(conver))##size of messege in decimal
	separacion = multi/size ##separation of the pixels
	#print "separacion 1",separacion,"multiplicacion :",multi,""
	indicador = 0 ##for some condicion
	alfa = 0 #for some condition
	constante = separacion/4 ##for the algorithm
	control = 0 ##for the algorithm
	#rlist = []
	#pas = 0
	#print "valor de separar:",separar
	cantidades = 0
	#print "altura:",altura,"ancho",ancho,""
	#print "separacion",separacion
	#print "constante: ",constante
	##algoritm
	##read all the map pixels
	for i in range(ancho):
	for j in range(altura):
	(a,b,c) = pixels[i,j] ##save the pixels in three variable
	if cantidades == 0: ## part to save to size of the message
	mod = c % 7 ## and used to the desencripted
	if mod == 1:
	r = size
	pixels[i,j] = (r,b,c) ##r hidden to size in this pixel
	cantidades = cantidades + 1 ##this condicion only one pass time
	#print "pase una sola vez: ",r
	#print "kugari: ",i,"lugar j",j,""
	#print "sixe: ",r
	else:
	if alfa < separacion:
	if cont > 0: ##if the messege have one more caracter
	identificador = conver[tam] ##save the caracter
	##what pixel we used if r or g or b
	if rgbb == 0:
	r = conver[tam] #save the caracter
	pixels[i,j] = (r,b,c) #hidden in the pixel
	tam = tam + 1 #plus for posterior comparation
	cont = cont - 1 ##reset the size of messege
	alfa = separacion
	#recx.append(i)
	#recy.append(j)
	#recl.append(rgbb)
	#print "i: ",i,"j",j,""
	if rgbb == 1: ##its the same the other only change the pixel
	g = conver[tam] ##now is b
	pixels[i,j] = (a,g,c)
	tam = tam + 1
	cont = cont - 1
	alfa = separacion
	#recx.append(i)
	#recy.append(j)
	#recl.append(rgbb)
	if rgbb == 2: ##its the same that others
	B = conver[tam]
	pixels[i,j] = (a,b,B)
	tam = tam + 1
	cont = cont - 1
	alfa = separacion
	#recx.append(i)
	#recy.append(j)
	#recl.append(rgbb)
	if control >= separacion: #used this for jumping pixels
	separacion = separacion + constante/2
	alfa = 0
	control = control + 1 ##for cont message caracter's
	##change the pixle r or g or c
	if rgbb == 0:
	rgbb = 1
	else:
	if rgbb == 1:
	rgbb = 2
	else:
	if rgbb ==2:
	rgbb = 0
	print "contrl",letras
	print "si se puso todos ?:",tam
	print ""
	#contador = 0
	imagen.save(archivof) ##save the new picture
	#print contador
	#print pixels[0,0]
	#print letras
	#print conver

view raw encript.py hosted with ❤ by GitHub

Code:


and this is the code to desencript message:

	##its de same algoritm the only diference its the start, the algoritm read the size
	##of messge of the picture and use the same algoritm to desencript
	import Image
	archivoi = str(raw_input("Nombre de la imagen a desifrar: "))
	imagen = Image.open(archivoi)
	pixel = imagen.load()
	ancho, altura = imagen.size
	mensaje = []
	contador = 0
	letra = 0
	a = 0
	b = 0
	c = 0
	size = 0
	multi = ancho * altura
	separacion = 0
	alfa = 0
	rgbb = 0
	tam = 0
	cont = 0
	control = 0
	constante = 0
	rgbb = 0
	i = 0
	j = 0
	r = 0
	g = 0
	b = 0
	for i in range(ancho):
	for j in range (altura):
	(a,b,c) = pixel[i,j]
	if contador == 0:
	mod = c % 7
	if mod == 1:
	size = a
	cont = int(size)
	multi = ancho * altura
	separacion = multi/cont
	constante = separacion/4
	print "pase una sola vez"
	print "size = ",cont
	#print "altura : ",altura,"ancho: ",ancho,"total: ",multi,""
	#print "separacio: ",separacion
	#print "constante :",constante
	contador = 2;
	else:
	if alfa < separacion:
	if cont > 0:
	if rgbb == 0:
	#(a,b,c) = pixel[i,j]
	mensaje.append(chr(a))
	tam = tam + 1
	cont = cont - 1
	alfa = separacion
	if rgbb == 1:
	#(a,b,c) = pixel[i,j]
	mensaje.append(chr(b))
	tam = tam + 1
	cont = cont - 1
	alfa = separacion
	if rgbb == 2:
	#(a,b,c) = pixel[i,j]
	mensaje.append(chr(c))
	tam = tam + 1
	cont = cont - 1
	alfa = separacion
	if control >= separacion:
	separacion = separacion + constante/2
	alfa = 0
	control = control + 1
	if rgbb == 0:
	rgbb = 1
	else:
	if rgbb == 1:
	rgbb = 2
	else:
	if rgbb == 2:
	rgbb = 0
	print "mi mensaje:",mensaje
	print "size del mensaje:",len(mensaje)

view raw desencrip.py hosted with ❤ by GitHub

Code:

The pictures to have a message is 2,5,6 of the before post

if we use the python program, this genereted the follow messege:

picture 5:

and the messege:

picture 6:

and the messege

thats all my folks

the images were uploaded to mediafire for blogger issues that can change the images

In the before post

The beggening hacking

Hello my friends and other people. This time i post some pictures and your try to find the message in tree of six picture

link to dowload the image:

http://www.mediafire.com/download.php?950rob1nw0xgzbu

Good luck!!!

Rabbit Cipher Stream

Rabbit Cipher Stream

What is the Rabbit algorithm ?

The Rabbit stream cipher works in a synchronous manner (never ending, always is in iteration) and was featured in Fast Software Encryption workshop in 2003

This algorithm can be described as follows:

Rabbit needs a key of 128 bits and also can use a (iv) 64-bit input which is used in the iterations in the algorithm
Iv = It is a starting vector for different types of cryptographic systems. This can generate a randomly.

Both encryption and decryption use the substitution method to generate our XOR'ed ciphertext. Where the internal state of the algorithm is 512-bit and 8 states are divided by 32 bits each. Different states vectors are modified during the execution of the algorithm.

Diagram of the algorithm

Rabbit algorithm description:

First step:  The key of 128 bits is genereted randomly and is divided into eight subkeys of 16 bits each and also the vector  "IV" 64-bit is genereted

Second step: Initializing a vector "x" and a counter vector "c" with eight elemts

Third step: This step can be skipped but is recommended. Use the substitution method Xor vector for each counter using vector "IV"

Fourth step: This step is the most important of all, the endless cycle begins to generate different outputs "S" and use them to our substitution method Plaintext.

Variable g is used to cycle the different values ​​of both counters as the vector x, and to generate new values ​​for the vector x and iterating using  "g" of the previous two iterations

Here the equations: 

Some terms from here:

"<<" Means that there is a tour of some bit to the left

">>" Means that there is a tour of some bit to the right

Fifth step: Subsequently, to get the specific output for each output interaction, the following equations are performed:

The implementation code:

	import random
	##variables para diferentes usos
	a = 0
	b = 0
	c = 0
	##variables para diferentes usos
	#y = random.randint(0,1)
	##llaves para algoritmo
	key = [] ##llave inicial 128 bits
	keym = [] ###Matriz de llaves
	iv = [] ##vector de inicieacion
	##llaves para algoritmo
	text = [] ##
	#c = [] ##vector de contadores
	#x = [] ##vector para iteraciones
	cont = 0
	#conti = 0
	#contf = 15
	fg = [] ##para realizar conversiones
	g = 0
	num = 0
	gf = [] ##para la variable g
	xf = [] ##vector de g
	s = []
	##128 bits llaves##
	for z in range(17):
	key.append(hex(random.randint(0,10)))
	##64 bits iv##
	for z in range(9):
	iv.append(hex(random.randint(0,10)))
	#def rotar16():
	#def rotar32():
	##iniceacion del vector x y vector c
	for j in range(8):
	x.append([])
	c.append([])
	num = j % 2
	if num == 0:
	a = bin(int((key[j]),16) + (1 % 8))[2:]
	x[j].append(str(""+a+""+bin(int((key[j]),16))[2:]+""))
	a = bin(int((key[j]),16) + (4 % 8))[2:]
	b = bin(int((key[j]),16) + (5 % 8))[2:]
	c[j].append(str(""+a+""+b+""))
	else:
	a = bin(int((key[j]),16) + (5 % 8))[2:]
	x[j].append(str(""+a+""+bin(int((key[j]),16))[2:]+""))
	a = bin(int((key[j]),16) + (1 % 8))[2:]
	b = bin(int((key[j]),16))[2:]
	c[j].append(str(""+b+""+a+""))
	#print "valor cadena 1 = ",str(bin(int(key[1],16)))
	#print "valor cadena 2 = ",str(bin(int(key[2],16)))
	#print "hex = ",hex(c[0][0])
	#print "int = ",int(str(bin(int(key[2],16)))[0])
	#a = 2
	#b = 0
	##iniceacion del vector x y c
	##funcion para obtener el valor de g
	def funcion(lugarx):
	size1 = 0
	size2 = 0
	a = 0
	g = 0
	pasado = 0
	actual = 0
	cambio = 0
	lista = []
	y = 0
	g = pow((int(x[lugarx][0],2) + int(c[lugarx][0],2)),2)
	size1 = len(str(bin(g)[2:]))
	cont = 0
	size1 = size1 - 1
	for y in range(size1 + 1):
	lista.append(str(bin(g)[2:])[y])
	size2 = len(lista)
	while cont <= size1:
	b = size1
	while a == 32:
	b = b + 1
	a = a + 1
	if b >= size1:
	b = 0
	a = 0
	#print "valor de cont",str(g)[cont]
	pasado = str(bin(g)[2:])[b]
	actual = str(bin(g)[2:])[cont]
	lista[b] = lista[cont]
	lista[cont] = pasado
	cont = cont + 1
	#print "valor dle contador=",cont
	cont = 0
	for cont in range(size1):
	if str(bin(g)[2:])[cont] == str(lista[cont]):
	fg[lugarx].append(str(0))
	else:
	fg[lugarx].append(str(1))
	cont = 0
	hahaha = 0
	size1 = len(fg[lugarx])
	valor = 0
	for cont in range(size1):
	#print cosa[ahaha]
	if fg[lugarx][cont] == '1':
	valor=2*valor+1
	size1 -=1
	else:
	valor=2*valor
	# apartida = partida + 1
	#partida = partida + 1
	return valor
	##funcion para obtener el valor de g
	##iteraccion del ciclo una vuelta completa
	for k in range(8):
	fg.append([])
	#algo = funcion(k)
	gf.append(funcion(k))
	#fg.append( )
	#print fg[0]
	resta = 0
	a = 0
	b = 0
	suma = 0
	for k in range(8):
	xf.append([])
	resta = k - 1
	if resta < 0:
	a = 8 + resta
	b = 8 + resta
	suma = gf[a] +gf[b] + gf[k]
	xf[k].append(str(suma))
	##iteraccion del ciclo una vuelta completa
	#print bin(int(xf[0]))
	#print xf[1]
	a = 0
	b = 5
	cont = 0
	binari1 = 0
	binario2 = 0
	##apartado para sacar las cadenas S en una vuela
	for k in range(8):
	s.append([])
	size1 = len(str(bin(int(xf[a][0]))[2:]))
	size2 = len(str(bin(int(xf[b][0]))[2:]))
	binario1 = str(bin(int(xf[a][0]))[2:])
	binario2 = str(bin(int(xf[b][0]))[2:])
	for j in range(16):
	if size2 <= j:
	if binario1[j] == '0':
	s[k].append(str(0))
	else:
	s[k].append(str(1))
	else:
	if size1 <= j:
	if binario2[j] == '0':
	s[k].append(str(0))
	else:
	s[k].append(str(1))
	else:
	if binario1[j] == binario2[j]:
	s[k].append(str(0))
	else:
	s[k].append(str(1))
	cont = cont + 1
	if cont == 2:
	a = a + 2
	cont = 0
	##apartado para sacar las cadenas S en una vuela
	##imprecion de las cadenas s
	for k in range (8):
	print "VAlor final : ",s[k]
	##imprecion de las cadenas s

view raw Rabbit.py hosted with ❤ by GitHub

Here is a picture of a first round generating 8 blocks of "Si"

And at the end, encrypt the message by the substitution method Xor through  "Si"vector of current image is shown in the dimensioned vector 8 outputs each other by different iterations is performed

This algorithm has different strengths and weaknesses:

One of the biggest advantages of this algorithm is the use of a 128-bit key that grabs one of the best sytems about execution speed, different blocks also constantly change. The attacks is  more difficult to perform in against a random key.

The strength is the  division of the keys in 8 to modify the state variables, for different types of attacks such as statistical and brute force


http://www3.iam.metu.edu.tr/iam/images/6/6a/Tarkanolcuogluterm.pdf
http://cr.yp.to/streamciphers/rabbit/desc.pdf
https://tools.ietf.org/html/rfc4503
http://reference.kfupm.edu.sa/content/r/a/rabbit__a_new_high_performance_stream_ci_66630.pdf
http://en.wikipedia.org/wiki/Initialization_vector

Block Cipher : Hierocrypt

Week 9

• 
  

Greats, This week we will be talking about: Block Cipher,  spcifically Hierocrypt.

This Hierocrypt have two many different fomrs with small differences:

1-. Hierocrypt-L1 

2-. Hierocrypt-3

                                  and was created by Toshiba in 2000.



These encryption algorithms were presented to the NESSIE project but were not selected, but  it is still highly recommended by the Japanese government used by CRYPTREC.

The differences between these two algorithms are:

The size of blocks: 64 bits vs 128 bits

The PlainText has to be the same size of the block

The size of keys: 128 bits vs 128, 192, or 256 bits.

 The number of rounds of encryption: 6.5 vs 6.5,7.5 or 8.5

The Hierocrypt-3 is more complex.

This Hierocrypt use a  substitution-permutation network structure.

This algorithm starts by transforming a 64-bit plaintext a function of X (64) then substitution is performed using a key by dividing the 64 bits into 8 blocks, and repeating the process of replacing in each of them.

Here the Diagrama:

 

This we can check in the following pdf: LINK

As mentioned above this algorithm uses 6 permutations to encrypt the message. And in each of the permutations do exactly the same.

Here the process of each permutation:

1-. The X(64) if is the first permutation is the same of Plain text. After this, Use the substitution method Xor and divide those 64 bits into small blocks of 8 bits.

2-. Each S-box will be used and the 64 bits will be separated in two blocks of 32 bits.

3-. Then a function is perfomed tocause slight diffusion so that is harder to detect patterns of sequence.  

4-. We use two  32-bits keys for the Xor substitution method and also We merge the 64-bit.

5-. With this input. We repeat step 1

6-. After that,  we perform a function that cause strongest diffusion so that is harder to detect patterns in the sequence, and we created a matrix of 2x2. then marge the 64-bit. 

7-. This output X (64) is the new entry in the next permutation.

8-Do this  steps all 6 permutations.

9-. Finally encrypts X (64) with a  64-bits key  to get our ciphertext.

This algorithm is strong and weak compared to others in several ways.

Disadvantages:

1-. The design and structure are much larger than the Feistel structure and takes longer.

2-. The Diffusion´s widht is twice of the Feistel structure.

 Feisel encryption has a symmetrical structure that uses a block cipher, named for the German and cryptographer Horst Feistel

3-. Input size limits.

Advantage

 
1-. Fast execution

2-. Better security against statistical attacks

Special thanks to Esteban Sifuentes for checking my Orthography.

Reference:
http://en.wikipedia.org/wiki/Rijndael_S-box 
http://en.wikipedia.org/wiki/Hierocrypt
http://es.wikipedia.org/wiki/Criptograf%C3%ADa
link de pdf de las imagenes LINK
http://en.wikipedia.org/wiki/Feistel_cipher
http://en.wikipedia.org/wiki/Advanced_Encryption_Standard

week number 6

In this week, we need to aplicated a serves web with rsa system


Some introdcuccin

In the web serves some peple for example alice generetd "X" and seend this a Bob.
Bob will dowload some script to put him privated keys and the x, before bob sends result "r", and alice put the result in the serves and user, finaly the serves says if bob is bob or not


Code1 :

	<html>
	<head>
	<title>Sistem of autentification</title>
	</head>
	<body>
	<H1>Download script python</H1>
	<a href= script.py target=_blank><button>clic here</button></a>
	<?php
	//generet random "x"
	$num=rand(1,50);
	$variable=rand(1,50);
	?>
	<p>
	<?php
	//Send with method reference the value of x
	?>
	<H1>Challenge:</H1>
	<a href="accion.php?var=<?php echo $variable; ?>"/>
	<p><input type="submit" VALUE="send"/></p>
	</p>
	</body>

view raw index.php hosted with ❤ by GitHub

Code2:

	Value of x:
	<?php
	//obtain value of x and
	// show value of x
	$num = $_GET["var"];
	echo $num;
	?>
	<?php
	//send values of user, r and value of x for future algoritms
	?>
	<H1>Verification:</H1>
	<FORM ACTION="verificar.php" METHOD="GET">
	Value of r: <INPUT TYPE="text" NAME="r"><BR>
	User name: <INPUT TYPE="text" NAME="usuario"><BR>
	<input type="hidden" name="x" value="<?php echo $num; ?>">
	<INPUT TYPE="submit" VALUE="Enviar">
	</FORM>

view raw accion.php hosted with ❤ by GitHub

Code3:

	<html>
	<head>
	<title>Verification</title>
	</head>
	<body>
	value of y =
	<?php
	//Calculated value of y
	$a = 3;
	$num = $_GET['x'];
	$numy = $num + $a;
	echo $numy;
	?>
	<H1>Verification</H1>
	The name you entered is : <?php echo $_GET['usuario'] ?>
	R: <?php echo $_GET['r'] ?>
	Valor de x: <?php echo $_GET['x'] ?>
	<br>
	<?php
	//read some file.dat to found user and the keys
	$filas=file('user.dat');
	// array about the values
	$campos = array('id', 'e', 'n');
	$c = 0;
	$cadena = $_GET['usuario'];
	$lugar = 0;
	$e = 0;
	$n = 0;
	//iterator about array in this case the line of file
	foreach($filas as $v){
	//save array after for some separation o caracter in this case ","
	$datos=explode(",",$v);
	//iterate arrays about the line with the separation
	foreach($datos as $dato){
	//comparate the user(cadena) vs line
	if(strcmp($dato, $cadena) != 0) {
	//echo "User was not found";
	}
	else
	{
	echo "User was found";
	//if found save the information in some variable
	$e = $datos[1];
	$n = $datos[2];
	}
	$c++;
	}
	$c = 0;
	echo "<p />";
	}
	?>
	<?php
	//process about the verification
	$r = $_GET['r'];
	//algoritmy to calculated the module
	$lle = 1;
	$u = $r % $n;
	while ($e > 0)
	{
	if(($e % 2) == 1)
	{
	$lle = ($lle*$u) % $n;
	}
	$e = $e/2;
	$u = ($u*$u) % $n;
	}
	//algoritmy to calculated the module
	if ($numy == $lle)
	{
	echo "its really him/her";
	}
	else
	{
	echo " is not him/her";
	}
	?>
	</body>
	</html>

view raw verification.php hosted with ❤ by GitHub

Script of dowload:

	y = 0
	r = 0
	d = 0
	x = 0
	##funcion of f(x)
	def funcionx(x):
	global y
	y = x + 3
	##funcion to obtain r with Modular exponentiation algorithm i used this method to
	##calculated r and desencript messenge in the php. Reference link about the
	##algoritm: http://web.usal.es/~hernando/segi2012/11HerrMat.pdf
	def funcionr():
	global r,d,n,y
	lle = 1
	u = y % n
	while (d > 0):
	if((d % 2) == 1):
	lle = (lle*u) % n
	d = d/2
	u = (u*u) % n
	r = lle
	def main():
	global d,n
	print "Dar valores de tu clave privada: "
	x = int(raw_input("Dame el valor de x: "))
	d = int(raw_input("Dame el valor de d: "))
	n = int(raw_input("Dame el valor de n: "))
	funcionx(x)
	funcionr()
	print "Valor de y = ",y
	print "Valor de r:",r
	main()

view raw script.py hosted with ❤ by GitHub

Screen4:


 Ramón used my server some pictures:

and triana (in this case was not yet translated)

Link of servece: http://alejandroave.260mb.org/
Apologies for publicity :C but "ITS FREE"

Reference:
http://php.net/manual/es/control-structures.foreach.php
http://php.net/manual/es/function.explode.php
http://php.net/manual/es/tutorial.php
http://web.usal.es/~hernando/segi2012/11HerrMat.pdf

#week number 5

This time, the homewoork is a simple server -  client with protocole rsa


Firsth the client try to conect to client
when the server detecte  the conexion of client start the protocole

1-. the server send x to client
2-. the client send messege encrupte
3-. the server desencripte and compere the y of server with the cliente
4-. if its the same the sounds is good
5-. if its different its to bad :C


We created two base data
one for user
one for the publi keys

The code of server:

	import socket #import librery for sockets
	import random #import librery for random numers
	s = socket.socket()
	s.bind(("localhost",9999))
	s.listen(10) ##accept maxim conexion
	n = 0
	x = random.randint(1, 50)
	y = 0
	res= 0
	a = 0
	d = 0
	print "Esperamos que alguien se conecte"
	sc, addr = s.accept() ##host y direccion and waiting conexion
	print "Se trata de conectar alguien"
	#def funcion:
	base = open("usuario.dat","r")##base data user
	llave = open("llaves.dat","r")##base data private
	#funcion for verific user#
	def verificar(recivido):
	for i in base.xreadlines():
	dato = i
	x = 0
	print "dato = ",dato
	tam = len(dato)
	print "recivido = ",recivido
	if str(recivido) == str(dato):
	print "si eres tu xD"
	break
	else:
	"no eres tu xD"
	##funcion for read keys
	def llaves():
	global d
	global n
	for i in llave.xreadlines():
	tam = len(i)
	d = int(i[0])
	n = 14
	##funcion for send messege to client
	def enviar():
	print "numero que ando enviando: ",x
	sc.send(str(x))
	##funcion for recive messege of client
	def recivir():
	global res
	llaves()
	print "e = ",d
	print "n = ",n
	recibido = int(sc.recv(1024))
	print "recibodo r= ", recibido
	res = recibido
	##calculate "y" of client with the private keys
	a = pow(res,d) % n
	#messege desencript#
	print "Y=",a
	#funcion of y#
	def funcion():
	global y
	y = x
	print "yyyy",y
	#process of comunication#
	while True:
	if n == 0:
	enviar()
	n = 1
	if n == 1:
	print "esperando respuesta"
	funcion()
	recivir()
	n = 2
	if n == 2:
	print "espero respuesta:"
	recibido = sc.recv(1024)
	print "tu nombre es: ",recibido
	verificar(recibido)
	n = 3
	print "adios"
	sc.close()##close client
	s.close() ##close server

view raw server.py hosted with ❤ by GitHub

The code of client:

	import socket #import sockers for client
	s = socket.socket() #declared objets
	s.connect(("localhost",9999)) ##conect to server
	n = 0
	y = 0
	x = 0
	print "1 Conectarte \n 2 Salida"
	decision = raw_input("Que deseas hacer:")
	print decision
	##funcion of x
	def funcion():
	global y
	y = a
	print y
	##for probabli conexion
	if decision == "1":
	while True:
	if n == 0:
	#reciv x#
	x = s.recv(1024)
	a = int(x)
	print a
	n = 1
	if n == 1:
	print "funcion = "
	funcion()
	##send d an n to server
	d = int(raw_input("dame la cosa d"))
	n = int(raw_input("dame la cosa n"))
	##send messeng codificat
	r = str(pow(y,d) % n)
	print "valor de r",r
	s.send(r)
	n = 2
	if n == 2:
	##send user
	usuario = raw_input("dame tu nombre: ")
	s.send(usuario)
	print "espero mensaje"
	x = s.recv(1024)
	n = 3
	else:
	print "adios"
	s.close() #close client

view raw client.py hosted with ❤ by GitHub

The code of generet keys:

	import random ##import mmodul random
	p = 0
	q = 0
	n = 0
	modul = 0
	c = []
	a = []
	b = []
	d = []
	z = []
	##funcion for comprobet if some numer is prime
	def primo(x):
	global n
	i = 0
	c = 0
	while i < (x - 1):
	i = i + 1
	residuo = x % i
	if residuo==0:
	c=c+1
	if c>=2:
	print "no es primo: ",x
	else:
	if x==1:
	print "es uno xD"
	else:
	print "EL numero si es primo ",x
	n = n + 1
	return x
	while n < 2:
	if n ==1 :
	p = random.randint(1, 10)
	a1 = primo(p)
	else:
	q = random.randint(1, 10)
	b1 = primo(q)
	si = 0
	##funcion to comprobet if two numer is coprime
	def gcd(en,e):
	global si
	global modul
	modul = en % e
	if modul == 0:
	print "maximo factor de los numeros"
	print "maximo factor = ",e
	#if modul == 1:
	# print "si son primos entre si: ",modul
	else:
	if modul == 1:
	print "si son primos entre si"
	si = 1
	else:
	if modul != 0:
	en = e
	e = modul
	gcd(en,e)
	##funcio to found ecuacion for eculides
	def euclides(en,e):
	x = en
	y = e
	modul = x % y
	divi = x / y
	print "resultado de la divicion",divi
	print "sobrante ",modul
	a.append(x)
	b.append(y)
	x = y
	y = modul
	c.append(divi)
	d.append(modul)
	if modul == 0:
	print "termio"
	print c
	print modul
	else:
	euclides(x,y)
	print "a= ",a
	print "b = ",b
	print "c = ",c
	print "d= ",d
	##codigo in general to found n,e,phi
	while si < 1:
	while n < 2:
	if n == 0:
	p = random.randint(1, 100)
	a1 = primo(p)
	if n ==1:
	q = random.randint(1, 100)
	b1 = primo(q)
	n = a1*b1
	en = (a1-1)*(b1-1)
	print "N = ",n
	print "en =",en
	e = random.randint(1,(en -1))
	print "valor de e:",e
	gcd(en,e)
	print modul
	euclides(n,e)
	##this code i found in i used this only for comprobate my result in paper
	##only this no my :C
	##link where i found this: http://www.slideshare.net/jpadillaa/criptografia-asimetrica-rsa
	#sorry for this :C
	#def egcd(a,b):
	# u,u1=1,0
	# v,v1 =0,1
	# while b:
	# q = a//b
	# u,u1 = u1,u -q*u1
	# v,v1 =v1,v-q*v1
	# a,b = b,a-q*b
	# return u,v,a
	#def modInverse(e,n):
	# return egcd(e,n)[0]%n
	#d = modInverse(13,25)
	#print "deeee=",d

view raw genere.py hosted with ❤ by GitHub

hire som image for some calcule of "d"

Some print screen

hire d = 3

N = 35

e = 23

The client sends a "d" and "n" and the server before it sends an x to use the function (x) and the client send its function, if  we are see where it says yyyy = 16 is the calculation server and Y is the calculation using the keys in this case, will leave the program.

In this image is about the code generet keys, this  generet value n,e,phie and verific if the numers are coprime, for used in ecuclides algoritm in paper :C

Links reference:

http://es.wikipedia.org/wiki/RSA

http://es.wikipedia.org/wiki/Algoritmo_de_Euclides

http://www.slideshare.net/jpadillaa/criptografia-asimetrica-rsa

http://es.wikipedia.org/wiki/N%C3%BAmeros_primos_entre_s%C3%AD

http://enciclopedia.us.es/index.php/N%C3%BAmeros_coprimos

http://mundogeek.net/archivos/2008/04/12/sockets-en-python/

http://wiki.python.org/moin/HowTo/Sockets

Diffie-Hellman

This time, we make a practice about: Diffie-Hellman

and change protocole.

My partners Carlos Eduardo and Pedro Miguel were the representation of Alice and Bob respectively.
And me am eve

p and g are the following numbers:

p = 11

g = 8

and "X", "Y" 

X = 2

Y = 2

Subsequently tested different numbers to get the value of "x" and "y" here below:

We already got the number we were looking

now need "Y"

then we need to found "K"

Here is a hand