On the generalised hidden number problem and bit security of XTR

Igor E. Shparlinski*

*Corresponding author for this work

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

12 Citations (Scopus)

Abstract

We consider a certain generalisation of the hidden number problem which has recently been introduced by Boneh and Venkatesan. We apply our results to study the bit security of the XTR cryptosystem and obtain some analogues of the results which have been known for the bit security of the Diffie-Hellman scheme.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes
Subtitle of host publication14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings
EditorsSerdar Boztaş, Igor E. Shparlinski
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Pages268-277
Number of pages10
ISBN (Electronic)9783540456247
ISBN (Print)9783540429111
DOIs
Publication statusPublished - Nov 2001
Event14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 2001 - Melbourne, Australia
Duration: 26 Nov 200130 Nov 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2227
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 2001
CountryAustralia
CityMelbourne
Period26/11/0130/11/01

Fingerprint Dive into the research topics of 'On the generalised hidden number problem and bit security of XTR'. Together they form a unique fingerprint.

Cite this