LeanProofs.Crypto.Cl60Conjugation
DefinitionGrade4_LeanProofs_Crypto_Cl60Conjugationclifford-algebraleanproofs-grade4rosetta
Foundational definitions and structural lemmas from LeanProofs.Crypto.Cl60Conjugation, required by the selected LeanProofs theorem graph.
Definition code
/- Rotor conjugation as a group action on Cl(6,0). Builds the algebraic skeleton needed for "hard homogeneous space" cryptographic constructions on the 6D Euclidean Clifford algebra. The rotor conjugation action F ↦ R F R̃ is the candidate group action for post-quantum key exchange built on Spin(6) ⊂ Cl(6,0)⁺. The vectorization problem (given F and R F R̃, find R) is the conjectured hard problem; this file does NOT prove hardness — it formalizes the underlying algebraic structure on which the protocol is defined. Out of scope (cryptanalytic, not formalizable here): - Quantum/classical complexity of conjugacy search in GL(8,𝔽_p) - Concrete parameter sizing for bits of security - Anshel-Anshel-Goldfeld non-abelian protocols Paper reference: hard homogeneous space discussion (post-quantum crypto). -/ import Definitions.Def_Grade4_LeanProofs_Foundations_Cl60Def import Definitions.Def_Grade4_LeanProofs_Foundations_UniversalAlgebra import Definitions.Def_Grade4_LeanProofs_Foundations_Cl60CommTable namespace LeanProofsGrade4P2M namespace Cl60Conj end Cl60Conj end LeanProofsGrade4P2M
Source