I'm implementing a MQ polynomial system for GOST 28147-89 cipher. The idea is similar to polynomial system construction in mq.SR for AES and *ctc.py* for Courtois Toy Cipher by Martin Albrecht. And I'm wondering what is the best way to test correctness of the system.
What I've implemented so far: 1. replacing every variable by intermediate encryption bits to test the correctness of each equation (system should result 0); 2. extracting first round of the system, injecting plaintext and key values and solving this one-round system. The resulting variables should be equal to the ciphertext after the first round. Are these two tests enough for making sure the system is correct or are there any better solutions to this? Thanks! -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
