Pages that link to "Item:Q1675203"

The following pages link to Cube attacks on non-blackbox polynomials based on division property (Q1675203):

Displaying 38 items.

• FAN: a lightweight authenticated cryptographic algorithm (Q826267) (← links)
• Correlation cube attacks: from weak-key distinguisher to key recovery (Q1648859) (← links)
• Improved division property based cube attacks exploiting algebraic properties of superpoly (Q1673396) (← links)
• Finding integral distinguishers with ease (Q1726670) (← links)
• MILP-based cube attack on the reduced-round WG-5 lightweight stream cipher (Q1744867) (← links)
• Design and analysis of small-state grain-like stream ciphers (Q1749794) (← links)
• Modeling for three-subset division property without unknown subset (Q2044753) (← links)
• Modeling for three-subset division property without unknown subset. Improved cube attacks against Trivium and Grain-128AEAD (Q2055620) (← links)
• The MILP-aided conditional differential attack and its application to Trivium (Q2227128) (← links)
• An improved degree evaluation method of NFSR-based cryptosystems (Q2243894) (← links)
• Computing AES related-key differential characteristics with constraint programming (Q2289026) (← links)
• Applying cube attacks to stream ciphers in realistic scenarios (Q2376659) (← links)
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression (Q2413618) (← links)
• An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums (Q2692351) (← links)
• An algebraic attack on ciphers with low-degree round functions: application to full MiMC (Q2692352) (← links)
• Comparison of Cube Attacks Over Different Vector Spaces (Q3460109) (← links)
• Extensions of the Cube Attack Based on Low Degree Annihilators (Q3648468) (← links)
• Cryptanalysis of MORUS (Q5920187) (← links)
• New method for combining Matsui's bounding conditions with sequential encoding method (Q6063134) (← links)
• Improved graph-based model for recovering superpoly on Trivium (Q6080905) (← links)
• Cryptanalysis of reduced round SPEEDY (Q6103079) (← links)
• Conditional Cube Searching and Applications on Trivium-Variant Ciphers (Q6108838) (← links)
• An experimentally verified attack on 820-round Trivium (Q6134030) (← links)
• A practical key-recovery attack on 805-round Trivium (Q6157491) (← links)
• Massive superpoly recovery with nested monomial predictions (Q6157499) (← links)
• Several MILP-Aided Attacks Against SNOW 2.0 (Q6162381) (← links)
• Mathematical aspects of division property (Q6165429) (← links)
• Stretching cube attacks: improved methods to recover massive superpolies (Q6175991) (← links)
• A polynomial system for bit-based division property solving by quantum algorithm (Q6182418) (← links)
• A New General Method of Searching for Cubes in Cube Attacks (Q6485827) (← links)
• A Novel GPU-Based Implementation of the Cube Attack (Q6487203) (← links)
• A new correlation cube attack based on division property (Q6535477) (← links)
• An improved method for evaluating secret variables and its application to WAGE (Q6573675) (← links)
• A new method for searching cubes and its application to 815-round trivium (Q6594977) (← links)
• Correlation cube attack revisited. Improved cube search and superpoly recovery techniques (Q6595813) (← links)
• A simpler model for recovering superpoly on Trivium (Q6618593) (← links)
• More balanced polynomials: cube attacks on 810- and 825-round Trivium with practical complexities (Q6620028) (← links)
• Massive superpoly recovery with a meet-in-the-middle framework. Improved cube attacks on \textsc{Trivium} and Kreyvium (Q6636398) (← links)