YAYERKA

5 ms·

1. 1.▲
   Backward Program Slicing for Binary Analysis with Ghidra(blog.react0r.com)

   2 points by YAYERKA 1mo ago|0 comments
2. 2.▲
   by YAYERKA 10y ago

   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 key exposure attacks better than you all--n
3. 3.▲
   by YAYERKA 10y ago

   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 (H,K,E,q,G) --where H is a hash function, E the Elli
4. 4.▲
   by YAYERKA 11y ago

   >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.pdf
5. 5.▲
   by YAYERKA 11y ago

   about the C; https://software.intel.com/sites/landingpage/IntrinsicsGuide...
6. 6.▲
   by YAYERKA 11y ago

   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
7. 7.▲
   by YAYERKA 11y ago

   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 what he is up to these days.
8. 8.▲
   by YAYERKA 11y ago

   Thanks for your response; 1971 Shanks' BSGS improvement to 1974 Pollard Rho for DLP is indeed a nice example.
9. 9.▲
   by YAYERKA 11y ago

   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 Lange described such an algorithm albeit with intract
10. 10.▲
    What Happened to the Crypto Dream?, Part 2 [pdf](randomwalker.info)

    2 points by YAYERKA 11y ago|0 comments
11. 11.▲
    What Happened to the Crypto Dream?, Part 1 [pdf](randomwalker.info)

    2 points by YAYERKA 11y ago|0 comments
12. 12.▲
    The Evolution of Authenticated Encryption (2013) [pdf](crypto.stanford.edu)

    3 points by YAYERKA 11y ago|0 comments
13. 13.▲
    Attacking ECMAScript Engines with Redefinition(googleprojectzero.blogspot.com)

    9 points by YAYERKA 11y ago|0 comments
14. 14.▲
    by YAYERKA 11y ago

    "Verification of a Cryptographic Primitive: SHA-256", Andrew Appel https://www.cs.princeton.edu/~appel/papers/verif-sha.pdf
15. 15.▲
    Lisp as the Maxwell’s equations of software (2012)(michaelnielsen.org)

    115 points by YAYERKA 11y ago|8 comments
16. 16.▲
    by YAYERKA 11y ago

    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 all” elements y \in Im(f) it is “computationally infea
17. 17.▲
    by YAYERKA 11y ago

    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_S... both
18. 18.▲
    Alberto Santos-Dumont(en.wikipedia.org)

    76 points by YAYERKA 11y ago|13 comments
19. 19.▲
    Freestart collision for 76-steps SHA-1(marc-stevens.nl)

    2 points by YAYERKA 11y ago|0 comments
20. 20.▲
    by YAYERKA 11y ago

    Here are links to the videos in a larger format; # Opening Remarks with Alex Stamos https://news.yahoo.com/video/yahoo-trust-unconference-alex-s... # Trust and the Future of SV with Alex Stamos and Frank Chen https:&#
21. 21.▲
    TLS with Adam Langley at Yahoo Trust Unconference(news.yahoo.com)

    1 points by YAYERKA 11y ago|0 comments
22. 22.▲
    by YAYERKA 11y ago

    Thanks for your comment. It brings up positive nostalgic memories for me. I grew up speaking, reading and writing three different languages, as well as constantly hearing another being yelled through the phone. Not sure about the article;
23. 23.▲
    Effective Go(golang.org)

    2 points by YAYERKA 11y ago|0 comments
24. 24.▲
    Intro x86 (32 bit) by OpenSecurityTraining(youtube.com)

    1 points by YAYERKA 11y ago|0 comments
25. 25.▲
    The Spy in the Sandbox – Practical Cache Attacks in JavaScript(arxiv.org)

    2 points by YAYERKA 11y ago|0 comments
26. 26.▲
    Ishango bone(en.wikipedia.org)

    7 points by YAYERKA 11y ago|2 comments
27. 27.▲
    CSE508: Network Security (PhD Section), Spring 2015(www3.cs.stonybrook.edu)

    1 points by YAYERKA 11y ago|0 comments
28. 28.▲
    MIT 6.858: Computer Systems Security(youtube.com)

    1 points by YAYERKA 11y ago|0 comments
29. 29.▲
    by YAYERKA 11y ago

    Here is a nice starting point for a generic rb tree structure in SML. (* generic red-black-tree in Standard Jersey ML *) type key = string datatype color = R | B datatype tree = E | T of (color * tree *
30. 30.▲
    by YAYERKA 11y ago

    If your project can get away without having to build your own images; I would recommend Amazon Linux to anybody using EC2. I've used Amazon Linux AMI's since 2012 on several different instances. At first `ps aux` you might think y