Skip to main content
Conference ProceedingsOPEN ACCESS

The security of individual bit for XTR

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9977 LNCS 87-98
DOI: 10.1007/978-3-319-50011-9_7
0Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider bit security of public key cryptosystem XTR, presented by Lenstra and Verheul in 2000. Using the list-decoding method, we prove finding one of its pre-image of XTR if single bit of its plaintext is predicted with a non-negligible advantage. That is, every single bit of plaintext of XTR is a hardcore predicate if XTR is one-way.

Author supplied keywords

Cite

CITATION STYLE

APA

Lv, K., Ren, S. W., & Qin, W. (2016). The security of individual bit for XTR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9977 LNCS, pp. 87–98). Springer Verlag. https://doi.org/10.1007/978-3-319-50011-9_7

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