MINIMIZING INFORMATION LEAKAGE FROM COMBINATORIAL LOGIC

An apparatus, system and method are disclosed to block and replace intermediate combinatorial transitions that are correlated with secret data, also referred to as glitches, with random intermediate combinatorial transitions that are uncorrelated with the data being processed.

Minimizing information leakage from combinatorial logic

An apparatus, system and method are disclosed to block and replace intermediate combinatorial transitions that are correlated with secret data, also referred to as glitches, with random intermediate combinatorial transitions that are uncorrelated with the data being processed.

MINIMIZING INFORMATION LEAKAGE DURING MODULAR EXPONENTIATION AND ELLIPTIC CURVE POINT MULTIPLICATION

Minimizing information leakage during modular exponentiation using random masks is disclosed Minimizing information leakage during elliptic curve point multiplication is disclosed with windowing by using point randomization is disclosed. Elliptic curve point multiplication with windowing calculates and stores multiple points based on the point being multiplied and then processes multiple bits of the multiplier at a time is also disclosed.

Minimizing information leakage from combinatorial logic

An apparatus, system and method are disclosed to block and replace intermediate combinatorial transitions that are correlated with secret data, also referred to as glitches, with random intermediate combinatorial transitions that are uncorrelated with the data being processed.

Minimizing information leakage during modular exponentiation and elliptic curve point multiplication

Minimizing information leakage during modular exponentiation using random masks is disclosed Minimizing information leakage during elliptic curve point multiplication is disclosed with windowing by using point randomization is disclosed. Elliptic curve point multiplication with windowing calculates and stores multiple points based on the point being multiplied and then processes multiple bits of the multiplier at a time is also disclosed.

KEY UPDATE FOR MASKED KEYS

Embodiments of the present invention provide methods to perform key updates on key shares of a masked key, which allows updating the masked key without unmasking the masked key (e.g., producing the effective key). By using key shares of a masked key and performing the key update on one or more of the key shares without unmasking the effective key, the cumulative leakage of individual effective keys across multiple cryptographic operations is reduced, and preferably minimized. 149-. (canceled)50. A method of updating key shares , comprising:applying at least one key update function to a corresponding at least one key share of n key shares, such that each key update function of the at least one key update function is applied to the corresponding key share of the at least one key share of the n key shares, such that a corresponding at least one updated key share is produced,wherein n is an integer greater than or equal to 2,wherein when the n key shares are n-share unmasked, an effective key is produced, (i) the at least one updated key share; and', '(ii) key shares of the n key shares to which a key update function of the at least one key update function was not applied,, 'wherein whenare n-share unmasked, an updated effective key is produced.51. The method according to claim 50 ,wherein each key share of the n key shares is independent of the effective key.52. The method according to claim 50 , further comprising:receiving the n key shares.53. The method according to claim 50 , wherein applying at least one key update function to a corresponding at least one key share of n key shares is accomplished via a processor.54. The method according to claim 50 , wherein the n key shares are unmasked by applying an n-share unmasking operator to the n key shares.55. The method according to claim 50 ,wherein the n-share unmasking operator is additive and applying the n-share unmasking operator to the n key shares comprises adding the n key shares together,wherein the n-share ...

Minimizing information leakage during modular exponentiation and elliptic curve point multiplication

Minimizing information leakage during modular exponentiation using random masks is disclosed Minimizing information leakage during elliptic curve point multiplication is disclosed with windowing by using point randomization is disclosed. Elliptic curve point multiplication with windowing calculates and stores multiple points based on the point being multiplied and then processes multiple bits of the multiplier at a time is also disclosed.

Minimizing information leakage from combinatorial logic

An apparatus, system and method are disclosed to block and replace intermediate combinatorial transitions that are correlated with secret data, also referred to as glitches, with random intermediate combinatorial transitions that are uncorrelated with the data being processed.

MINIMIZING INFORMATION LEAKAGE FROM COMBINATORIAL LOGIC

An apparatus, system and method are disclosed to block and replace intermediate combinatorial transitions that are correlated with secret data, also referred to as glitches, with random intermediate combinatorial transitions that are uncorrelated with the data being processed. 1. A glitch block circuit for reducing information leakage due to combinatorial logic glitches , the glitch blocker circuit comprising:a multiplexer having an input signal comprising the glitches to be blocked and an uncorrelated signal that can be fixed or variable; anda glitch block enable signal generator suitable to enable the glitch blocker generator circuit using a glitch blocker enable signal.2. The circuit of claim 1 , wherein the glitch block enable signal is generated using Steady to Unpredictable (StU) logic for generating a glitch block enable.3. The circuit of claim 2 , further comprising:at least two sets of StU logic suitable for generating the glitch block enable signal on every clock cycle that indicates a transition from unpredictable to steady or steady to unpredictable.4. The circuit of claim 2 , further comprising:a series of chained StU logic suitable for generating multiple glitch block enables.5. The circuit of claim 1 , wherein the glitch block enable signal generator uses fixed logic delay for generating the glitch block enable.6. The circuit of claim 1 , wherein the glitch block enable signal is generated using phase delayed register XORing for generating a glitch block enable.7. The circuit of claim 1 , wherein the glitch block enable signal is generated using high speed clock registers for generating a glitch block enable.8. A one-shot glitch generator claim 1 , comprising:at least two multiplexers in series, wherein the multiplexers use a same select which selects an unpredictable input when one-shot glitches are beneficial to reduce a signal-to-noise ratio (SNR) of an information leakage and inputs consist of an uncorrelated signal that is uncorrelated to data ...

Key update for masker keys

Embodiments of the present invention provide methods to perform key updates on key shares of a masked key, which allows updating the masked key without unmasking the masked key (e.g., producing the effective key). By using key shares of a masked key and performing the key update on one or more of the key shares without unmasking the effective key, the cumulative leakage of individual effective keys across multiple cryptographic operations is reduced, and preferably minimized.

An improved spraying specific for fruit trees

Moteur à combustion interne avec dispositif d'alimentation en eau