Live data from Hacker News

Viewing profile — YAYERKA

YAYERKA

HN member
Joined
Tue, Sep 28, 2010, 6:04 AM UTC
HN karma
750
Public activity
134 items

About YAYERKA

H

Recent public activity

  1. story
  2. comment
    Comment #13225388

    I believe an natural segue here is to remind people about cryptopals (especially set 8). Ie., I don't have the chops and wouldn't attempt to writeup EC/DSA nonce bias and partial k…

  3. comment
    Comment #13225031

    lordnacho, as tptacek wrote below (which also applies to DSA); >a full repeat instantaneously destroys security with a single pair of signatures Roughly--assuming ECDSA parameters …

  4. comment
  5. comment
  6. comment
    Comment #10673901

    >Ralf-Phillip Weinmann had a good Black Hat presentation about this bug class. https://www.youtube.com/watch?v=PqW8-MUu09c https://comsecuris.com/research/slides-bignum-bhus2015.pd…

  7. comment
  8. comment
  9. comment
    Comment #10549139

    about the C; https://software.intel.com/sites/landingpage/IntrinsicsGuide...

  10. comment
    Comment #10462569

    Following the "List of my papers" section from the "Number Theory" page https://sites.google.com/site/jmptidcott2/nthy >Some authors even applied the name "kangaroo" to any random …

  11. comment
    Comment #10454733

    My mistake; 1978 Pollard's Rho algorithm for DLP. Was looking at Pollard's Rho for integer factorization at the time. On that note; what a monster this Pollard character. Wonder wh…

  12. comment
    Comment #10444109

    Thanks for your response; 1971 Shanks' BSGS improvement to 1974 Pollard Rho for DLP is indeed a nice example.

  13. comment
    Comment #10430118

    Thanks for posting; found many sections interesting especially 3.2; >3.2. Does NSA have an $n^{1/3}$-algorithm for finding elliptic curve discrete logs? ... In 2013 Bernstein and L…

  14. story
  15. story
  16. story
  17. story
  18. story
  19. comment
    Comment #9672778

    "Verification of a Cryptographic Primitive: SHA-256", Andrew Appel https://www.cs.princeton.edu/~appel/papers/verif-sha.pdf

  20. story
  21. comment
    Comment #9563007

    In a cryptographic context; >1.12 Definition >A function f from a set X to a set Y is called a one-way function if f(x) is “easy” to compute for all x \in X but for “essentially al…

  22. comment
  23. comment
    Comment #9561692

    For a slightly more mathematical introduction: https://www.youtube.com/watch?v=t3JzdKE-Fhs along with accompanying slides http://crypto.biu.ac.il/sites/default/files/3rd_BIU_Winter…

  24. story
  25. story