can be in the thousands or millions; on modern 64-bit systems, these numbers typically reach the millions at least. For 32-bit systems at 2004 computer speeds which have 16 bits for address randomization, Shacham and co-workers state "… 16 bits of address randomization can be defeated by a brute force attack within minutes."[1] It should be noted that the authors' statement depends on the ability to attack the same application multiple times without any delay. Proper implementations of ASLR, like that included in grsecurity, provide several methods to make such brute force attacks infeasible. One method involves preventing an executable from executing for a configurable amount of time if it has crashed a certain number of times." --
http://en.wikipedia.org/wiki/Address_space_layout_randomization Anybody know anything about 64-bit ASLR? How practical is a bruteforce attack against it?What are other methods of bypassing 64-bit ASLR besides a bruteforce?
--
You received this message because you are subscribed to the Google Groups "S4 Discuss" group.
To view this discussion on the web visit https://groups.google.com/d/msg/s4-discuss/-/5WR-RM9b84sJ.
To post to this group, send email to s4-di...@googlegroups.com.
To unsubscribe from this group, send email to s4-discuss+...@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/s4-discuss?hl=en.