Open AccessOn the computational hardness of the code equivalence problem in cryptography
Author(s) -
Alessandro Barenghi,
JeanFrançois Biasse,
Edoardo Persichetti,
Paolo Santini
Publication year - 2022
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2022064
Subject(s) - equivalence (formal languages) , cryptography , mathematics , coding theory , theoretical computer science , coding (social sciences) , code (set theory) , focus (optics) , algorithm , computer science , discrete mathematics , programming language , statistics , physics , set (abstract data type) , optics
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom