A proof-of-concept SageMath implementation of the paper
An Improved Algorithm for Code Equivalence
available at https://eprint.iacr.org/2024/1272
-
lep_solver.sagecontains the novel algorithm for solving the linear code equivalence problem (LEP). -
cf.sagecontains the underlying canonical form function. -
demo.sagegenerates a LEP instance with parameters$q=7$ ,$n = 20$ ,$k = 10$ , and uses the novel algorithm to solve it. -
utils.sagecontains some helper functions. -
test_cf.sageextensive test of the underlying canonical form function.