Small values of the Carmichael function and cryptographic applications

JB Friedlander*, C Pomerance, Igor Shparlinski

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

Abstract

We outline some cryptographic applications of the recent results of the authors about small values of the Carmichael function and the period of the power generator of pseudorandom numbers. Namely, we show rigorously that almost all randomly selected RSA moduli are safe against the so-called cycling attack and we also provide some arguments in support of the reliability of the timed-release crypto scheme, which has recently been proposed by R. L. Rivest, A. Shamir and D. A. Wagner.

Original languageEnglish
Title of host publicationCryptography and computational number theory
EditorsK. Y. Lam, Igor Shparlinski, H. Wang, C. P. Xing
Place of PublicationBasel
PublisherBIRKHAUSER VERLAG AG
Pages25-32
Number of pages8
ISBN (Print)3-7643-6510-2
DOIs
Publication statusPublished - 2001
EventWorkshop on Cryptography and Computational Number Theory (CCNT 99) - Singapore, Singapore
Duration: 22 Nov 199926 Nov 1999

Publication series

NameProgress In Computer Science and Applied Logic
PublisherBIRKHAUSER VERLAG AG
Volume20

Conference

ConferenceWorkshop on Cryptography and Computational Number Theory (CCNT 99)
CountrySingapore
CitySingapore
Period22/11/9926/11/99

Keywords

  • NUMBER GENERATOR
  • BITS
  • RSA

Cite this