Abstract: Carmichael quotients for an integer are introduced analogous to Fermat quotients, by using Carmichael function . Various properties of these new quotients are investigated, such as basic arithmetic properties, sequences derived from Carmichael quotients, Carmichael-Wieferich numbers, and so on. Finally, we link Carmichael quotients to perfect nonlinear functions.
Recommendations
- Fermat quotients for composite moduli
- Carmichael numbers with a totient of the form \(a^2+nb^2\)
- The Carmichael Numbers to 10 12
- On two functions arising in the study of the Euler and Carmichael quotients
- Some soluble cases of the discrete logarithm problem
- The Impossibility of Certain Types of Carmichael Numbers
- Carmichael numbers in arithmetic progressions
- Infinitely many Carmichael numbers in arithmetic progressions
- Carmichael numbers for \(\mathrm{GL}(m)\)
Cites work
- scientific article; zbMATH DE number 4150268 (Why is no real title available?)
- scientific article; zbMATH DE number 3713801 (Why is no real title available?)
- scientific article; zbMATH DE number 1985602 (Why is no real title available?)
- scientific article; zbMATH DE number 866070 (Why is no real title available?)
- Cartesian authentication codes from functions with optimal nonlinearity.
- Fermat quotients for composite moduli
- Fermat quotients over function fields
- Highly nonlinear mappings
- New Solutions of a p - 1 ≡1 (mod p 2 )
- On Fermat and Wilson quotients
- On Giuga's conjecture
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- Pseudorandomness and dynamics of Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
Cited in
(8)- Polynomial quotients: Interpolation, value sets and Waring's problem
- Additive character sums of polynomial quotients
- Trace representation of pseudorandom binary sequences derived from Euler quotients
- On two functions arising in the study of the Euler and Carmichael quotients
- Correction to: The arithmetic of Carmichael quotients
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- An extension of binary threshold sequences from Fermat quotients
This page was built for publication: The arithmetic of Carmichael quotients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343258)
