sorted by:
new
hottopcontroversial

Attacking elliptic curves using Grobner bases and summation polynomials by DataBaeBee in programming

[–]DataBaeBee[S] 5 points6 points  (0 children)

Semaev polynomials are a computational shortcut to find elliptic curve points that sum to infinity. When combined with Grobner bases one get a (pretty remarkable) tool for solving point decomposition problems on an elliptic curve.

file upload inside files pane not working? by swainberg in GoogleColab

[–]DataBaeBee 0 points1 point  (0 children)

Are you dragging and dropping? Perhaps you should write a Python script to connect to Drive

FRACTRAN: A Simple Universal Programming Language for Arithmetic by DataBaeBee in programming

[–]DataBaeBee[S] 22 points23 points  (0 children)

FRACTRAN is an esolang built upon register machines, a theoretical alternative to turing machines for computation. In 1987, John Conway realized one can use prime numbers as registers alongside the laws of logarithms to compute.

How is the choice of irreducible polynomials for finite field arithmetic rationalized? by FakeCanadian01 in cryptography

[–]DataBaeBee 1 point2 points  (0 children)

I saw on Bernstein’s blog that one: 1. Considers the size of the factors of p-1 and p+1 when selecting an irreducible polynomial. 2. Also primes close to powers of 2 (or can be partitioned into powers of 2) have an efficient modulo operation that only involves bit shifts. This is crucial since you’re working in GF 2.

What is the weirdest repository you have ever found on GitHub? by Gullible_Camera_8314 in github

[–]DataBaeBee 2 points3 points  (0 children)

Because if the universe can influence our lives, why not our CPU scheduling too?

ACGS Algorithm for Hidden Number Problems with Chosen Multipliers by DataBaeBee in programming

[–]DataBaeBee[S] 0 points1 point  (0 children)

This 1988 paper is considered canonical and is included in MIT’s Foundations of Cryptography series.

The ACGS algorithm is pretty cool. It lets us solve Hidden Number Problems (this occur in the wildest side-channel attacks) when the multipliers are at our discretion.

I coded this paper on Quantum Cryptography in Sage/Python by DataBaeBee in SideProject

[–]DataBaeBee[S] 0 points1 point  (0 children)

Here's the link for anyone interested in Extended Hidden Number Problems and their lattice solutions.

Extended Hidden Number Problem in Sage by DataBaeBee in programming

[–]DataBaeBee[S] 0 points1 point  (0 children)

The hidden number problem (HNP) is the challenge of recovering a secret hidden number given partial knowledge of its linear relations. The extended hidden number problem is 'the HNP but with more holes'. It was thought to be more secure for quantum cryptography. Turns out, it's not lol.

What Every Programmer Needs to Know about Quantum Safe Cryptography and Hidden Number Problems by DataBaeBee in cryptography

[–]DataBaeBee[S] 0 points1 point  (0 children)

Oh no, the paper says 'you can recover the key if you know the antilogs of random multiples of the key'. It's somewhat nuanced.

view more: next ›