1,174 karma · joined June 17, 2011
Anyone else do the same and have a better recollection of the tools you used?
The Jewish calendar is based on the lunar cycle, and each month has either 29 or 30 days. Back then the length of months was not declared in advance. Instead, each month when a new moon was spotted witnesses could come to the religious court (called Sanhedrin) in Jerusalem claiming to have witnessed the new moon, and if the court accepted their testimony that day was declared the first of the month. To spread the word they would light a bonfire on a mountain, and every city that saw the bonfire would light their own and the message would quickly spread. (Similar to the semaphore system but only transmitting a single bit. Because the signal was just a fire at nighttime it would reach very far very quickly)
Now, there was a small offshoot of Jews known as Karaits, whose interpretation of the Bible caused them to believe that passover must fall on a Sunday (the passage says something like "on the first day [of passover] " which can also be interpeted as "on Sunday"). "Mainstream" (at the time) Judaism did not agree with this interpretation. So what did the Karaits do? On the day that they wanted to be the first of the month (such that Passover, the fourteenth of the month, would fall on Sunday) they went to a nearby mountain and lit a bonfire. The other cities saw the bonfire and assumed it was legitimate, and so lit their own bonfires as well, and the fake message was spread. Classic man in the middle attack!
So how did the Sanhedrin solve this issue? One way would be to sign their messages with RSA. Generate two large prime numbers p and q, have N=p*q and e=65537 be public, known parameters, figure out how to properly pad your messages so that you're not using a completely broken system, and sign the hash of the message with phi=(p-1)(q-1).
There are a few problems with this. First, it's difficult to transmit 1024 bit messages over fire signals. Second - Rivest, Shamir and Adelman wouldn't be born for another 2000 years or so.
Instead, the solution was to move to a different, more secure medium. Instead of lighting a fire, the Sanhedrin would send messengers to spread the word to nearby cities, and each city would send their own messengers to their neighbors. Each city would trust their immediate neighbors and a chain of trust could be established.
The problem with the new solution is that it is much much slower than the traditional fire signals, so some far off places wouldn't know when the previous month started by the time the 14th of the month (passover) came around. To handle this, far off cities would celebrate two days of passover - one on the 14th assuming the previous month had 29 days, and one on the following day under the assumption that there were 30 days.
To this day, the tradition of Jews in far off places celebrating 2 days of holidays remains. Orthodox religious Jews outside of Israel celebrate 2 days of each of the 3 major Jewish holidays out of a sense of "doubt" over which day the holiday actually falls on because the message would not arrive in time.
Obviously we can order reals (using <), I interpreted the original post as referring not to your definition but to "order and count"
The name of the level is "the properties of a mirror" which hints that you need to find a mirror of the original site in order to solve the level, and I think that the mirrors are no longer online.
Note for anyone unfamiliar that this level is not at all representative of vortex - all the other levels are all hard core exploit implementation and not stego challenges. In general I don't like stego because I feel that it is more of "try to guess what I'm thinking" than solving interesting challenges.
Stage 16 is one of my favorite challenges all time. It took me weeks to solve and the solution is very impressive.
I've been stuck for the last few years on stage 23. Unlike the rest of the challenges it is a stenography level, and I'm not convinced that it is still solvable today.
A better way to count based on names would be to first count all single letter names alphabetically, then all two letter names alphabetically, etc.
> To make such an attack possible, we had to find a way to remotely yank already installed lamps from their current networks, and to perform over-the-air firmware updates. We overcame the first problem by discovering and exploiting a major bug in the implementation of the Touchlink part of the ZigBee Light Link protocol, which is supposed to stop such attempts with a proximity test. To solve the second problem, we developed a new version of a side channel attack to extract the global AES-CCM key that Philips uses to encrypt and authenticate new firmware.
Fantastic work!
http://www.mit.edu/~puzzle/2013/coinheist.com/rubik/a_regula...
Assume startups fail 90% of the time. 50% of the time your coin comes up tails, and you claim the startup will fail. 50% of the time your coin comes up heads and you claim the startup will succeed.
You guess correctly 0.5 (the chance your coin comes up tails) * 0.9 (the chance the startup fails) + 0.5 (heads) * 0.1 (success) = 0.5 of the time.
> Imagine if you did that today. "Press any key to ignore this kernel panic."
Linux still does this today. Not for kernel panics, but for kernel oops, which is the error you will usually get when doing something bad (say a null pointer dereference in a kernel module).
The thread that causes a kernel oops is killed and a stack trace is written to dmesg but the rest of the system attempts to continue chugging on.Save the program to a file and run: runhaskell quine.hs | python | ruby to get the original file.
If you look it through it's just a trivial extension of the "classical" quine. The function q prints it's arguments followed by printing a call to the function q with escaped arguments. Except instead of getting a single argument it gets 3, each of which is the corresponding function in a different language, and the function cycles to the next one.
A one liner saying go back to reddit is not HN material. Please go back to reddit.
http://freecode.com/articles/suse-new-krb5-packages-fix-remo...
Granted, these were just candidates and not actually NIST defined algorithms, but the point stands that algorithms can be fine while standard implementations have bugs.
How are patents justified if the law recognizes that monopolizing ideas is bad?
http://www.reddit.com/r/technology/comments/16zlo7/atari_fil...