Redes Satélites

En esta entrada hablaremos primeramente sobre los tipos de satélites que existen, la arquitectura que tienen, tipos de receptores y transmisores, topologías que existen, el porque los hackers quieren hackearlos, el como ellos tienen acceso a los satélites y al finalizar veremos algunos casos reales.

Los satélites hoy en día son usados para:

• Transmitir en ciertas areas TV.
• Para realizar una red de datos corporativos.
• Para realizar una red de telefonía conmutada (ISP).
• Transmitir y recibir internet.
• Distribución de vídeos (cines).
• Realizar comunicación con el ISP (el proveedor de servicio del internet).

Existen 4 tipos de satélite:

• Satélites LEO (Low Earth Orbit, órbita baja) tienen una altitud de 500 - 2,000 km de la Tierra.
• Satélites MEO (Medium Earth Orbit, órbita media) tienen una altitud de 8,000 - 20,000 km de la Tierra.
• Satélites HEO (Highly Elliptical Orbit, órbita elíptica) tienen una altitud menor a los 35,786 km.
• Satélites GO (Geostationary Orbit, órbita geoestacionario), tienen una altitud de 35,786 km.

A continuación veremos una imagen que nos muestra el tipo de órbita que realiza cada uno de los tipos de satélites antes mencionados.

La mayoría de los satélites se componen de la siguiente manera:

Las frecuencias utilizadas por las antenas son las siguientes:

Estas son las usadas por los satélites.

Las redes VSAT (Very Small Aperture Terminals) son redes privada de comunicación de datos vía satélite para intercambio de información. Se componen por estas características :

• Tienen 2 tipos de comunicación satélital.
• Se usa un pequeño disco como antena (diámetro 75cm - 2,4m).
• Son administrados por el HUB (en este caso desde una estación maestra).

Existen varios tipos de topologías del VSAT, estas son algunas:

• Transmisión simplex. La aplicación que tiene este tipo de topología  es la transmisión de difusión como los son la TV y servicios de video así como el servicio de radio.

• Transmisión Duplex de Punto a Punto.  La aplicación que tiene este tipo de topología es el transporte de telefonía de voz, datos y IP (especialmente en configuraciones asimétricas), redes corporativas, contribución y distribución de programas de TV.

• Transmisión de un punto a múltiples puntos. La aplicación que tiene este tipo de topología es para la creación de redes corporativas, negocios en servicio de TV, servicios de internet entre otros.

• Servicio de antena móvil. La aplicación que tiene este tipo de topología es para el periodismo electrónico por satélite, para emisión y difusión de eventos especiales, servicios marítimos entre otros.

• Red estrella. La aplicación que tiene este tipo de topología es usado para redes corporativas ó para la enseñanza a distancia.

• Red malla. La aplicación que tiene este tipo de topología es para crear redes de datos y telefonía nacional e internacional.

Existen 3 formas de acceder a ellos:

• FDMA (Frequency Division Multiple Access, Acceso Múltiple por división de frecuencia) es una técnica de multiplexación en múltiples protocolos de comunicaciones tanto digitales como analógicos, principalmente de radiofrecuencia, y entre ellos en los teléfonos móviles de redes GSM. 

El acceso al medio se realiza diviendo el espectro disponible en canales, que corresponden a distintos rangos de frecuencia, asignando estos canales a los distintos usuarios y comunicaciones a realizar, sin interferirse entre sí. 

• TDMA (Time Division Multiple Acces, Multiplexación por División de Tiempo) es una técnica  que permite la transmisión de señales digitales y cuya idea consiste en ocupar un canal de transmisión a partir de distintas fuentes, de esta manera se logra un mejor aprovechamiento del medio de transmisión. TDMA es una técnica de múltiplexación que distribuye las unidades de información en ranuras ("slots") alternas de tiempo, proveyendo acceso múltiple a un reducido número de frecuencias.

• CDMA (Code Division Multiple Access, Multiplexación por División de Código) es un término genérico para varios métodos de multipleación o control de acceso al medio basados en la tecnología de espectro expandido pueden emplearse indistintamente espectro ensanchado, expandido, difuso o disperso. 

Los datos a transmitir simplemente se les aplica la función lógica XOR con el código de transmisión, que es único para ese usuario y se emite con un ancho de banda significativamente mayor que los datos.

Como se pudieron percatar los satélites son bien usados para casi las mayorías de las cosas que sucede en el mundo en cuestiones de tecnología y aquí es donde los hackers se involucran más; En la red se confía cierta información como de gobierno, clientes, ventas, multimedia, telefonía, acceso al banco, entre muchos otros, teniendo acceso a esta información se podría causar desde un simple robo hasta ocasionar un posible guerra.

Actualmente existen algunos tipos de ataques de satélite:

Servicio Denegado (DoS).

• Jam Uplink es crear una interferencia en el enlace de subida.
• Overpower Uplink es tener el dominio de un enlace de subida.
• Jam Downlink es crear una interferencia en el enlace de subida.

Posicionamiento Orbital (Orbital Positioning).

• Comando directo (Direct Commanding) es tener un acceso directo al satélite y poder controlar su funcionalidades de orbitación.

Algunos hackers buscan alguna vulnerabilidad en los ATM's que tienen comunicación por satélite. 

Actualmente el banco tiene dos problemas el primero es por parte de los usuarios y el segundo el sistema.

Por parte del usuario se tienen los problemas de una contraseña débil, son muy vulnerables al pishing y algunos les falta un poco de habilidades.

Por parte del sistema se tiene problemas porque los sistemas están fuera de tiempo, están configurados de una manera insegura y algunos tienen puertos inseguros o algunos simplemente dejan puertos abiertos.

Otro caso que me pareció muy interesante fue que unos hackers quieren comenzar a poner en órbita satélites para evitar la censura en la internet, esto debido a la propuesta de leyes como SOPA. Aquí les pongo un video sobre el proyecto que proponen y una liga a la noticia.



Noticia.
http://thehackernews.com/2012/01/hackers-launching-own-satellites-in.html

Existe una noticia muy relacionada sobre la censura también pero este va relacionada con la famosa página llamada ThePirateBay, en la cual están planeando tener servidores en las nubes con drones de baja órbita, esto para evitar que sigan operando.

Noticia.
http://thehackernews.com/2012/03/pirate-bay-plans-low-orbit-server.html

Otra noticia interesante es sobre los múltiples hackeos que han realizado los chinos, se dice que estos son realizados por un escuadrón en específico  que son entrenados para hacer diversos tipos de hacking. El último hackeo que han hecho ha sido a un satélite de USA y aún se sabe que información fue tomada.

Noticia.
http://thehackernews.com/2011/10/us-satellites-was-victim-by-chinese.html 

Entre los temas más predominantes del hacking en los satélites son sobre temas de dinero, censura e información gubernamentales.

Referencias.

Jim Geovedi, Raditya Iryandi, Raoul Chiesa. Hacking a Bird in the Sky
http://www.slideshare.net/geovedi/hacking-a-bird-in-the-sky-the-revenge-of-angry-birds

Satellite frequencies
http://www.inetdaemon.com/tutorials/telecom/satellite/frequencies.shtml

About VSAT Very Small Aperture Terminal
http://vsatcaribbean.com/vsat-satellite-basics-guide.html#About%20VSAT

FDMA
http://es.wikipedia.org/wiki/Acceso_múltiple_por_división_de_frecuencia

TDMA
http://es.wikipedia.org/wiki/Acceso_múltiple_por_división_de_tiempo

CDMA
http://es.wikipedia.org/wiki/Acceso_múltiple_por_división_de_código

ATM photo
http://www.networkinv.com/wp-content/uploads/bgan-atm-630x298.jpg

Steganography Assignment

Here's my code in three of the six photos. I recommend to download these photos from the link below because blogspot changes something and it's difficult to recover the information.

http://www.mediafire.com/?w26zr0yx6p1z89x

After the deadline, I'm going to explain how my algorithm works.

Happy hack :)

 

Parameters to encrypt:

1.- Name of the text to encrypt
2.- The image to hide the message
3.- The name of the image with the message

Example:

imagenes.py photo8.bmp copia8.bmp

Parameters to decrypt:

1.- Name of the image with the message
2.- The file to put the message
3.- The keyword "decripta"

Example: 

copia6.bmp recuperado6.dat decripta

Código


**Note** The three images with message are the number 1, 3 and 5.

Stream ciphers: Trivium

What is Trivium?

Trivium is a hardware oriented synchronous stream cipher, that was designed as an exercise in exploring how far a stream cipher can be simplified without sacrificing its security, speed or flexibility. 

Trivium is a synchronous stream cipher designed to generate up to 2 ^64 bits of key stream from an 80-bit secret key and an 80-bit initial value (IV), the process consists of two phases: first the interntal state of the cipher is initialized using the key and the IV, then the state is repeatedly updated and used to generate key stream bits. These are the parameters:

Key size: 80 bit

IV size: 80 bit

Internal state: 288 bit

Who invented Trivium?

It was submitted to a eSTREAM competition by its authors, Christophe De Cannière and Bart Preneel, and has been selected as part of the portfolio for low area hardware ciphers by the eSTREAM project, It's not patented.

How does It work?

Key stream generation; The proposed design contains a 288-bit internal state denoted by (s 1, ..., s 288). The key stream generation consists of an iterative process which extracts the values of 15 specific state bits and uses them both to update 3 bits of the state and to compute 1 bit of key stream z i. The state bits are then rotated and the process repeats itself until the requested N <= 2 ^64 bits of keys stream have been generated. Here is a pseudo-code:

Where "+" and "." operations stand for addition and multiplication over GF(2), which is the Galois Field of two elements (XOR and AND).

Key and IV setup; the algorithm is initialized by loading an 80-bit key and an 80-bit IV into the 288-bit initial state, and setting all remaining bits to 0, except for s ^286, s ^287 and 2 ^288, then the state is rotated over 4 full cycles without generating key stream bits.

Implementation  

Trivium is a hardware oriented design focussed on flexibility; It aims to be compact in environments with restrictions on the gate count, faster in applications that needs high-speed encryption and limited power resources. The design must provide a way to parallelize its operations, Trivium did it by ensuring any state bit that is not used for at least 64 iterations after it has been modified. This way, up to 64 iterations can be computed at once, provided that the 3 AND gates and 11 XOR gates in the original scheme are duplicated a corresponding number of times. This allows the clock frequency to be divided by a factor 64 without a ecting the throughput.

Attacks known

There are some attacks known as you can see below:

- Algebraic Attack

- Two Trivial Attacks

- Cube Attacks

Source:

Article where you can see specifications. 

http://www.ecrypt.eu.org/stream/p3ciphers/trivium/trivium_p3.pdf

Article Algebraic Attack
http://www-polsys.lip6.fr/~jcf/Papers/SCC08c.pdf

Two Trivial Attacks on Trivium
https://www.cosic.esat.kuleuven.be/ecrypt/stream/papersdir/2007/006.pdf

Cube Attacks on Trivium
http://eprint.iacr.org/2009/015.pdf

Galois/Counter Mode(GCM)

What is GCM?

GCM is a block cipher mode of operation providing both confidentiality and data origin authentication; It is defined for block ciphers with block sizes of 128, 192 and 256 bits.  Galois Message Authentication Code (GMAC) is an authentication-only variant of the GCM which can be used as an incremental message authentication code. Both GCM and GMAC can accept initialization vectors of arbitrary length.

Who invented GCM?

GCM was designed by McGrew and Viega as an improvement to Carter-Wegman Counter CWC mode. On November 26, 2007 NIST announced the release of NIST Special Publication Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC making GCM and GMAC official standards.

These are the Inputs and Outputs for GCM system

GCM has two operations, authenticated encryption and authenticated decryption, where the authenticated encryption has four inputs, and each of which is a bit string:

- A secret key K, whose length depends of the block cipher use.

- An initialization vector IV, that can have any number of bits between 1 and 2 ^64. For a fixed value of the key, each IV value must be distinct. If you are looking for efficiency is recommended 96-bit IV values.

- A plaintext P, which can have any number of bits between 0 and 2 ^39 -256.

- Additional authenticated data (AAD), which is denoted as A, this data is authenticated, but not encrypted, and can have any number of bits between 0 and 2 ^64.

There are two outputs:

- A ciphertext C whose length is exactly that of the plaintext P.

- An authentication is denotated as T, whose length can be any value between 0 and 28. The length is denotated as t.

How does It work?

First we have to know the notation

The two main functions used in GCM are block cipher encryption and multiplication over the field GF(2 ^128). The block cipher encryption of the value X with the key K is denoted as E(K, X). The multiplication of two elements X, Y ∈ GF(2 ^128) is denoted as X · Y , and the addition of X and Y is denoted as X ⊕ Y . A, the addition in this field is equivalent to the bitwise exclusive-or operation.

The function len() returns a 64-bit string containing the nonnegative integer describing the number of bits in its argument, with the least significant bit on the right. The expression 0l denotes a string of l zero bits, and AkB denotes the concatenation of two bit strings A and B. The function MSBt(S) returns the bit string containing only the most significant (leftmost) t bits of S, and the symbol {} denotes the bit string with zero length.

Now Let's know how it works... 

Encryption

Let n and u denote the unique pair of positive integers such that the total number of bits in the plaintext is (n − 1) 128 + u, where 1 ≤ u ≤ 128.

The plaintext consists of a sequence of n bit strings, in which the bit length of the last bit string is u, and the bit length of the other bit strings is 128. The sequence is denoted P 1, P 2, ...,P n-1, P ∗ n, and the bit strings are called data blocks, although the last bit string, P ∗ n, may not be a complete block. Similarly, the ciphertext is denoted as C 1, C 2,...,C n − 1 ,C ∗ n, where the number of bits in the final block C ∗ n is u. The additional authenticated data A is denoted as A 1, A 2,..., A m − 1, A ∗ m, where the last bit string A ∗ m may be a partial block of length v, and m and v denote the unique pair of positive integers such that the total number of bits in A is (m − 1) 128 + v and 1 ≤ v ≤ 128.

The authenticated encryption operation is defined by the following equations:

Successive counter values are generated using the function incr(), which treats the rightmost 32 bits of its argument as a nonnegative integer with the least significant bit on the right, and increments this value modulo 2 ^32. More formally, the value of incr(F||I) is F||(I + 1 mod 2 ^32).

The function GHASH is defined by GHASH(H,A,C) = X m + n + 1, where the inputs A and C are defined as we defined in the beginning, and the variables X i for i = 0,...,m + n + 1 are defined below:

Below we can see the process of encryption.

Decryption

The authenticated decryption operation is similar to the encrypt operation, but with the order of the hash step and encrypt step reversed, as you can see below how it works by the following ecuations:

T ' is computed by the decryption operation, and is compared to T associated with the ciphertext C, if the two values match in length and value, the ciphertext is returned.

 Multiplication in GF(2 ^128)

The multiplication operation is defined as an operation on bit vectors in order to simplify the specification, this  corresponds to the particular field representation used in GCM. Each element is a vector of 128 bits, the i th bit of an element X is denoted as X i; The leftmost bit is X 0, and the rightmost bit is X 127. 

The multiplication operation uses the special element R = 11100001 || 0 ^120; The function rightshift() moves the bits of its argument one bit to the right, in other words whenever W = rightshift(V), then W i = V i-1 for 1 ≤ i ≤ 127 and W 0 = 0. We can see it illustrated below.

The Field GF(2 ^128)

A finite field is defined by its multiplication and addition operations. These operations obey the basic algebraic properties that one expects from multiplication and addition (commutativity, associativity, and distributivity). Both operations map a pair of field elements onto another field element. In a polynomial basis,the multiplication of two elements X and Y consists of multiplying the polynomial representing X with the polynomial representing Y, then dividing the resulting 256-bit polynomial by the field polynomial; the 128-bit remainder is the result. GCM uses the following polynomial:

The addition of two elements X and Y consists of adding the polynomials together, because each coefficient is added independently, and the coefficients are in GF(2), this operation is identical to the bit wise exclusive-or of X and Y. No reduction operation is needed. Subtraction over GF(2 ^128) is identical to addition, because the field GF(2) has that property.

Attacks known

I find some information about his weaknesses in the GMAC (Galois Message Authentication Code), well actually this is a common weak in all kind of encryption or decryption that needs a key. You have to use a value relative prime.

Sources:

http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/gcm/gcm-spec.pdf

http://nist.gov

Homework: Implementation of RSA algorithm in Python

I implemented with sockets where the server read a plaintext, in the plaintext we have the users with his private keys. The server have to create a random number and pass it by a function, then the server send it to a client where the client has to pass it by a function, the user have to give his name to get his public key where he has d and n. The client have to squarting the random number that the server sent to d module of n, we can call it r. The client sends the hist username and the r value, then the server squart r to e module of n( n and e are the private key), if the value that we get of that operation is equal to the y value, we establish a secure connection, else we say a warning.

The client has to type his name to get his public key.

Server socket

Client socket

Diffie–Hellman key exchange

With two collaborators where one is called Alice and the another one called Bob, they established the diffie-hellman key exchange. My work here is to be a eavesdropper and I need to get the k value that is called secret key, to see more info you can check out here.

Let's see the information that I take:

P = 17
G = 11

from Alice X = 4
from Bob Y = 10

The method that I did is by brutal force:

And We got the value of k is 4.

Statistical Analysis of One-Time-Pad

I did some tests to prove that my key generated by my code is secure. The test that I did, was the monobit test, this test focus on the frequencies of zeros and ones. The prupose of this test is to determine whether the number of ones and zeros in a sequence are approximately the same as would be expected for a truly random sequence.

This is the key to test.

Then we convert the odd numbers to ones and the pair numbers to 0.

After we test the ones and zeros into my monobit function. Here's my code.


And our p-value is:

The p-value is the probability that a test statistic would be obtained a certain probability to expect that is true. We assum that we have an alfa value this value is the expected value I expected that I'll have 0.5 value, and I got 0.510797798174, it's very close but still being above my alfa value, so my key value is not really good, because I have certain patterns that a hacker could hack fast.
Source:
P-value http://mathworld.wolfram.com/HypothesisTesting.html
Max's blog http://maxkalavera.blogspot.mx/search/label/Clase%20modelado%20y%20simulaci%C3%B3n%20de%20sistemas%20din%C3%A1micos

Homework: One-time pad

A one-time pad is a cryptosystem invented by Vernam, it's a very simple system and is unbreakable if used correctly. To use a one-time pad, you need 2 copies of the "pad" which is a block of random data equal in length to the message you wish to encode. One-time pads are used in pairs, one copy of the pad is kept by each user, and pads must be exchanged via a secure channel( like a blue ray disk, dvd, or something like that). The pad is used by a using XOR every bit of the pad with every bit of the original message.

Once the message is encoded with the pad, the pad is destroyed and the encoded message is sent. On the recipient's side the encoded message you have to use XOR with the duplicate copy of the pad and the plaintext message is generated.

Now will see my code on python:

I read this page, it's interesting because inside explain this type of encryptation and if it is possible to break.

http://www.ranum.com/security/computer_security/papers/otp-faq/

Extra points week: Ciphertext

 My ciphertext:

37754.8780.17560.15804.82532.30730.8780.82532.9658.15804.20194.8780.11414.8780.19316.26340.82532.20194.15804.82532.17560.8780.28096.8780.15804.11414.8780.82532.17560.26340.12292.18\
438.12292.28096.12292.17560.8780.82532.17560.8780.19316.8780.82532.55314.17560.26340.14926.8780.19316.15804.24584.14926.28096.8780.82532.14926.8780.17560.15804.82532.30730.8780.825\
32.19316.26340.14926.15804.19316.26340.82532.17560.28096.8780.82532.19316.25462.26340.82532.20194.15804.82532.8780.24584.15804.18438.15804.82532.15804.21950.15804.82532.14926.8780.\
17560.15804.82532.25462.26340.82532.17560.28096.8780.82532.24584.8780.9658.8780.9658.26340.82532.29852.12292.29852.12292.82532.8780.26340.82532.19316.15804.19316.15804.82532.20194.\
15804.82532.9658.15804.20194.8780.11414.8780.19316.26340.65850.55314.82532.37754.8780.17560.15804.82532.30730.8780.82532.9658.15804.20194.8780.11414.8780.19316.26340.82532.20194.15\
804.82532.30730.15804.19316.8780.82532.17560.8780.19316.8780.82532.31608.18438.15804.29852.12292.25462.26340.20194.14048.28096.8780.82532.42144.8780.18438.25462.14926.26340.24584.8\
2532.60582.14926.26340.24584.15804.17560.8780.82532.17560.15804.18438.8780.82532.19316.8780.14926.8780.18438.15804.61460.82532.20194.8780.82532.26340.24584.8780.28096.8780.82532.60\
582.47412.8780.19316.12292.82532.17560.28096.8780.82532.17560.15804.18438.8780.82532.19316.25462.26340.61460.65850.82532.37754.8780.17560.15804.82532.14926.15804.30730.15804.82532.\
30730.15804.20194.8780.28096.12292.30730.8780.82532.17560.26340.28096.12292.21950.21072.82532.17560.8780.19316.8780.82532.17560.8780.28096.8780.15804.11414.8780.82532.17560.8780.19\
316.8780.82532.14926.8780.17560.15804.82532.8780.26340.82532.14926.8780.17560.15804.82532.30730.8780.82532.17560.15804.24584.14926.12292.23706.15804.8780.64094.82532.17560.15804.25\
462.8780.15804.13170.8780.82532.20194.8780.82532.17560.15804.19316.8780.25462.8780.15804.13170.8780.82532.17560.8780.25462.15804.17560.8780.82532.24584.14926.12292.23706.15804.8780\
.82532.30730.21072.25462.12292.82532.19316.9658.15804.18438.15804.65850.82532.42144.8780.13170.26340.20194.11414.15804.24584.14926.21072.82532.29852.8780.82532.14926.8780.17560.158\
04.82532.30730.8780.82532.9658.15804.20194.8780.11414.8780.19316.26340.82532.17560.8780.25462.15804.17560.8780.82532.19316.8780.30730.21072.12292.30730.15804.82532.29852.8780.82532\
.17560.15804.19316.8780.25462.8780.15804.13170.8780.64094.82532.20194.11414.8780.20194.15804.82532.29852.8780.82532.24584.14926.12292.23706.15804.8780.82532.29852.8780.82532.17560.\
15804.19316.8780.25462.8780.15804.13170.8780.64094.82532.29852.8780.82532.17560.15804.19316.8780.25462.8780.15804.13170.8780.82532.20194.8780.82532.17560.15804.17560.8780.20194.114\
14.8780.82532.48290.8780.8780.24584.15804.24584.15804.64094.82532.17560.8780.25462.15804.17560.8780.82532.47412.12292.23706.8780.82532.29852.8780.82532.19316.8780.16682.15804.19316\
.9658.21072.82532.20194.8780.82532.17560.8780.25462.15804.17560.8780.82532.24584.14926.26340.14048.14926.26340.18438.15804.82532.30730.8780.82532.19316.8780.24584.14926.15804.23706\
.15804.17560.8780.82532.29852.8780.24584.15804.29852.21072.82532.29852.8780.82532.17560.15804.24584.12292.23706.15804.17560.8780.18438.15804.64094.82532.15804.19316.12292.17560.263\
40.28096.8780.82532.19316.24584.15804.20194.14048.15804.82532.28096.8780.82532.24584.12292.23706.8780.82532.29852.8780.82532.26340.19316.19316.8780.82532.11414.26340.20194.15804.87\
80.20194.15804.82532.17560.21072.25462.12292.65850.82532.34242.14926.8780.20194.8780.82532.29852.8780.82532.14926.8780.17560.15804.82532.30730.8780.82532.9658.15804.20194.8780.1141\
4.8780.19316.26340.82532.28096.8780.82532.19316.8780.25462.8780.15804.13170.8780.64094.82532.55314.17560.8780.19316.8780.82532.34242.15804.24584.10536.21072.26340.23706.24584.12292\
.82532.49168.19316.19316.8780.82532.29852.8780.82532.16682.8780.19316.15804.15804.82532.29852.8780.82532.36876.18438.21072.9658.8780.18438.82532.28096.8780.17560.8780.25462.15804.8\
2532.28096.8780.82532.8780.19316.8780.20194.15804.82532.15804.20194.8780.28096.12292.30730.8780.82532.17560.26340.28096.8780.82532.8780.18438.15804.24584.12292.19316.8780.82532.175\
60.26340.28096.8780.82532.29852.8780.82532.17560.8780.28096.8780.15804.11414.8780.82532.19316.8780.8780.11414.15804.18438.15804.82532.18438.26340.14048.14926.8780.64094.82532.20194\
.15804.82532.17560.28096.8780.19316.9658.8780.82532.14926.8780.17560.15804.82532.30730.8780.82532.9658.15804.20194.8780.11414.8780.19316.26340.65850.55314.82532.44778.8780.19316.21\
072.16682.8780.82532.20194.8780.82532.14926.8780.29852.21072.64094.82532.19316.8780.11414.8780.15804.82532.29852.8780.18438.15804.29852.21072.25462.21072.18438.12292.28096.8780.825\
32.20194.8780.82532.20194.14048.26340.27218.26340.82532.19316.8780.13170.26340.20194.11414.15804.24584.14926.21072.82532.29852.8780.82532.14926.8780.17560.15804.82532.30730.8780.82\
532.9658.15804.20194.8780.11414.8780.19316.26340.82532.17560.26340.12292.20194.11414.12292.18438.12292.8780.82532.17560.26340.19316.13170.8780.20194.29852.8780.82532.28096.8780.245\
84.15804.28096.8780.24584.15804.82532.19316.17560.26340.9658.28096.8780.82532.19316.15804.16682.8780.11414.8780.18438.8780.82532.16682.26340.26340.82532.29852.8780.82532.8780.24584\
.15804.18438.15804.82532.20194.8780.82532.19316.8780.26340.11414.14926.26340.15804.64094.82532.20194.8780.82532.19316.8780.25462.12292.20194.11414.21072.82532.29852.8780.82532.1492\
6.8780.17560.15804.82532.30730.8780.82532.9658.15804.20194.8780.11414.8780.19316.26340.82532.18438.12292.21072.65850.82532.40388.28096.8780.82532.14926.8780.17560.15804.17560.8780.\
64094.82532.24584.26340.8780.18438.8780.82532.18438.8780.82532.19316.8780.8780.20194.8780.82532.29852.8780.82532.55314.14926.8780.17560.15804.55314.82532.20194.15804.82532.26340.25\
462.8780.25462.8780.82532.20194.8780.82532.24584.21072.19316.21072.82532.42144.28096.12292.20194.29852.12292.28096.12292.82532.29852.8780.82532.19316.16682.8780.11414.8780.18438.87\
80.82532.28096.8780.82532.17560.26340.12292.20194.11414.12292.18438.12292.8780.82532.44778.14926.15804.18438.21072.24584.21072.21950.14926.15804.10536.8780.18438.65850.84288.

You can download it by Mediafire:

http://www.mediafire.com/?c9dofrve0w8oady

Seguridad de la información y criptografía