The Side Channel

« first day (3266 days earlier) ← previous day next day → last day (1410 days later) »

12:03 AM

@SEJPM I'm not sure if this is something you can see, but how many individual users visit crypto.se per week? crypto.se has some familiarity to the people. I don't see that on the other sites.

9 hours later…

SEJPM

8:41 AM

@bdegnan 25k users can see "visits" (which I think is the number of site interaction sequences) and that is at ~50k/week vs the total page views ~85k/week (the ratio between them being somewhat stable over time)

there's also ~13k "new visits" per week

we also have a relatively stable core user base, with ~300 people doing something on the site each week and 1000-2000 different people visiting the site per week

(and a stable core group doing things on five days per week)

(the last two messages are based on mod-only data)

1 hour later…

b degnan

10:11 AM

That ~300 number was what I was looking for.

7 hours later…

kelalaka

4:58 PM

@SEJPM your last answer is going to hit HNQ. It is better if it includes the definition of the Fermat Theorem in the answer instead of link, etc.

4 hours later…

user1271772

8:52 PM

Hi everyone, there was a recent HNQ about large numbers (like RSA numbers or number of cryptographic relevance). I wonder if anyone here might have an alternate answer to this question, maybe from the cryptography perspective?

Q: Did the 2019 discovery of O(N log(N)) multiplication have a practical outcome?

Some time ago I've read this news article, Mathematicians Discover the Perfect Way to Multiply, reporting a discovery published in 2019, where Harvey and Hoeven[1] found a algorithm able to execute multiplication in $N \log N$ steps. Compare with the $N^2$ we are used to while doing multiplicati...

kelalaka

9:08 PM

@user1271772 I would like to note that, a few levels of karatsuba was very handy in my research.

user1271772

@kelalaka Wow!

Is there anything you can add to the answer? Or any alternative answer you can give, about the relevance of these algorithms?

kelalaka

Full recursive was not a good idea, especially in VHDL stuff

user1271772

The answer so far is basically saying that all those algorithms are only of "academic" interest and don't have practical consequences.

kelalaka

Not exactly that.

he Toom-Cook algorithms (such as Karatsuba) are useful in number theory, and in fact we use them every day when we do e-banking or when we use GitHub involving RSA keys, since RSA numbers are hundreds or thousands of digits long.

In the end, they say Conclusion: The 2019 algorithm for integer multiplication does not affect real-world applications.

I think the realworld = Materials Modeling

user1271772

9:43 PM

@kelalaka Would you consider adding something about the practical use in number theory, as an alternative answer?

kelalaka

9:59 PM

It wouldn't be a good answer. Maybe Thomas, Poncho, Fgriue or someone else will.

user1271772

@kelalaka Cool! Maybe if someone answers it I can put a retroactive bounty on it to "reward an existing answer"

@fgrieu seems to be pingable, but Poncho and Thomas are not.

Should I comment on one of their posts?

kelalaka

10:13 PM

Thomas and poncho are not active users of chat.

user1271772

10:39 PM

@kelalaka So I should comment on one of their posts, to ping them?

Crypto HNQ

11:32 PM

Q: Negative numbers with additive ElGamal

I'm trying to implement Private Set Intersection using the additive ElGamal public key encryption system. The code I've written can encrypt and decrypt numbers using the ElGamal system, so far so good. Adding and multiplying the cipher also works. Or at least, it works with positive numbers. As I...