authentication systems. The secrecy capacity C s is investigated for the discrete and the
continuous case. We present, furthermore, a general algorithm that meets the requirements
and achieves C s as well as C id (the identification capacity). Finally, we present some
practical constructions of the general algorithm and analyze their properties.