plopilop

9 ms·

61.
Post-quantum cryptography: selected algorithms 2022(csrc.nist.gov)
4 points by plopilop 4y ago|0 comments
62.
by plopilop 4y ago
Mhh, while what you are saying is not wrong (though I'm not convinced about the constant thing, given everything is asymptotic), it's a bit imprecise. A more exact formulation would be m^(1+o(1)) is equal to m^(1 + eps(m)) for som
63.
by plopilop 4y ago
Word has had automatic reference numbering for a while now (see for instance [0]). Not denying that it's not very known (nor pleasant to use), and I'm not even talking about bibliography. I made my partner switch to Latex thanks t
64.
by plopilop 4y ago
Here in France: I had a ~1 900€ salary after taxes (incl. income tax, 2 000€ otherwise) but because I was working in a company fulltime (the contract stated I was to devote myself 100% to my research, the reality was different but that&#x27
65.
by plopilop 5y ago
I mean, we can get a more real example easily. Amazon had an AI recruiting tool that was biased against women. The explanation is very simple, the training dataset of successful hires mostly consisted of males so the AI though nothing bette
66.
by plopilop 5y ago
Maybe Stripe is not that much popular in Poland compared to other countries? I would not be surprised that they put priority on the countries where they already have a significant user base.
67.
by plopilop 5y ago
In practical terms, non secret chats messages are stored, more or less cleartext, on Telegram servers. In this sense, yes, it is much less secure than Whatsapp. Though I don't know if, in whatsapp, the metadata is also e2e encrypted
68.
by plopilop 5y ago
I would not use a blockchain (nor anything else) for e-voting to be honest. While I could get somewhat confident with some of the e-voting protocols (and that's not a given), it means that citizens should trust a protocol (and an imple
69.
Towards secure blockchains (2019) [pdf](bsi.bund.de)
1 points by plopilop 5y ago|0 comments
70.
by plopilop 6y ago
The website does not seem to have been updated but the prediction security of PCG has been fully broken recently (and does not rely on the "Challenging" part of the spectrum): https://hal.inria.fr/hal-02700791&#x2F
71.
Privacy Badger Is Changing to Protect You Better(eff.org)
157 points by plopilop 6y ago|97 comments
72.
by plopilop 6y ago
Not American, what is the difference between CV and resume? I always assumed they were synonyms.
73.
by plopilop 6y ago
I don't think this works mod N. Since N is not a prime, you have no guarantee that for k your base, c belongs to the multiplicative group generated by k. Take for instance N = 15, you can't find a log base 12 of 7, for instance (1
74.
by plopilop 6y ago
I don't think so. Computing the discrete log of g^x assumes g to be known. In RSA the ciphertext is c = m^e and by definition, m is unknown. The reverse operation of RSA is the modular e-th root, not the discrete log.
75.
by plopilop 6y ago
Nitpicking, but RSA does not rely on the DLP, rather on factorisation and modular roots. I guess you meant Elgamal or Diffie-Hellman?
76.
by plopilop 6y ago
> Couldn't I simply "brute force" the hop count? Well, yes and no. Yes, the bruteforce attack is a valid one. No, because usually the private key is around 256 bits, so you need to compute 2^255 hops on average to find the
77.
by plopilop 6y ago
Big mistake in the article: the discrete log is not a trapdoor function, as far as we know, and elliptic curve crypto does not rely on trapdoors. A trapdoor function is when you have a function hard to invert (for any x, given y = f(x), fin
78.
Approaching Optimal Duplicate Detection in a Sliding Window [pdf](arxiv.org)
2 points by plopilop 6y ago|0 comments
79.
by plopilop 6y ago
I'm curious, how does it work in the US? In Europe, you first study 3 years to get a bachelor's degree, then 2 more years for a master's degree (or an engineer degree), then you apply for a PhD which is supposed to last 3 y
80.
by plopilop 6y ago
The authors give the following factorization with their algorithm: 231037 = 499 * 363. Not only is the product not equal to 231037, but 363 is also clearly not a prime as it is divisible by 3. There is no discussion whatsoever about this fa
81.
by plopilop 7y ago
Well science goes frutstratingly slowly, especially in these fields. According to wikipedia the project has helped in 118 papers. The idea of the single scientist singlehandedly solving everything is mostly a myth. Most of the time, people
82.
by plopilop 7y ago
(it's the other way round, e^(ix) = cos(x) + i sin(x))
83.
by plopilop 7y ago
When I lived in Paris, I used (for various jobs) lines 2, 6 and 13 to commute, also RER B. The mere idea of getting a seat during rush hour was delusional. I remember once, at Denfert-Rochereau, I had to let two RER go to the south withou
84.
by plopilop 7y ago
> I think this is just what Google does when it thinks you're a "bot": i.e. they don't know who you are. Maybe this is to prevent adversarial learning? If the images reload immediately, then the bot can learn (via a n
85.
by plopilop 7y ago
Definitely french, linguee translates it as "commonplace", or "cliché"
86.
by plopilop 7y ago
> Furthermore the math presented in this book are all taught in 1st year courses for most CS programs I’ve encountered. From what I see this book is much more complete than a first year course, or even the whole curriculum of a classical
87.
by plopilop 7y ago
The most common reason I've heard for not releasing the code is "because it's ugly". And truth to be told, many researchers do code horribly.
88.
by plopilop 7y ago
Almost happened to me. My paper got accepted, and one reviewer suggested an improvement of how I did the benchmarks. Doing so I noted a bug in my code, but thank god the bug was hindering the performances of my solution, so in the end my re
89.
by plopilop 8y ago
The number of functions (or rather programs) is countable though, as we can think of them as Turing machine. A Turing machine is a set of the form (states, transitions). Given that a Turing machine has finite number states and transitions,
90.
by plopilop 8y ago
From my layman point of view, this can lead to two different conclusions: * The DNN is actually getting close to the way human brain works, as it falls into the same mistakes as the human eye; * There is some kind of universality in these i

More ›