  Random binning is a widely utilized tool in information theory, finding
applications in various domains. In this paper, we focus on the output
statistics of random binning (OSRB) using the Tsallis divergence $T_\alpha$.
Our investigation encompasses all values of $\alpha$ within the range of
$(0,\infty)$. The proofs provided in this paper cover both the achievability
and converse aspects. To accommodate the unbounded nature of $T_\infty$, we
analyze the OSRB framework using the R\'enyi's divergence criterion with the
order of infinity, denoted as $D_\infty$. During our exploration of OSRB, we
encounter a specific form of R\'enyi's conditional entropy and delve into its
properties. Additionally, we demonstrate the effectiveness of this framework in
establishing achievability results for wiretap channel, where Tsallis
divergence serves as a security measure.
