Hide Randomness in Ciphertext
You can compute an $f(g(m))$ in which $g(m)$ is your encryption method and $f$ is a meaningful mapping function. As an example of $f$ I can mention a dictionary codebook mapping.
For example if your output is 11101000 you can see it as 1110 and 1000 then map 1110 to &quot;apple&quot; and 1000 to &quot;grape&quot;. Your codebook here must consist of all inputs of 4 bits and the name of fruits as output.
In the receiver side, you must clearly first compute $f^{-1}$ and convert the name of fruits to predefined codes and then decrypt it.