Analysis of CVE-2013-0809 – Java integer overflow (axtaxt.wordpress.com) 70 points by VMG 13y ago ↗ HN
[–] Someone 13y ago ↗ Minor correction: The size of the malloced area: (width height * 4) modulo 0xffffffff* is incorrect. The modulo is 2^32, not 2^32-1 [–] unwind 13y ago ↗ I noticed that too. The author is probably confusing the fact that you can compute the modulo for a power of two by bitwise-and:ing with (the power of two) - 1.I.e. x & 0xffffffff == x % (0xffffffff + 1) (assuming more than 32 bits everywhere).
[–] unwind 13y ago ↗ I noticed that too. The author is probably confusing the fact that you can compute the modulo for a power of two by bitwise-and:ing with (the power of two) - 1.I.e. x & 0xffffffff == x % (0xffffffff + 1) (assuming more than 32 bits everywhere).
[–] ExpiredLink 13y ago ↗ OpenJDK, not "Java". [–] pjmlp 13y ago ↗ Not only that, it is an exploit of the C code in the OpenJDK implementation.People should stop mixing languages with implementations.
[–] pjmlp 13y ago ↗ Not only that, it is an exploit of the C code in the OpenJDK implementation.People should stop mixing languages with implementations.
5 comments
[ 9.4 ms ] story [ 120 ms ] threadI.e. x & 0xffffffff == x % (0xffffffff + 1) (assuming more than 32 bits everywhere).
People should stop mixing languages with implementations.