Small values of the Carmichael function and cryptographic applications

JB Friedlander; C Pomerance; Igor Shparlinski

doi:10.1007/978-3-0348-8295-8_4

Small values of the Carmichael function and cryptographic applications

JB Friedlander^*, C Pomerance, Igor Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-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 language	English
Title of host publication	Cryptography and computational number theory
Editors	K. Y. Lam, Igor Shparlinski, H. Wang, C. P. Xing
Place of Publication	Basel
Publisher	BIRKHAUSER VERLAG AG
Pages	25-32
Number of pages	8
ISBN (Print)	3-7643-6510-2
DOIs	https://doi.org/10.1007/978-3-0348-8295-8_4
Publication status	Published - 2001
Event	Workshop on Cryptography and Computational Number Theory (CCNT 99) - Singapore, Singapore Duration: 22 Nov 1999 → 26 Nov 1999

Publication series

Name	Progress In Computer Science and Applied Logic
Publisher	BIRKHAUSER VERLAG AG
Volume	20

Conference

Conference	Workshop on Cryptography and Computational Number Theory (CCNT 99)
Country/Territory	Singapore
City	Singapore
Period	22/11/99 → 26/11/99

Keywords

NUMBER GENERATOR
BITS
RSA

Access to Document

10.1007/978-3-0348-8295-8_4

Cite this

Friedlander, JB., Pomerance, C., & Shparlinski, I. (2001). Small values of the Carmichael function and cryptographic applications. In K. Y. Lam, I. Shparlinski, H. Wang, & C. P. Xing (Eds.), Cryptography and computational number theory (pp. 25-32). (Progress In Computer Science and Applied Logic; Vol. 20). BIRKHAUSER VERLAG AG. https://doi.org/10.1007/978-3-0348-8295-8_4

@inproceedings{c1077f57b1b04e148f573f4564e135af,

title = "Small values of the Carmichael function and cryptographic applications",

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.",

keywords = "NUMBER GENERATOR, BITS, RSA",

author = "JB Friedlander and C Pomerance and Igor Shparlinski",

year = "2001",

doi = "10.1007/978-3-0348-8295-8_4",

language = "English",

isbn = "3-7643-6510-2",

series = "Progress In Computer Science and Applied Logic",

publisher = "BIRKHAUSER VERLAG AG",

pages = "25--32",

editor = "Lam, {K. Y.} and Igor Shparlinski and H. Wang and Xing, {C. P.}",

booktitle = "Cryptography and computational number theory",

note = "Workshop on Cryptography and Computational Number Theory (CCNT 99) ; Conference date: 22-11-1999 Through 26-11-1999",

}

Friedlander, JB, Pomerance, C & Shparlinski, I 2001, Small values of the Carmichael function and cryptographic applications. in KY Lam, I Shparlinski, H Wang & CP Xing (eds), Cryptography and computational number theory. Progress In Computer Science and Applied Logic, vol. 20, BIRKHAUSER VERLAG AG, Basel, pp. 25-32, Workshop on Cryptography and Computational Number Theory (CCNT 99), Singapore, Singapore, 22/11/99. https://doi.org/10.1007/978-3-0348-8295-8_4

Small values of the Carmichael function and cryptographic applications. / Friedlander, JB; Pomerance, C; Shparlinski, Igor.
Cryptography and computational number theory. ed. / K. Y. Lam; Igor Shparlinski; H. Wang; C. P. Xing. Basel: BIRKHAUSER VERLAG AG, 2001. p. 25-32 (Progress In Computer Science and Applied Logic; Vol. 20).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Small values of the Carmichael function and cryptographic applications

AU - Friedlander, JB

AU - Pomerance, C

AU - Shparlinski, Igor

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - NUMBER GENERATOR

KW - BITS

KW - RSA

U2 - 10.1007/978-3-0348-8295-8_4

DO - 10.1007/978-3-0348-8295-8_4

M3 - Conference proceeding contribution

SN - 3-7643-6510-2

T3 - Progress In Computer Science and Applied Logic

SP - 25

EP - 32

BT - Cryptography and computational number theory

A2 - Lam, K. Y.

A2 - Shparlinski, Igor

A2 - Wang, H.

A2 - Xing, C. P.

PB - BIRKHAUSER VERLAG AG

CY - Basel

T2 - Workshop on Cryptography and Computational Number Theory (CCNT 99)

Y2 - 22 November 1999 through 26 November 1999

ER -

Small values of the Carmichael function and cryptographic applications

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this