Cryptanalysis of SDLP
Post-quantum group-based cryptography · Historical workshop question
Inferred from the community field; finer classification has not been reviewed.
Problem statement
On the quantum side the question of quantum equivalence of SDLP and the CDH-type problem underpinning semidirect product key exchange (SCDH) remains unproven, though we have strong cause to suspect their equivalence given the quantum equivalence of the heavily related vectorisation and parallelisation problems. The decomposition attack of Imran and Ivanyos, providing in some cases a reduction of SDLP to the abelian hidden subgroup problem, relies on the quantum ability to quickly compute a composition series of a solvable group. Whether similar quantum speedups in the computation series exist for non-solvable groups remains open.
On the classical side, we would like to develop a kind of Sylow theory for the projected sets implied by the semidirect product structure. It would also be useful to develop a classical method of computing the size of the acting group when one considers the semigroup variant of SDLP (currently we have only quantum methods).
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Section context
Open problems in the analysis of some of the schemes discussed at the workshop.
Question context
Various problems relating to the cryptanalysis, both quantum and classical, of SDLP remain open.
Progress & source assessment
Historical workshop record. Current open/solved status has not been independently reassessed.
The source supplies no status note for this question.
- [1]Post-quantum group-based cryptography link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.