Small values of the Carmichael function and cryptographic applications
The authors provide cryptographic applications of results concerning small values of the Carmichael function and period length of the power generator of pseudorandom number sequences. Among the results is the first rigorous proof that all randomly chosen RSA moduli are safe against the cycling attack. They close the paper with a discussion of some open problems, including the study of the period length and distribution of some bit configurations extracted from the values of the power generator pseudorandom sequence. For the entire collection see [Zbl 0956.00037].
- Period of the power generator and small values of Carmichael's function
- scientific article; zbMATH DE number 3928174
- scientific article; zbMATH DE number 176069
- scientific article; zbMATH DE number 17389
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
This page was built for publication: Small values of the Carmichael function and cryptographic applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708609)