Sign in

On the computational hardness of the code equivalence problem in cryptography.

Alessandro BarenghiJean-François BiasseEdoardo PersichettiPaolo Santini
Published in: Adv. Math. Commun. (2023)
Keyphrases
  • cellular automata
  • data sets
  • case study
  • computational complexity
  • source code
  • information theoretic
  • mathematical programming
  • real time
  • data mining
  • worst case
  • software development
  • intrusion detection