Algebraic-code cryptosystem using random code chaining

Tzone-Lih Hwang, Yihwa Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Simple algebraic-code encoding is combined with a random code chaining technique (RCC) to obtain data secrecy, data reliability and data authenticity simultaneously. This scheme gives not only very efficient coding/decoding but also very high information rates. Furthermore, the deciphering or modification of any block can be carried out efficiently. By using simpler error correcting codes, the scheme requires only a relatively low computational overhead. The data expansion problem in the RCC is also reduced to only one bit in the approach. The description of the scheme is given. The authors investigate the characteristics and the security considerations of the new scheme.

Original languageEnglish
Title of host publication90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91
PublisherPubl by IEEE
Pages194-196
Number of pages3
ISBN (Print)0879425563
Publication statusPublished - 1991
Event1990 IEEE Region 10 Conference on Computer and Communication Systems - IEEE TENCON '90 - Hong Kong
Duration: 1990 Sep 241990 Sep 27

Other

Other1990 IEEE Region 10 Conference on Computer and Communication Systems - IEEE TENCON '90
CityHong Kong
Period90-09-2490-09-27

Fingerprint

Cryptography
Decoding

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Hwang, T-L., & Chen, Y. (1991). Algebraic-code cryptosystem using random code chaining. In 90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91 (pp. 194-196). Publ by IEEE.
Hwang, Tzone-Lih ; Chen, Yihwa. / Algebraic-code cryptosystem using random code chaining. 90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91. Publ by IEEE, 1991. pp. 194-196
@inproceedings{b3e14a260dbf4656b9f23df02dc6a47b,
title = "Algebraic-code cryptosystem using random code chaining",
abstract = "Simple algebraic-code encoding is combined with a random code chaining technique (RCC) to obtain data secrecy, data reliability and data authenticity simultaneously. This scheme gives not only very efficient coding/decoding but also very high information rates. Furthermore, the deciphering or modification of any block can be carried out efficiently. By using simpler error correcting codes, the scheme requires only a relatively low computational overhead. The data expansion problem in the RCC is also reduced to only one bit in the approach. The description of the scheme is given. The authors investigate the characteristics and the security considerations of the new scheme.",
author = "Tzone-Lih Hwang and Yihwa Chen",
year = "1991",
language = "English",
isbn = "0879425563",
pages = "194--196",
booktitle = "90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91",
publisher = "Publ by IEEE",

}

Hwang, T-L & Chen, Y 1991, Algebraic-code cryptosystem using random code chaining. in 90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91. Publ by IEEE, pp. 194-196, 1990 IEEE Region 10 Conference on Computer and Communication Systems - IEEE TENCON '90, Hong Kong, 90-09-24.

Algebraic-code cryptosystem using random code chaining. / Hwang, Tzone-Lih; Chen, Yihwa.

90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91. Publ by IEEE, 1991. p. 194-196.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Algebraic-code cryptosystem using random code chaining

AU - Hwang, Tzone-Lih

AU - Chen, Yihwa

PY - 1991

Y1 - 1991

N2 - Simple algebraic-code encoding is combined with a random code chaining technique (RCC) to obtain data secrecy, data reliability and data authenticity simultaneously. This scheme gives not only very efficient coding/decoding but also very high information rates. Furthermore, the deciphering or modification of any block can be carried out efficiently. By using simpler error correcting codes, the scheme requires only a relatively low computational overhead. The data expansion problem in the RCC is also reduced to only one bit in the approach. The description of the scheme is given. The authors investigate the characteristics and the security considerations of the new scheme.

AB - Simple algebraic-code encoding is combined with a random code chaining technique (RCC) to obtain data secrecy, data reliability and data authenticity simultaneously. This scheme gives not only very efficient coding/decoding but also very high information rates. Furthermore, the deciphering or modification of any block can be carried out efficiently. By using simpler error correcting codes, the scheme requires only a relatively low computational overhead. The data expansion problem in the RCC is also reduced to only one bit in the approach. The description of the scheme is given. The authors investigate the characteristics and the security considerations of the new scheme.

UR - http://www.scopus.com/inward/record.url?scp=0025771828&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025771828&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0879425563

SP - 194

EP - 196

BT - 90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91

PB - Publ by IEEE

ER -

Hwang T-L, Chen Y. Algebraic-code cryptosystem using random code chaining. In 90 IEEE Reg 10 Conf Comput Commun Syst IEEE TENCON 91. Publ by IEEE. 1991. p. 194-196