Drama! Intrigue! Geekiness!

October 8, 2007

Public-ize this.

srikanth @ 10:47 am, GMT +0000 ( 1191840479 ) Play

The famous picture below has a small prank in it. Identify the dudes in the picture, and the easter egg it contains.


(Some visual acuity required :-) )

Cracked by: devadutta, BiGFooT (Yeti returns!) , nihit , Poornima , jayanth , Gammafunction , udupendra , Dhruva , alephnull, yaksha  and piezocake.

Answer:As almost everyone identified, these are Shamir, Rivest and Adleman, respectively. More famously known as the RSA from the RSA encryption system.

The easter egg in the pic is the little “(therefore) P = NP”  sign in the background. Reasons:
1) RSA would go bust if P = NP.
2) If P = NP they’d get a million bucks
3) It resembles the margin proof to Fermat’s last theorem.

16 Responses to “Public-ize this.”

  1. devadutta

    RSA, Declaring P=NP in the bg :)

  2. BiGFooT

    RSA . The Easter Egg being that their legendary brilliance intimidates NP to become P .
    Can you guys hear all the Travelling Salesmen say 'Amen'  ? :)

  3. nihit

    Ron Rivest, Adi Shamir and Leonard Adleman

    The RSA problem depends highly upon the assumption
    that P != NP…

  4. Poornima

    Ron Rivest, Adi Shamir and Len Adleman!
    The pic shows some proof for the unsolved problem P=NP

  5. jayanth

    ron rivest, adi shamir and len aldeman

  6. Gammafunction

    The prank is 'P=NP' on the board which is an unproved problem.I think the guy rightmost is Roger Penrose . part points at least :-)

  7. udupendra

    Rivest, Shamir, and Adelman. And they apparently have proved that P=NP, thus solving the most important question in computational theory, and winning themselves a million dollars as part of the Millenium Prize.

  8. Dhruva

    Ronald Rivest, Adi Shamir, Leonard Adleman
    P=NP made this a bit difficult :)

  9. alephnull

    RSA. From left to right, SRA. The 'therefore P=NP' on the blackboard, is, I presume the easter egg though I don't know the connection between the triumvirate and complexity classes.

  10. yaksha

    Ron Rivest, Adi Shamir, and Len Adleman
    The 3 researchers who invented the RSA  method.
    Method RSA is an asymmetrical cryptographic system
    the easter egg is DES key?

  11. piezocake

    Rivest, Shamir, Adleman.

  12. yaksha

    no the easter egg is P=NP

  13. alephnull

    Would RSA go bust if P=NP ? There is already an algorithm ( to factor integers in polynomial time. And the GNFS algorithm is sub-exponential anyway.

    Of course, it is true that more people are moving away from RSA to ECC, but there are compelling reasons for that apart from the margin of security afforded by the RSA algorithm.

  14. Srikanth

    alephnull: Well, yeah, but then quantum computers are a bit far away, aren't they? (Last I heard, those qubits were all randomly entangling with each other, and everything you encrypted would decrypt to questions about Schrodinger's cat :-) ).

    Also, sub-exponential may be OK for researchers who have loads of time but for a real-life implementation of the crack_rsa_warez.exe that most blackhats want, it's not going to cut it.  i.e., its still not computationally feasible if your RSA keys are large enough. In fact, 1024 itself is way beyond what the GNFS can currently do in our lifetime, i hear.

    I have to plead ignorance about ECC though. I never could understand what I read about it, so I shall refrain from commenting.

  15. alephnull

    Sure. I agree. I merely take issue with the statement "RSA would go bust if P = NP".

    Integer factorisation is P already, from what I can see. The fact that practical QC attacks on factorisation are still in the future is irrelevant, aiui. Anyway, margin of security is calculated from theory, not current state-of-the-art.

  16. Srikanth

    alephnull: I stand suitably corrected :-)

« Previous « Real Bugs too!? « | » Accepted/Rejected » Next »