Tweetovi
- Tweetovi, trenutna stranica.
- Tweetovi i odgovori
- Medijski sadržaj
Blokirali ste korisnika/cu @hashbreaker
Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @hashbreaker
-
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 nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Obvious attack that breaks the "certification" of randomness in https://www.scottaaronson.com/talks/certrand2.ppt …: 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 nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
This news reminds me of the European Space Agency in https://hyperelliptic.org/DIAC/slides/ESA-Contribution-to-DIAC-2012.pdf … 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.https://twitter.com/M_R_Thomp/status/1222990126650994698 …
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
BSI filed comments with NIST claiming, falsely, that some Brainpool curves were "standardised in RFC 5639": https://csrc.nist.gov/csrc/media/publications/fips/186/4/final/documents/comments-received-fips186-4-december-2015.pdf … NIST now proposes to officially allow the Brainpool curves in SP 800-186 for "interoperability". Comments due 29 Jan: https://www.federalregister.gov/documents/2019/10/31/2019-23742/request-for-comments-on-fips-186-5-and-sp-800-186 …
@ietfHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
It's fascinating to compare how the same Salsa/ChaCha attack paper https://tosc.iacr.org/index.php/ToSC/article/view/574 … is described in https://keccak.team/2017/not_arx.html … ("very hard to estimate the security") and https://131002.net/data/talks/TMC-RWC20.pdf … ("attacks don’t really get better"). How can we protect against confirmation bias?
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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.
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
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.https://mindsarentmagic.org/2020/01/04/1000-tcr-hashing-competition/ …
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
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!!
#realworldcryptoHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein 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 nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
I wonder how the comments would be if you had a co-author from a three-lettered agency
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
Awake before the evening talks on day 3 of
#36C3? Come to Borg at 17:30 for "High-assurance crypto software" with@hashbreaker and me https://fahrplan.events.ccc.de/congress/2019/Fahrplan/events/10893.html … (unfortunately in parallel with talk by@Snowden )Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Did a few cleanups and updates to recognize optimizations in the latest versions of angr. Same URL.
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
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 (https://www.acm.org/about-acm/acm-constitution …).
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Amazing compendium of failures of "provable security": https://eprint.iacr.org/2019/1336 . 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.
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Final schedule online for ECC 2019, the 23rd Workshop on Elliptic Curve Cryptography: https://eccworkshop.org/2019/schedule.html … Still a few days left to register: https://eccworkshop.org/2019/reg.html We'll have to close registration at the end of the 27th to finalize arrangements for the dinner etc.
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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?
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
(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 nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
Ten more days to go before the deadline for PQCrypto 2020 https://pqcrypto2020.inria.fr/ 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!
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Daniel J. Bernstein proslijedio/la je Tweet
Get your papers ready! Pre-deadline (must register your paper) is 26 Nov.https://twitter.com/IACR_News/status/1173944708571246592 …
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Registration links now open for ECC 2019, the 23rd Workshop on Elliptic Curve Cryptography: https://eccworkshop.org/2019/reg.html Only 115 EUR student registration, 230 EUR regular registration. Speaker list and draft schedule: https://eccworkshop.org/2019/schedule.html … Travel+hotels: https://eccworkshop.org/2019/travel.html …
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoniš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.