  This paper uses Euclidean Information Theory (EIT) to analyze the wiretap
channel. We investigate a scenario of efficiently transmitting a small amount
of information subject to compression rate and secrecy constraints. We
transform the information-theoretic problem into a linear algebra problem and
obtain the perturbed probability distributions such that secrecy is achievable.
Local approximations are being used in order to obtain an estimate of the
secrecy capacity by solving a generalized eigenvalue problem.
