Скачать или смотреть A Search to Decision Reduction for Code Equivalence

Abstract: Finding an algorithm that efficiently determines if two codes are equivalent is an open problem in coding theory. It is important to know whether such an algorithm exists because if it does not, we can use code equivalence as a way to safely encrypt information, potentially even against quantum computers. In this talk, I will show a way to efficiently construct an equivalence between 2 codes by asking an oracle multiple yes or no questions. As a disclaimer, this process does not yet solve the code equivalence problem, but instead reduces it to a different problem. No prior knowledge of coding theory is necessary for this talk, but basic linear algebra (basis, vectors, matrices) is recommended.
Phillip