Method for checking an m of n code

Abstract

The invention relates to a method and a circuit configuration for checking an m of n code. The method uses a code checker with which at least one code reducer (304, 306, 308) is associated, wherein a reduction of the code word width to half thereof is carried out by means of the at least one code reducer (304, 306, 308), until a 1 of x (x = n / 2, n / 4, n / 8...) code or another code that cannot be further reduced in said manner is present, wherein each stage of the code reducer (304, 306, 308) is additionally connected to different bits of a counter, wherein the 1 of x code or the code that cannot be further reduced is checked and the signal pairs of each stage are additionally checked.

Description

technical field [0001] The invention relates to a method for checking m-out-of-n codes and a circuit arrangement, which is also referred to as a tester or checker, for carrying out the described method. Background technique [0002] Redundant codes are used in safety-relevant systems in which error cases are detected by code checkers and critical cases can thus be avoided. Taking m codes out of this n also works. Furthermore, random generators are required for cryptographic applications, which are based on NIST (National Institute of Standards and Technology) recommendations (see separate publication "Recommendation for Random Number Generation Using Deterministic Random Bit Generators", SP 800-90, March 2007) should have a self-test. For any deterministic random generator, the implementation of the self-test can involve high costs. If an m-of-n code is applied for implementation, the proposed self-test can be implemented simply by a code checker. [0003] An m-out-of-n ...

AI Technical Summary

Problems solved by technology

If the key is masked with the resulting bit vector, then the key's originally set protection against side-channel attacks is completely or at least partially lost

Images