The arithmetic of Carmichael quotients
From MaRDI portal
Publication:343258
DOI10.1007/S10998-014-0079-3zbMath1363.11007arXiv1108.2579OpenAlexW1982389492MaRDI QIDQ343258
Publication date: 25 November 2016
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2579
Congruences; primitive roots; residue systems (11A07) Arithmetic functions; related numbers; inversion formulas (11A25) Sequences (mod (m)) (11B50)
Related Items (7)
On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients ⋮ An extension of binary threshold sequences from Fermat quotients ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ Correction to: The arithmetic of Carmichael quotients ⋮ Polynomial quotients: Interpolation, value sets and Waring's problem ⋮ Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus ⋮ Additive character sums of polynomial quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fermat quotients over function fields
- Fermat quotients for composite moduli
- Cartesian authentication codes from functions with optimal nonlinearity.
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Highly nonlinear mappings
- On Giuga's conjecture
- On Fermat and Wilson quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS
- Pseudorandomness and Dynamics of Fermat Quotients
- New Solutions of a p - 1 ≡1 (mod p 2 )
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
This page was built for publication: The arithmetic of Carmichael quotients
