In this paper,a sufficient and necessary condition of quick trickle permutations is given from the point of inverse per-mutations. The bridge is built between quick trickle permutations and m-value logic functions. By...In this paper,a sufficient and necessary condition of quick trickle permutations is given from the point of inverse per-mutations. The bridge is built between quick trickle permutations and m-value logic functions. By the methods of the Chrestenson spectrum of m-value logic functions and the auto-correlation func-tion of m-value logic functions to investigate the Chrestenson spectral characteristics and the auto-correlation function charac-teristics of inverse permutations of quick trickle permutations,a determinant arithmetic of quick trickle permutations is given. Us-ing the results,it becomes easy to judge that a permutation is a quick trickle permutation or not by using computer. This gives a new pathway to study constructions and enumerations of quick trickle permutations.展开更多
基金the Opening Foundation of State Key Labo-ratory of Information Security (20050102)
文摘In this paper,a sufficient and necessary condition of quick trickle permutations is given from the point of inverse per-mutations. The bridge is built between quick trickle permutations and m-value logic functions. By the methods of the Chrestenson spectrum of m-value logic functions and the auto-correlation func-tion of m-value logic functions to investigate the Chrestenson spectral characteristics and the auto-correlation function charac-teristics of inverse permutations of quick trickle permutations,a determinant arithmetic of quick trickle permutations is given. Us-ing the results,it becomes easy to judge that a permutation is a quick trickle permutation or not by using computer. This gives a new pathway to study constructions and enumerations of quick trickle permutations.
