The following pages link to Fast Software Encryption (Q5713925):
Displaying 14 items.
- Influence of addition modulo \(2^n\) on algebraic attacks (Q269574) (← links)
- AFSRs synthesis with the extended Euclidean rational approximation algorithm (Q514533) (← links)
- Further properties of several classes of Boolean functions with optimum algebraic immunity (Q735033) (← links)
- An algebraic attack on the improved summation generator with 2-bit memory (Q834989) (← links)
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity (Q851733) (← links)
- On an improved summation generator with 2-bit memory. (Q1566779) (← links)
- Cryptanalysis of a summation generator with 2-bit memory (Q1853385) (← links)
- Algebraic construction of near-bent and APN functions (Q2010539) (← links)
- Designing against a class of algebraic attacks on symmetric block ciphers (Q2502176) (← links)
- Cryptanalysis of the Knapsack Generator (Q3013084) (← links)
- Mutually Clock-Controlled Feedback Shift Registers Provide Resistance to Algebraic Attacks (Q3600335) (← links)
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity (Q3600389) (← links)
- Algebraic construction of near-bent function with application to cryptography (Q5035103) (← links)
- Cryptography and Coding (Q5897528) (← links)
