Corpus ID: 2927488

INTEGERS WITH A LARGE SMOOTH DIVISOR

@inproceedings{Banks2006INTEGERSWA,
  title={INTEGERS WITH A LARGE SMOOTH DIVISOR},
  author={W. Banks and I. Shparlinski},
  year={2006}
}
  • W. Banks, I. Shparlinski
  • Published 2006
  • Mathematics
  • We study the function ! (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. 
    Integers with a large friable component
    • 5
    • Open Access
    Divisibility, Smoothness and Cryptographic Applications
    • 3
    • Open Access
    Divisibility, smoothness and cryptographic application
    Numbers at work and play
    Another look at HMQV
    • 85
    • Highly Influenced
    • Open Access
    On reusing ephemeral keys in Diffie-Hellman key agreement protocols
    • 34
    • Open Access
    Key establishment - security models, protocols and usage
    • 3
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES
    Integers with a large friable component
    • 5
    • Highly Influential
    • Open Access
    On the number of positive integers ≦ x and free of prime factors > y
    • 179
    • Highly Influential
    • Open Access
    Introduction to Analytic and Probabilistic Number Theory
    • 974
    • Open Access
    Handbook of Applied Cryptography
    • 10,834
    • Highly Influential
    • Open Access
    Sur le nombre des entiers sans grand facteur premier
    • 44
    • Highly Influential
    • Open Access
    Another look at HMQV
    • 85
    • Highly Influential
    • Open Access
    On the remainder in Merten’s formula,
    • 1963
    Another look at HMQV', Cryptology ePrint Archive
    • 2005
    Crible d’Ératosthène et modèle de Kubilius
    • 26