mti

8 ms·

1.
by mti 8d ago
In a serious discipline like mathematics, this isn't just an asshole move, but a career-ending level of academic misconduct.
2.
The role of AI companies in large formalisation projects(leanprover.zulipchat.com)
3 points by mti 6mo ago|0 comments
3.
by mti 1y ago
Good point. Note however that PIR is a rather restricted form of search (e.g., with no privacy for the server), but even so, DEPIR has polylog(n) queries (not log n), and requires superlinear preprocessing and a polynomial blowup in the siz
4.
by mti 1y ago
There is an even more fundamental reason why FHE cannot realistically be used for arbitrary computation: it is that some computations have much larger asymptomatic complexity on encrypted data compared to plaintext. A critical example is da
5.
by mti 1y ago
While not mentioned by the author, there is an alternate reason why finite field DH can be seen as a special case of ECDH, kind of: namely, there exists special elliptic curves (actual, smooth projective curves) that do have an efficiently
6.
by mti 1y ago
The relevant category is really abelian group schemes (because DH necessarily works in a cyclic group), so 0 is quite reasonable.
7.
by mti 2y ago
Elligator is only tangentially relevant to the hashing problem. If "doesn't have a problematic structure" is understood in a weak sense, then this was already solved by Shallue and van de Woestijne almost a decade prior to th
8.
by mti 4y ago
In that spirit, my pet "a monad is a monoid in the category of endofunctors, duh"-style one-line explanation of the Fourier transform is that it's just the decomposition in the common (Hilbert) eigenbasis for all translation
9.
by mti 4y ago
A map of algebraic curves is not a special case of a map between two sets. There aren't really source and destination sets to speak of. The fact that it is given by polynomials really is a definition. The moral "justification&
10.
by mti 4y ago
NTRU also relies on cyclotomic rings, so if distrust in cyclotomics was a good reason to reject Kyber, it would apply to NTRU too.
11.
by mti 7y ago
The hardness of discrete logs over fields doesn't have much to do with the hardness of elliptic curve discrete logs. At this stage, I don't think we have any evidence that curves over binary fields are less secure than over prime
12.
Alice's Adventures in Numberland(math.uci.edu)
1 points by mti 9y ago|0 comments
13.
by mti 9y ago
That's what we call a "fired if you do, fired if you don't" kind of situation.
14.
by mti 10y ago
I'm not sure what specific scheme you have in mind, but while FHE for Turing machines does exist, it is really, really hard to instantiate. A construction with some restrictions and requiring a massive amount of preprocessing is given
15.
by mti 10y ago
I don't think most of the issues with freedom of speech in France would be of much concern to a putative startup founder, but they are real. For example, "expressing support for acts of terror" is an imprisonable offense, and
16.
by mti 10y ago
> I'm of the opinion that worked examples are often worse than no documentation. That's completely baffling to me so I'd be really curious to hear your reasons (or those of someone who shares that opinion, as there are oth
17.
Poor worker conditions power gig economy(youtube.com)
23 points by mti 10y ago|9 comments
18.
by mti 10y ago
The claim was that they are independent, in the sense that they do not depend on monied interests for their financial survival, and have a real commitment to investigative journalism. I think even their opponents will acknowledge that they
19.
by mti 10y ago
Regular humans have, for over half a century, possessed the ability to annihilate the entirety of civilization by basically pushing a button. So it always amazes me when people feel the need to make science fictional assumptions like AGI in
20.
by mti 10y ago
> Elsevier's role isn't finding collaborators - it's finding reviewers This is also not true. It's usually journal editors who find reviewers. This is mostly unpaid work as well (publishers tend to chip in a bit for e
21.
by mti 10y ago
> Wall Whitman Is that what he will be known as from now on? :) On a more serious note, it's interesting to reread his poem _America_, which was certainly written more as an aspiration than a description at the time. However, this e
22.
My secret life as a fake reviewer of women’s lingerie(scroll.in)
1 points by mti 10y ago|0 comments
23.
by mti 10y ago
Here in Japan, the NURO Hikari service of Sony Network Communications offers FTTH with 10 Gbps downlink and 2.5 Gbps uplink speeds for around ¥6500 (~65 USD) per month. It's only available in the central wards of Tokyo and a part of Ka
24.
by mti 10y ago
Obfuscation is different from homomorphic encryption, and in some sense much more powerful. With homomorphic encryption, Alice can send some secret data to Bob in encrypted form, and let Bob carry out computation on that encrypted data. How
25.
by mti 10y ago
Not completely clear to me what you mean by "calculated to be true", but you may want to look at the difference between computational and statistical zero knowledge. A computational ZK proof hides the witness from computationally
26.
by mti 10y ago
Another reason why you won't see practical applications for a while is that we aren't really sure yet whether indistinguishability obfuscation exists at all. The first proposed construction has recently been broken [1], and while
27.
by mti 10y ago
LWE and SIS-based cryptography absolutely is lattice-based crypto, and I can't really imagine what other kind of scheme you would deem more deserving of the name than those. Even the epitome of classical lattice-based crypto, Ajtai-D
28.
by mti 11y ago
> Why don't we just look for a curve and field which has prime order We very often do. These days, though, cofactors of 2, 3, 4 or perhaps 8 are getting more common because people like to use curves with more efficient/easier t
29.
by mti 12y ago
A few years ago, Charlie Hebdo fired cartoonist Siné over a relatively innocuous joke about Jean Sarkozy (the son of then president Nicolas Sarkozy) planning to convert to judaism in order to marry into the family of the founders of superma
30.
by mti 12y ago
It certainly depends on the precise arithmetic being used, but for the usual complete addition law, for example, I'm pretty sure I can recover k from the computation of [k]P where P is of the form (0,y) (or (0:Y:1) in the projective ca

More ›