Skip to main content
Conference ProceedingsOPEN ACCESS

The rao-nam scheme is insecure against a chosen-plaintext attack

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 293 LNCS 445-457
DOI: 10.1007/3-540-48184-2_40
48Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The Rao-Nam scheme is discussed and generalized to Fq. It is shown that the scheme is insecure against a chosen-plaintext attack for practical code lengths. Based on observations an improved scheme is given, which is not vulnerable to the chosen-plaintext attacks as described.

Cite

CITATION STYLE

APA

Struik, R., & van Tilburg, J. (1988). The rao-nam scheme is insecure against a chosen-plaintext attack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 293 LNCS, pp. 445–457). Springer Verlag. https://doi.org/10.1007/3-540-48184-2_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free