Bit-complete block codes are defined and their construction utilizing generalized rotor operations 5 is shown to result in codes with considerable resistance to analysis. The use of random rotors in the generalized rotor operations of these codes is shown to result in one-way functions as well as non-invertible pseudo-random sequence mixers.
展开▼
