4-Sets-Cut-Decoding algorithms for random codes based on quasigroups

The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms and error-correcting codes. In our previous paper we proposed Cut-Decoding algorithm which is 4.5 times faster than the original one for code (...

Ausführliche Beschreibung