The following pages link to Arithmetic of Finite Fields (Q2949467):
Displaying 50 items.
- Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma (Q2949468) (← links)
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs (Q2949470) (← links)
- Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms (Q2949471) (← links)
- Reducing the Complexity of Normal Basis Multiplication (Q2949472) (← links)
- Open Questions on Nonlinearity and on APN Functions (Q2949473) (← links)
- Some Results on Difference Balanced Functions (Q2949474) (← links)
- Affine Equivalency and Nonlinearity Preserving Bijective Mappings over $$\mathbb {F}_2$$ (Q2949476) (← links)
- On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions (Q2949477) (← links)
- On o-Equivalence of Niho Bent Functions (Q2949478) (← links)
- L-Polynomials of the Curve $$\displaystyle y^{q^n}-y=\gamma x^{q^h+1} - \alpha $$ over $${\mathbb F}_{q^m}$$ (Q2949479) (← links)
- Efficient Software Implementations of Code-Based Hash Functions and Stream-Ciphers (Q2949480) (← links)
- Quadratic Residue Codes over $$\mathbb {F}_p+v\mathbb {F}_p+v^{2}\mathbb {F}_p$$ (Q2949481) (← links)
- Generalised Jacobians in Cryptography and Coding Theory (Q3166959) (← links)
- The Weight Distribution of a Family of Reducible Cyclic Codes (Q3166961) (← links)
- A New Method for Constructing Small-Bias Spaces from Hermitian Codes (Q3166962) (← links)
- An Improved Threshold Ring Signature Scheme Based on Error Correcting Codes (Q3166963) (← links)
- Sequences and Functions Derived from Projective Planes and Their Difference Sets (Q3166964) (← links)
- On Formally Self-dual Boolean Functions in 2,4 and 6 Variables (Q3166965) (← links)
- On the Algebraic Normal Form and Walsh Spectrum of Symmetric Functions over Finite Rings (Q3166967) (← links)
- Verification of Restricted EA-Equivalence for Vectorial Boolean Functions (Q3166968) (← links)
- Software Implementation of Modular Exponentiation, Using Advanced Vector Instructions Architectures (Q3166970) (← links)
- Efficient Multiplication over Extension Fields (Q3166977) (← links)
- $\textrm{GF}(2^m)$ Finite-Field Multipliers with Reduced Activity Variations (Q3166979) (← links)
- Finding Optimal Formulae for Bilinear Maps (Q3166980) (← links)
- Solving Binary Linear Equation Systems over the Rationals and Binaries (Q3166981) (← links)
- Hashing with Elliptic Curve L-Functions (Q3166982) (← links)
- Square Root Algorithms for the Number Field Sieve (Q3166983) (← links)
- Improving the Berlekamp Algorithm for Binomials x n − a (Q3166984) (← links)
- On Some Permutation Binomials of the Form $x^{\frac{2^n-1}{k}+1} +ax$ over $\mathbb{F}_{2^n}$ : Existence and Count (Q3166985) (← links)
- Interpolation of the Double Discrete Logarithm (Q3519547) (← links)
- Finite Dedekind Sums (Q3519548) (← links)
- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications (Q3519549) (← links)
- Fast Point Multiplication on Elliptic Curves without Precomputation (Q3519550) (← links)
- Optimal Extension Field Inversion in the Frequency Domain (Q3519551) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- Modular Reduction in GF(2 n ) without Pre-computational Phase (Q3519553) (← links)
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation (Q3519554) (← links)
- Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields (Q3519555) (← links)
- Some Theorems on Planar Mappings (Q3519556) (← links)
- Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions (Q3519557) (← links)
- EA and CCZ Equivalence of Functions over GF(2 n ) (Q3519558) (← links)
- On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials (Q3519559) (← links)
- On Field Size and Success Probability in Network Coding (Q3519560) (← links)
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2 (Q3519561) (← links)
- On Cryptographically Significant Mappings over GF(2 n ) (Q3519562) (← links)
- Recursive Towers of Function Fields over Finite Fields (Q3578461) (← links)
- High-Performance Modular Multiplication on the Cell Processor (Q3578462) (← links)
- A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier (Q3578463) (← links)
- Type-II Optimal Polynomial Bases (Q3578464) (← links)
- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers (Q3578465) (← links)
