U.S. Federal Information Processing Standard (FIPS)
Jonathan Caceres, Sep 20, 02:46 The algorithm below is a U.S. Federal Information Processing standard
(FIPS) approved method to pseudorandomly generate keys and initialization
vectors for use with DES.
Heuristic Pseidirandom Number Generation
ANSI X9.17
ANSIX917PRBG(s,m,k):
input: a random 64-bit seed s, integer m, and a DES EDE key k
output: m pseudorandom 64-bit strings x1,x2,...,xm
1. compute I =Ek(D) where D is a 64 bit representation of the date/time in as fine
a resolution as possible.
2. for i = 1 to m do:
3. xi = Ek(I + s)
4. s = Ek(xi + I)
5. output (x1,1x21...xm)
Visa gets Venmo for 5.3 Billion
Jonathan Caceres, Aug 08, 06:32
Best video of What it is Crypto Mining?
Jonathan Caceres, Jun 27, 11:36
Classical Cryptography
Jonathan Caceres, Oct 08, 01:47
Classical cryptography dates back thousands of years and has been employed for such things as
concealing command and control information during times of war. Command and control information
must be secured, even against the messengers that carry it, so that it does not fall into enemy
hands while in transit.
We all familiar with Hollywood movies and best sellers books related to cryptography. A classic
cryptography consists of an encryption algorithm E, a decryption algorithm D, a message
space M, a ciphertext space C, and a key space K.
This may be represented as
c = E (m, k)
The decryption algorithm E takes m and k as input and computes the ciphertext c of the message m.
This may be represented as
m = D (c, k)
See how javaScripts works Kids Lab on jcrdeveloper.net.au
Tiny Encryption Algorithm
Jonathan Caceres, Oct 05, 03:28
Guys here is your algorithm for a tiny encryption.
/* XTEA
v gives the plaintext of 2 words
k gives the key of 4 words
N gives the number of cycles, 32 are recommended
if negative causes decoding, N must be the same as for coding
if zero causes no coding or decoding
assumes 32 bits "long" and same edian coding or decoding*/
tean(long *v, long *k, long N)
{
unsigned long y = v[0],z = v[1], DELTA = 0x9e3779B9;
unsigned long limit, sum;
if( N > 0 ) /* the "if" code performs encryption */
{
limit = DELTA * N;
sum = 0;
while ( sum != limit)
y += (z << 4^z >> 5) + z^sum + k[sum&3],
sum += DELTA,
z+= (Y << 4^Y >>5) + y^sum + k[sum >> 11&3];
}
else /* the "else" code performs decryption */
{ /* IT IS TRULY MINUSCULE */
sum = DELTA * (-N);
while (sum)
z -= (y << 4^y >> 5) + y^sum + k[sum>>11&3],
sum -= DELTA,
y-= (z << 4^z >> 5 )+ z^sum + k[sum&3];
}
v[0] = y;
v[1] = z;
return;
}
What it is Cryptography?
Jonathan Caceres, Oct 08, 01:48
Today we listen podcast, radio or someone at work taking about Bitcoin, Libra or other source of
crypto currency. But what it is cryptography?
Cryptography is the study of the hidden word. It is broken down in two subfields called
cryptography and cryptanalysis.
Cryptography is the science of developing cryptosystems that encipher and decipher data,
among other things.
Cryptanalysis is one who seeks to break or find weakness in the ciphers that are developed
by a cryptographer.
How lock like the algorithm of a encryption program
Mathematical model like below:
k = s -1 (H(m) + xr) mod q
This is only one a small part of a DSA or The digital Signature Algorithm
The code without language compiler
input: database B= b1b2...bn consisting of n bits
query q = (m,x,Y)
output: a responder r containded in Z*m
.
.
.
etc.
What you can see if you are like enough to see it, the encrypted file before it destroy by itself
ksdjfksjfo14523snsldjfklsjs
a
dkfeiowf45d5fss2ds5v5db
b6dffge6w6egy35
Nothing you could not see it but only characters without any logic order.
The key is the most import element here is the tool to open the file, communication between the sender and
the receiver in order to implement the encryption.
The current encryption standard is 3DES 56 bit keys.
The most powerful encryption today is RSA or rivest-Shamir-Adleman