A method and a circuit configuration for generating a bit vector are described. At least two configurations, each having state machines of the same design, are used, to whose inputs an input signal is sent and which generate an output signal as a function of their state, each state machine always ha
A method and a circuit configuration for generating a bit vector are described. At least two configurations, each having state machines of the same design, are used, to whose inputs an input signal is sent and which generate an output signal as a function of their state, each state machine always having a different state than the other state machine of one configuration, so that the bit vector is generated by a linear gating of the output signals of the state machines of different configurations.
대표청구항▼
1. A method for generating a bit vector, the method comprising: sending an input signal to an input end of each of at least two configurations, each configuration having a plurality of state machines, and each state machine having the same structure, wherein: each state machine transitions to a next
1. A method for generating a bit vector, the method comprising: sending an input signal to an input end of each of at least two configurations, each configuration having a plurality of state machines, and each state machine having the same structure, wherein: each state machine transitions to a next state in a predefined sequence of states as a function of its present state and a value of its present input, andeach state machine maintains the next state until a subsequent processing cycle;generating an output signal for each of the state machines as a function of their state, each of the state machines within any particular configuration always having a different state than the other state machines of the same particular configuration;generating a bit vector by a linear gating of the output signals of the state machines of different configurations; andmasking at least one of an input that is encrypted by an encryption operation and an encrypted output of the encryption operation using the bit vector. 2. The method of claim 1, wherein the states of the state machine are rotated. 3. The method of claim 2, wherein a power consumption in rotation is independent of preceding states and following states due to erasing and subsequent writing. 4. The method of claim 1, wherein the same input signal is sent to each of the configurations. 5. The method of claim 4, further comprising: supplying a first counter value, wherein different ones of the at least two configurations process the input signals and counter signals in different ways. 6. The method of claim 1, wherein switching signals are formed from the input signals, wherein the state machines attain a different following state as a function of the switching signals, and wherein the switching signals are formable differently for different ones of the configurations. 7. The method of claim 1, wherein the bit vector is formed by gating different outputs of different ones of the state machines of different ones of the configurations. 8. The method of claim 1, wherein the bit vector is logically combined with the input of the encryption operation prior to performing the encryption. 9. The method of claim 1, wherein the output of the encryption operation is masked by logically combining the bit vector with a private key used to perform the encryption. 10. The method of claim 1, wherein: the number of state machines in any particular configuration is equal to the number of possible states for any particular state machine of the same particular configuration, andwithin each particular configuration, each possible state always occurs within exactly one state machine. 11. The method of claim 1, wherein the inputs by which the state machines transition to the next state are identical. 12. The method of claim 1, further comprising: initializing all of the state machines within any particular configuration to different states. 13. A circuit configuration for generating a bit vector, comprising: at least two configurations, each configuration having a plurality of state machines, and each state machine having the same structure, to whose inputs an input signal, which is the same or different, is sent, wherein: each of the at least two configurations each generate an output signal as a function of their state,each of the state machines in any particular configuration always has a different state than the other state machines of the same particular configuration,each state machine transitions to a next state in a predefined sequence of states as a function of its present state and a value of its present input, andeach state machine maintains the next state until a subsequent processing cycle;a linear gating element that forms a bit vector by gating the output signals of the state machines; andan additional gating element that masks at least one of an input that is encrypted by an encryption operation and an encrypted output of the encryption operation using the bit vector. 14. The circuit configuration of claim 13, wherein the memory elements of the state machines are constructed of two parts, including a master and a slave, which are erasable and writable independently of one another. 15. The circuit configuration of claim 13, which is configured so that the outputs of all of the state machines, which are not connected to a gating element, are connected to a load element. 16. The circuit configuration of claim 13, wherein the linear gating element is for gating the output signals of the state machines of different ones of the configurations for generating the bit vector. 17. The circuit configuration of claim 13, wherein: the number of state machines in any particular configuration is equal to the number of possible states for any particular state machine of the same particular configuration, andwithin each particular configuration, each possible state always occurs within exactly one state machine.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (3)
Garibay ; Jr. Raul A. ; Quattromani Marc A. ; Beard Douglas ; Bluhm Mark W., Address translation unit employing programmable page size.
Jaffe, Joshua M.; Kocher, Paul C.; Jun, Benjamin C., Balanced cryptographic computational method and apparatus for leak minimizational in smartcards and other cryptosystems.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.