On the generalised hidden number problem and bit security of XTR

Igor E. Shparlinski

doi:10.1007/3-540-45624-4_28

On the generalised hidden number problem and bit security of XTR

Igor E. Shparlinski^*

^*Corresponding author for this work

Department of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Subtitle of host publication	14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings
Editors	Serdar Boztaş, Igor E. Shparlinski
Place of Publication	Berlin; New York
Publisher	Springer, Springer Nature
Pages	268-277
Number of pages	10
ISBN (Electronic)	9783540456247
ISBN (Print)	9783540429111
DOIs	https://doi.org/10.1007/3-540-45624-4_28
Publication status	Published - Nov 2001
Event	14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 2001 - Melbourne, Australia Duration: 26 Nov 2001 → 30 Nov 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2227
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 2001
Country	Australia
City	Melbourne
Period	26/11/01 → 30/11/01

Access to Document

10.1007/3-540-45624-4_28

Link to publication in Scopus

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

Shparlinski, I. E. (2001). On the generalised hidden number problem and bit security of XTR. In S. Boztaş, & I. E. Shparlinski (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings (pp. 268-277). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2227). Berlin; New York: Springer, Springer Nature. https://doi.org/10.1007/3-540-45624-4_28

Shparlinski, Igor E. / On the generalised hidden number problem and bit security of XTR. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings. editor / Serdar Boztaş ; Igor E. Shparlinski. Berlin; New York : Springer, Springer Nature, 2001. pp. 268-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{130424d757f548848814c52bf9172404,

title = "On the generalised hidden number problem and bit security of XTR",

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.",

author = "Shparlinski, {Igor E.}",

year = "2001",

month = "11",

doi = "10.1007/3-540-45624-4_28",

language = "English",

isbn = "9783540429111",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "268--277",

editor = "Serdar Boztaş and Shparlinski, {Igor E.}",

booktitle = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes",

address = "United States",

}

Shparlinski, IE 2001, On the generalised hidden number problem and bit security of XTR. in S Boztaş & IE Shparlinski (eds), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2227, Springer, Springer Nature, Berlin; New York, pp. 268-277, 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 2001, Melbourne, Australia, 26/11/01. https://doi.org/10.1007/3-540-45624-4_28

On the generalised hidden number problem and bit security of XTR. / Shparlinski, Igor E.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings. ed. / Serdar Boztaş; Igor E. Shparlinski. Berlin; New York : Springer, Springer Nature, 2001. p. 268-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2227).

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

TY - GEN

T1 - On the generalised hidden number problem and bit security of XTR

AU - Shparlinski, Igor E.

PY - 2001/11

Y1 - 2001/11

N2 - 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.

AB - 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.

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

U2 - 10.1007/3-540-45624-4_28

DO - 10.1007/3-540-45624-4_28

M3 - Conference proceeding contribution

SN - 9783540429111

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 277

BT - Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

A2 - Boztaş, Serdar

A2 - Shparlinski, Igor E.

PB - Springer, Springer Nature

CY - Berlin; New York

ER -

Shparlinski IE. On the generalised hidden number problem and bit security of XTR. In Boztaş S, Shparlinski IE, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14 Melbourne, Australia, November 26–30, 2001 Proceedings. Berlin; New York: Springer, Springer Nature. 2001. p. 268-277. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45624-4_28