Finite Fields
Explore this paper's citation graph
- Published
- 2018-10-08
- Cited by
- 2,119
- References
- 39
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:13990474
References
- On binary and ternary Kloosterman sums
- Cours d'algèbre
- Giesbrecht's Algorithm, The HFE Cryptosystem and ORE's ps-Polynomials
- Solving Multiple Right Hand Sides linear equations
- Gauss Sums, Jacobi Sums, and p-Ranks of Cyclic Difference Sets
- New families of quadratic almost perfect nonlinear trinomials and multinomials
- A weighted module view of integral closures of affine domains of type I
- Differential Algebra and Algebraic Groups
- Mathematical Papers Read at the International Mathematical Congress Held in Connection with the World's Columbian Exposition, Chicago, 1893
- On the product of two primitive elements of maximal subfields of a finite field
- On the classification of APN functions up to dimension five
- A new almost perfect nonlinear function which is not quadratic
- Codes associated with special linear groups and power moments of multi-dimensional Kloosterman sums
- Elliptic periods for finite fields
- On multiplication in finite fields
- Primitive polynomials with a prescribed coefficient
- On the sum of two primitive elements of maximal subfields of a finite field
- Finite field elements of high order arising from modular curves
- Finite Field Elements with Specified Order and Traces
- Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
Cited by
- Slid Pairs in the Initialisation of the A5/1 Stream Cipher
- On the number of solutions of the generalized Ramanujan-Nagell equation D_1x^2+D_2^m=2^n+2
- ANALYSIS OF SECURITY MEASURES FOR SEQUENCES
- Asymptotically Efficient Algorithms for the Frobenius Form
- All unitary perfect polynomials over F 2 with less than five distinct prime factors
- Self-interacting polynomials
- Nested Canalyzing Functions And Their Average Sensitivities
- Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices
- Efficient Arithmetic on Low-Genus Curves
- A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
- On finite groups where the order of every automorphism is a cycle length
- On Polynomials over a Finite Field of Even Characteristic with Maximum Absolute Value of the Trigonometric Sum
- The Weight Hierarchy of Some Reducible Cyclic Codes
- Frobenius-Like Permutations and Their Cycle Structure
- A new M-ary sequence family constructed from Sidel'nikov sequences
- Perfectly secure data aggregation via shifted projections
- Shorter arithmetization of nondeterministic computations
- Sobre o numero de soluções de equações polinomiais em corpos finitos
- Spectra of a class of quadratic functions: Average behaviour and counting functions
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
Related papers
No related papers recorded.