As a clarification for how this works: This election determines a new full-fledged moderator. Elections are for life-time. If a moderator steps down (in good standing) they can be reinstated again without a full election (following a defined process).
FYI: I have requested a new moderator election to find my successor. This is fully happening on good terms with everyone involved and there's no drama to be found here. I'm stepping down essentially because I no longer find myself spending much time on Crypto.SE and believe that it's not sensible for such a person to be a moderator. Thank you all for electing and supporting me as a moderator though <3 I will also post a message like this below the election announcement.
Claus Peter Schnorr recently posted a 12-page factoring method by SVP algorithms. Is it correct?
It says that the algorithm factors integers $N \approx 2^{400}$ and $N \approx 2^{800}$ by $4.2 \cdot 10^{9}$ and $8.4 \cdot 10^{10}$ arithmetic operations.
Does this lead to the conclusion that the R...
It's now May, and if Community Promotion or Open Source Ads are something you care about, you may have noticed that there hasn't been a 2021 refresh yet. In case you missed this post, please check it out for some details about why the refresh was pushed back, and why a project around the rethinki...
^ it has been suggested that some kind of merge be done with this question, however, I'm a bit unsure about the direction (i.e. whether the above should be the original or the others)
As it is mentioned above, I am confused about “Gen takes as input $1^n$ and outputs a key“. Does it mean that the input of Gen is 1111....111 with length of n?
Almost two years ago I ran a test for single vote closure/reopen on Hardware Recommendations after one of their moderators reached out to me about the strain of being the person doing most of the work to close questions on that site. Shortly after that, Shog9 ran a three-vote test on Stack Overfl...
I agree with the more exhaustive proposal initiated by kelalaka that a bulleted list might be helpful. However, I think we should keep it contained to the most common issues we encounter and leave the exhaustiveness to our Help Center. So instead my below suggestion focuses on our four close reas...
what you could probably do is copy the state after the update step, finalize the copy and send the hash falling out of that, continuing to update the "original" state
the best illustration for how hashes process data is typically that you initialize state, then update state (which either buffers the input or triggers a compression call with the buffer and the state) and then a finalization step
Brief Description
Cryptocurrency, not Cryptography
Finding a few words that encapsulate the sentiment of this close reason is tricky. This is my attempt to encapsulate that cryptocurrency is not always cryptography while keeping the sentiment that we only ban questions about non-cryptographic a...
It definitely looks like y'all need some help disambiguating cryptography from cryptocurrency and this seems like a good place to start - that said, this still requires that y'all do the work of closing the questions after the fact. I'd suggest y'all take some time to craft more customized text f...
Limits on casting votes
The SE network defines a "day" by the UTC/GMT clock. New days start at 00:00:00 UTC/GMT. (The current UTC time is always available to logged-in users.)
Post votes (votes on questions and answers; upvotes and downvotes count the same)
The exact number of votes available d...
(i.e. a paper or set of papers doing fancy things with random numbers and potentially even having random number generation as a serious performance concern)
I'm currently writing a thing about accelerating things with better AES implementations. Given my previous answer (mattermodeling.stackexchange.com/a/1682/1128) it seems matter modelling people do a lot of randomized simulations requiring lots of random numbers. Do you guys by chance have a default paper to reference for such things?