Searcharxiv⌕ Search

arXiv subjects

Anne-Maria Ernvall-Hytönen

Publications and source records attributed to Anne-Maria Ernvall-Hytönen.

23 records · Page 2Linked to original sources
arXiv2012

A short note on the kissing number of the lattice in Gaussian wiretap coding

We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of vectors of length $2m$ decreases, the secrecy gain increases. We will also prove a similar result on general unimodular lattices. Furthermore, assuming the conjecture by Belfiore and Solé, we will calculate the difference between inverses of secrecy gains as the number of vectors varies. Finally, we will show by an example that there exist two lattices in the same dimension with the same shortest vector length and the same kissing number, but different secrecy gains.

cs.CR↗
arXiv2011

On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes

In this paper, the probability of Eve the Eavesdropper's correct decision is considered both in the Gaussian and Rayleigh fading wiretap channels when using lattice codes for the transmission. First, it is proved that the secrecy function determining Eve's performance attains its maximum at y=1 on all known extremal even unimodular lattices. This is a special case of a conjecture by Belfiore and Solé. Further, a very simple method to verify or disprove the conjecture on any given unimodular lattice is given. Second, preliminary analysis on the behavior of Eve's probability of correct decision in the fast fading wiretap channel is provided. More specifically, we compute the truncated inverse norm power sum factors in Eve's probability expression. The analysis reveals a performance-secrecy-complexity tradeoff: relaxing on the legitimate user's performance can significantly increase the security of transmission. The confusion experienced by the eavesdropper may be further increased by using skewed lattices, but at the cost of increased complexity.

cs.CR↗
arXiv2011

On a conjecture by Belfiore and Solé on some lattices

The point of this note is to prove that the secrecy function attains its maximum at y=1 on all known extremal even unimodular lattices. This is a special case of a conjecture by Belfiore and Solé. Further, we will give a very simple method to verify or disprove the conjecture on any given unimodular lattice.

cs.IT↗