No one else seems to have managed to prove that yet. There a few algos that have been proved uncrackable (unfortunately all are impracticable). But there are solid mathematical techniques that can prove these things.

Quick question about two FASM things:

With the 'stack' and 'heap' directives, do they affect the entire process if declared in a dll?

With stack specific, do you need to commit? like:

Ok, since I'm a noob in cryptography, is there some article/tutorial for these mentioned (especially PRNG to judge it myself ).

thanks

http://csrc.nist.gov/publications/PubsSPs.html
(more specifically, SP800-90revised_March2007.pdf)

http://www.schneier.com/yarrow.html