Nice +1

I was looking around on the web and came across this website that was giving EZ some Props. Evilzone rated #2 (Should've been #1 ) as the the Top 5 Websites To Learn How To Hack Like A Pro!

They said:

"While the name, EvilZone, isn’t exactly the most inviting – it is easily one of the largest forum communities that you’ll find on the subject of hacking. With over 13,042 members and over 50,000 posts (and counting), this community likely has the skills and knowledge to answer any programming question you could possibly have. Just be careful about coming across as a “noob” – these guys don’t handle newcomers with kid gloves, so be careful."


I loved that last part. 

Ark

Here's the website:
http://www.makeuseof.com/tag/top-5-websites-to-learn-how-to-hack-like-a-pro/

Say It Ain’t So - An Implementation of Deniable Encryption by Ari Trachtenberg
from Blackhat Asia 2014
https://www.youtube.com/watch?v=9v3_xhzcZOs

Say It Ain’t So - An Implementation of Deniable Encryption
White Paper.
Download Deniable Encrypt.zip

I found this presentation and whitepaper on Deniable Encryption. Pretty cool.

Ark

Must you be a math geek A⁺ student to understand cryptography? ..can't a B student crack or design Hash algorithms?...and how can a B student become a cryptographer?...  is there hope?

Hi Clone,
     You ask a great question. I am actually in college to do that very thing. Here are a few really good places to start.

1. Here is an Article by Bruce Schneier. This is from his famous blog "Schneier On Security". I am sure you will find it helpful. He is actually one of the top Cryptographers/Cryptographic Engineers/Mathematicians in the world and has written several top books on Cryptography. ie Applied Cryptography, Practical Cryptography, Cryptography Engineering. He invented the Blowfish and Twofish (AES Top Five Finalist) Ciphers, along with the Skein Hashing Function (Another AES Top Five Finalist).

https://www.schneier.com/crypto-gram-9910.html#SoYouWanttobeaCryptographer


2.This is a link University of Washington Course of Cryptography. U. of Washington is one of the top Crypto schools in the world. Home of famous Professors like Neal Koblitz (Elliptic Curve Cryptography) and Josh Benaloh (Microsoft). It's Free. Just click on the Lectures Section.

http://courses.cs.washington.edu/courses/csep590/06wi/

3. The Handbook of Applied Cryptography. aka. The Cryptography Bible. This is actually the book for the U. of Washington Course. It was written by Alfred Menezes and Scott Vanstone. Both of these guys are from the University of Waterloo's Centre for Applied Cryptographic Research. I went ahead and uploaded it for you.

The Handbook of Applied Cryptography
http://upload.evilzone.org/download.php?id=5303909&type=zip

4. Stanford University's Online Cryptography Course By Dan Boneh
You just need to sign up and it's completely Free. It's awesome.
https://www.coursera.org/course/crypto

I hope this will help you and anyone else interested in Cryptography.

Ark

Ahhhh, I see. I thought your response to my post was to ask me if I was able to "count". Like, if I had the ability to count (i.e. 1,2,3,4), then, I would be able to solve my problem...lol. I was like damn what a low blow. I apologize for misunderstanding you. But, I am sure you can see how that could be misinterpreted. I will try to ease off of the trigger a bit. Thanks to everyone for trying to help.

Sincerely,
Ark

I have a question for you guys. My Bro is working on this for a project and this problem came up. I want to surprise him with the answer. I figured if anyone could deal with it, you guys could. I had to copy and paste it and I am not much of a programmer so if there are any mistakes, I apologize. Any ideas or insight would be great. Thanks in advance! Ark

"I have generated a 10x10 integer matrix, by way of a 2 dimensional array, the elements are randomly generated and lie on

1 <= z <= 5
I am in need of an efficient method of setting all adjacent "duplicates" (repeating elements), along any row or column (not diagonally), of length 3 or greater to the integer six (6). The source for the brute method follows for clarity.

for(row=0;row<10;row++)
{
    for(col=0;col<10;col++)
    {
        board[row][col]=rand()%4+1; //filling matrix here
    }
}
print_board(board, row, col);

printf("Switch: ROW COLUMN\n ");
scanf("%hu %hu", &x1, &y1);
printf("With: ROW COLUMN\n");
scanf("%hu %hu", &x2, &y2);
swap(board, x1, y1,x2, y2);  //stdrd for loop no good b/c of
                             //below <-this->below   
if(board[0][0]==board[0][1] && board[0][1]==board[0][2] && board[0][2]==board[0][3])
{
    board[0][0]=6;
    board[0][1]=6; 
    board[0][2]=6;
    board[0][3]=6;   // brute force would require many more to complete
}
I know there must exist a much more elegant approach than listing out all permutations. If you have seen this and recall the technique I would very much appreciate your assistance."

Hey guys,
     I was wondering if anyone else here Wrestled (Freestyle,Greco-Roman,Folk) or trained BJJ, Gi and/or No-Gi.

Ark