69 problems
For every integer and every APN permutation , let be the unique reduced polynomial representative of w…
The supplied source describes the Jouart conjecture as asserting that the indices for which is prime exhibit a regular exclusion structure characterized by two f…
Let and . For each , let be independent copies of a pair of bits with joint distribution, with rows indexed by and…
A signal is a real sequence , and the two observations to distinguish are the noise sequence and its translate by . The question is: “If , wha…
“It is known that it is possible to establish correspondence between certain NP-hard graph problems and problems in group theory; we would like to expand our portfolio of such prob…
We would like to use computational problems in group theory to derive fundamental cryptographic objects including one-way functions and multilinear maps. AimPL: Post-quantum group-…
The question is posed as a research direction: “Several cryptanalytic methods against group-based cryptography suggest possible use cases for infinite non-abelian groups; for examp…
The question is stated as follows: “Generally speaking the field does not seem to offer methods of key establishment. It remains open to construct standard key exchange protocols a…
The stated research direction is: “In general very little work exists on efficient implementation of group-based protocols; over time we would like to build up a software library o…
Problem 2.2 asks: “Across the various group-based protocols there is a general lack of precision on which parameter specification. As the field matures we should make available cha…
The stated research direction is: “We would like to use generic group-action tools to build ring signatures, blind signatures, threshold signatures and more. We would also like to…
The stated question is: “There have been some results in the application of machine learning to the cryptanalysis of lattice-based schemes; whether these methods translate to the g…
We would like to solidify the credentials of group-theoretic cryptography as post-quantum by developing lower bounds for the quantum complexity of problems arising in group theory.…
For a finite monoid with identity , an endomorphism , and elements , the semidirect discrete logarithm problem asks for the set of nonnegative int…
“In the design of the hash function one has control over two parameters; the dimension of the special linear group considered, and the characteristic of the underlying field. We wo…
Set … The question, in its stated form, is: “Compute short units in the ring of integers of . How short can they be, and how fast can you find th…
“Is there a crypto problem that is solved by Simon’s algorithm without superposition attackers? Which hidden subgroup problems have crypto applications? Or non-crypto instances?” T…
Let be the supersingular curve in the question, with endomorphism order , and let be its ideal class gr…
Are there CSIDH attacks better than hidden shift? What is the cost of the hidden shift attack? In the usual key-recovery setting, let be the relevant imaginary quadrat…
Can quantum algorithms be used to attack SIDH by using the extra points? Are there SIDH attacks better than claw-finding? In this question, “extra points” refers to the torsion-poi…
How does Kuperberg’s algorithm behave under multiple hidden shifts (with known relations between shifts, e.g. arithmetic progression) with Gaussians, using the work of Ivanyos, Pra…
Hidden shift on where and are periodic under unary oracle cost. AimPL: Quantum algorithms for analysis of public-key crypto Background In the standard hid…
What is the cost of hidden shift on where the shift , under binary cost of oracle?
The question as posed is: “Is there a fast hidden shift algorithm for Heisenberg group over ?” It does not specify the hidden-shift promise, the oracle or input model,…
How much noise is tolerated in hidden shift algorithms? Consider too many solutions vs. too few. The question does not specify a noise model, a class of hidden-shift instances, or…