Tweetovi

Blokirali ste korisnika/cu @hashbreaker

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @hashbreaker

  1. Scientifically, it's surprising to see the lack of citation to time-lock puzzles and verifiable delay functions, which (1) similarly hope that latency limits can stop a massively parallel attacker from outperforming the verifier, and (2) choose harder-to-parallelize computations.

    Prikaži ovu nit
    Poništi
  2. Obvious attack that breaks the "certification" of randomness in : standard space-2^n computation of circuit state, parallelized as necessary to meet latency requirement. This attack is feasible since the "HOG" circuit verification step forces n to be small.

    Prikaži ovu nit
    Poništi
  3. This news reminds me of the European Space Agency in saying that "human beings" usually cannot "access flying spacecraft" so "there is no need for side channel attack protection". Serious attackers build machines to carry out attacks beyond human ability.

    Poništi
  4. 27. sij

    BSI filed comments with NIST claiming, falsely, that some Brainpool curves were "standardised in RFC 5639": NIST now proposes to officially allow the Brainpool curves in SP 800-186 for "interoperability". Comments due 29 Jan:

    Poništi
  5. 18. sij

    It's fascinating to compare how the same Salsa/ChaCha attack paper is described in ("very hard to estimate the security") and ("attacks don’t really get better"). How can we protect against confirmation bias?

    Poništi
  6. 9. sij

    Does Apple's "Find My" really force an otherwise quiet device to continuously broadcast its 15-minute visible identity (MAC addr, FM key, etc.)? Maybe safer: devices all try to switch identities at :00,:15,:30,:45, and do just 1 broadcast at a random time in each identity period.

    Poništi
  7. proslijedio/la je Tweet
    5. sij

    Competition: help advance cryptology and make it faster to verify signatures on really big messages, win a $1000 prize paid out of my own pocket.

    Prikaži ovu nit
    Poništi
  8. proslijedio/la je Tweet
    8. sij

    I'm very proud and thankful to have won one of the RWC2020 Levchin prize together with Xiaoyun Wang for our work on hash function cryptanalysis!!

    Poništi
  9. proslijedio/la je Tweet

    FYI: Currently involved with some folks in drafting a letter to ACM from its membership. If there are any similar initiatives please let me know so we can coordinate!

    Prikaži ovu nit
    Poništi
  10. proslijedio/la je Tweet
    30. pro 2019.
    Odgovor korisnicima

    I wonder how the comments would be if you had a co-author from a three-lettered agency 😜

    Poništi
  11. proslijedio/la je Tweet
    29. pro 2019.

    Awake before the evening talks on day 3 of ? Come to Borg at 17:30 for "High-assurance crypto software" with and me (unfortunately in parallel with talk by )

    Poništi
  12. 26. pro 2019.

    Did a few cleanups and updates to recognize optimizations in the latest versions of angr. Same URL.

    Prikaži ovu nit
    Poništi
  13. proslijedio/la je Tweet
    20. pro 2019.

    For those upset about the ACM signing a letter that is not only anti-open-access but also USA-centric (org is global), perhaps now is a good time to look up article 8.3 of the ACM constitution ().

    Poništi
  14. 23. stu 2019.

    Amazing compendium of failures of "provable security": . I saw a preprint months ago and the shock value of the huge lists still hasn't worn off. I think (and hope) this will put an end to the delusion that provable-security failures are isolated mistakes.

    Poništi
  15. 22. stu 2019.

    Final schedule online for ECC 2019, the 23rd Workshop on Elliptic Curve Cryptography: Still a few days left to register: We'll have to close registration at the end of the 27th to finalize arrangements for the dinner etc.

    Poništi
  16. 21. stu 2019.

    65.98 cycles/byte for SHA-512 on common Cortex-M4 microcontrollers (assuming all CPU options and no wait states). Best "optimizing" compiler result I've seen for reasonable C code is 110 cycles/byte, which is embarrassing for such a simple CPU. Does anyone have a better compiler?

    Poništi
  17. proslijedio/la je Tweet
    19. stu 2019.

    (wondering if I should do a mini-writeup on this, because I've seen more than one "what would pqsigs mean for TLS"-papers that undercount the overhead)

    Prikaži ovu nit
    Poništi
  18. proslijedio/la je Tweet
    16. stu 2019.

    Ten more days to go before the deadline for PQCrypto 2020 You can still update your submission till 3 December, but you must register your paper by 26 November. Looking forward to seeing you in Paris!

    Poništi
  19. proslijedio/la je Tweet
    15. stu 2019.

    Get your papers ready! Pre-deadline (must register your paper) is 26 Nov.

    Poništi
  20. 13. stu 2019.

    Registration links now open for ECC 2019, the 23rd Workshop on Elliptic Curve Cryptography: Only 115 EUR student registration, 230 EUR regular registration. Speaker list and draft schedule: Travel+hotels:

    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·