The paper investigates secrecy systems with additive-like instantaneous block encipherers subject to the error probability criterion. It is shown first that good ciphers for this system are bad codes for an associated discrete memoryless channel (DMC). Then asymptotically worst channel codes for any DMC are constructed explicitly. Applied to the secrecy system, this result gives an asymptotically optimal solution for the enciphering problem.