Improving the Performance of the SYND Stream Cipher

Abstract

proposed the stream cipher SYND as an improvement of the pseudo random number generator due to Fischer and Stern. This work shows how to improve considerably the efficiency the SYND cipher without using the so-called regular encoding and without compromising the security of the modified SYND stream cipher. Our proposal, called XSYND, uses a generic state transformation which is reducible to the Regular Syndrome Decoding problem (RSD), but has better computational characteristics than the regular encoding. A first implementation shows that XSYND runs much faster than SYND for a comparative security level (being more than three times faster for a security level of 128 bits, and more than 6 times faster for 400-bit security), though it is still only half as fast as AES in counter mode. Parallel computation may yet improve the speed of our proposal, and we leave it as future research to improve the efficiency of our implementation.

RankSynd a PRNG Based on Rank Metric

“…n n-k d GV (n, k) w security data size key size cycles/bytes 31 18 11 In the second table, we optimize the speed of the generator at the cost of data size (but still with small matrix sizes compared to SYND and XSYND). We obtain speeds comparable to those of SYND [13] and we are less efficient than XSYND [26]. But we can always increase the parameters to improve the speed of the generator.…”

“…Recent works [13,26] have proven that PRNG based on the syndrome decoding (SD) problem could be almost as fast as PRNG based on AES. However the PRNG based on the SD problem have to store huge matrices.…”