300 reputation
39
bio website
location
age
visits member for 3 years, 4 months
seen Feb 10 at 12:20

I first learned the basics of C by myself and a little help from friends, after that I learned C++ at school, php, MYSQL, and so on.

I'm a big fan of the KISS principle.

I don't like languages like java, C#, javascript, but am a big fan of python.

I still have to learn to do some good haskell.

I'm currently making a 3D game with Ogre3D and bullet with my free time. I intend to make a minimalist RPG where you can harvest different types of material and scraps, and learn to build new things for your survival and the worker you hire.

I'm also thinking about a level editor to make very big levels with the help of procedural generation. After using Enet as a networking library, I'll release my new MMOFPS and make millions of dollars. But I should maybe find a job first.

I'm also interested in maths and cryptography, but I don't master those subjects.


Sep
2
comment How can we reason about the cryptographic capabilities of code-breaking agencies like the NSA or GCHQ?
Yes I guess that seems to fit better, at least if people answers ! Thanks for reinterpreting the question ! I guess that's what I wanted to ask about "other techniques than differential cryptanalysis"
Aug
30
comment What is the smallest plaintext/ciphertext size for an algorithm like?
I edited known to choosen
Aug
30
comment What is the smallest plaintext/ciphertext size for an algorithm like?
sorry, edited my question
Aug
23
comment Dictionary attack on pass-phrases on common algorithms
But of course this doesn't apply to website's passwords, since you can prevent dictionary attacks. I just ask this question because I think one day OSes will be clustered across users machines, and we will need to encrypt data, and thus password choice could matter.
Aug
23
comment Dictionary attack on pass-phrases on common algorithms
Like I said in other comments, I'm not thinking about a 1000-words list, but I'm rather suggesting the user to choose common words, because I'll ask him to use a password with at least 24 characters (minimum 16 characters if words used are short). You can't explain encryption to users, but the encryption is defeated if one can easily find the password of 80% of users. It is commonly known that most passwords in the world have 6+ characters. What XKCD shows is that we should tell users to use pass phrases, not pass words, and tell them we can't secure their data if they don't listen.
Aug
22
comment Dictionary attack on pass-phrases on common algorithms
Can't enter more than 8 characters, what ? And i want to implement this password rule into my system, it's not for other websites.
Aug
22
comment Dictionary attack on pass-phrases on common algorithms
Anyway, I doubt the english dictionary has 2^11 words. And I don't get how xkcd calculates his entropy... with little grey squares representing bits... ?
Aug
22
comment Dictionary attack on pass-phrases on common algorithms
what 2^11 dictionary ? the english dictionary ? what are you talking about ?
Aug
22
comment Dictionary attack on pass-phrases on common algorithms
When I say 3 words, I mean 3 english words, not 3 words from a small list I give. That would be stupid.
Aug
21
comment Are there public slow-but-strong algorithms out there that resist brute-force attacks better?
@Bill: both. AES is made for performance, but I just want to know "what if we make a slower system so it can resist bruteforce ?"
Aug
10
comment How were the DES S-box values determined?
I'm just trying to get interested in this, but it seems quite a strange subject.