vix.ing · top · new · best · stats · spec

Divisibility, Smoothness and Cryptographic Applications

2008/10/12 by David Naccache, Naccache, David, Igor E. Shparlinski +1
Computer Science · Mathematics · #11N25 #11Y16 #9460 #Analytic Number Theory Research #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.0810.2067

openalex publication_date 2008/10/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth numbers play a 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.

Citations

Related