Divisibility, Smoothness and Cryptographic Applications

David Naccache; Igor Shparlinski

Paper 2008/437

Divisibility, Smoothness and Cryptographic Applications

David Naccache and Igor Shparlinski

Abstract

This paper deals with products of moderate-size primes, familiarly known as {\sl smooth numbers}. Smooth numbers play an crucial role in information theory, signal processing and cryptography. We present various properties of smooth numbers relating to their enumeration, distribution and occurrence in various integer sequences. We then turn our attention to cryptographic applications in which smooth numbers play a pivotal role.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: divisibility public-key cryptography prime numbers
Contact author(s): david naccache @ ens fr
History: 2008-10-20: received
Short URL: https://ia.cr/2008/437
License: CC BY

BibTeX

@misc{cryptoeprint:2008/437,
      author = {David Naccache and Igor Shparlinski},
      title = {Divisibility, Smoothness and Cryptographic Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/437},
      year = {2008},
      url = {https://eprint.iacr.org/2008/437}
}