TY - JOUR
T1 - Message encipherment with minimal expansion and redundancy : doing better than ISO-19126
AU - Jansen, C.J.A.
AU - Vlist, van der, P.
PY - 1996
Y1 - 1996
N2 - In this paper we consider the problem of encrypting messages containing characters from small, usually non-binary alphabets by means of binary encryption algorithms. It is shown that the solutions as proposed by ISO-10126 can be improved with respect to the expansion factor and, more importantly, with respect to the cryptographic security. Also, a method is presented which is optimal in this sense, i.e. no expansion and optimal cryptographic security.
AB - In this paper we consider the problem of encrypting messages containing characters from small, usually non-binary alphabets by means of binary encryption algorithms. It is shown that the solutions as proposed by ISO-10126 can be improved with respect to the expansion factor and, more importantly, with respect to the cryptographic security. Also, a method is presented which is optimal in this sense, i.e. no expansion and optimal cryptographic security.
U2 - 10.1016/S0167-4048(96)00013-2
DO - 10.1016/S0167-4048(96)00013-2
M3 - Article
SN - 0167-4048
VL - 15
SP - 627
EP - 632
JO - Computers and Security
JF - Computers and Security
IS - 7
ER -