Integers with a large smooth divisor

William D. Banks; Igor E. Shparlinski

Integers with a large smooth divisor

William D. Banks, Igor E. Shparlinski

School of Computing

Research output: Contribution to journal › Article › peer-review

Abstract

We study the function O(x, y, z) that counts the number of positive integers n ≤ x which have a divisor d > z with the property that p ≤ y for every prime p dividing d. We also indicate some cryptographic applications of our results.

Original language	English
Number of pages	11
Journal	Integers
Volume	7
Issue number	1
Publication status	Published - 2007

Cite this

@article{353c373358a94382bfe6a8b768aa7e06,

title = "Integers with a large smooth divisor",

abstract = "We study the function O(x, y, z) that counts the number of positive integers n ≤ x which have a divisor d > z with the property that p ≤ y for every prime p dividing d. We also indicate some cryptographic applications of our results.",

author = "Banks, {William D.} and Shparlinski, {Igor E.}",

year = "2007",

language = "English",

volume = "7",

journal = "Integers",

issn = "1867-0652",

publisher = "De Gruyter",

number = "1",

}

TY - JOUR

T1 - Integers with a large smooth divisor

AU - Banks, William D.

AU - Shparlinski, Igor E.

PY - 2007

Y1 - 2007

N2 - We study the function O(x, y, z) that counts the number of positive integers n ≤ x which have a divisor d > z with the property that p ≤ y for every prime p dividing d. We also indicate some cryptographic applications of our results.

AB - We study the function O(x, y, z) that counts the number of positive integers n ≤ x which have a divisor d > z with the property that p ≤ y for every prime p dividing d. We also indicate some cryptographic applications of our results.

M3 - Article

SN - 1867-0652

VL - 7

JO - Integers

JF - Integers

IS - 1

ER -

Integers with a large smooth divisor

Abstract

Fingerprint

Cite this