Java Puzzle: Square Root
corner.squareup.com
Java Puzzle: Square Root
1–10 of 61 posts
Re: Java Puzzle: Square Root
#2Someone should just modify the StackSort algorithm that was posted yesterday (made up by xkcd) to search for Square Root functions instead and run them.
Re: Java Puzzle: Square Root
#3Are they asking for a timing attack, then?
Re: Java Puzzle: Square Root
#4The only possibilities seem to be a timing attack, exploiting a bug or taking advantage of an implementation that puts the dividend value in the exception when dividing by zero.
I'm not sure anyone will bother writing the timing attack since he apparently gives out no prize.
Re: Java Puzzle: Square Root
#5I'm not sure this is interesting. Unless I'm missing something, the question is "find what way of breaking the compartmentalization of the JVM we haven't forbidden in these English-language rules".
Re: Java Puzzle: Square Root
#6Consider that SecureRandom is really a facade around multiple providers that can plug in varying implementations. :)
Re: Java Puzzle: Square Root
#7Use reflection to read n. Reflection lets you bypass |private|.
Re: Java Puzzle: Square Root
#8Can someone explain what this is asking? I don't know java
Re: Java Puzzle: Square Root
#9Consider that SecureRandom is really a facade around multiple providers that can plug in varying implementations. :)
ah ha! That might of being too big of a hint, good sir.
Re: Java Puzzle: Square Root
#10Use reflection to read n. Reflection lets you bypass |private|.
that should throw an exception with the security manager on. I think. I might of read the docs wrong.