Quantum noisy rational function reconstruction

Sean Hallgren; Alexander Russell; Igor E. Shparlinski

doi:10.1007/11533719_43

Quantum noisy rational function reconstruction

Sean Hallgren, Alexander Russell, Igor E. Shparlinski

Computer Science and Engineering

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

We consider the problem of determining a rational function f over a finite field script F sign_p of p elements given a noisy black box B, which for each t ∈ script F sign_p returns several most significant bits of the residue of f(t) modulo the prime p.

Original language	English (US)
Pages (from-to)	420-429
Number of pages	10
Journal	Lecture Notes in Computer Science
Volume	3595
DOIs	https://doi.org/10.1007/11533719_43
State	Published - 2005
Event	11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China Duration: Aug 16 2005 → Aug 29 2005

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11533719_43

Cite this

@article{65e6438b421f4d6e802ed7a02908d281,

title = "Quantum noisy rational function reconstruction",

abstract = "We consider the problem of determining a rational function f over a finite field script F signp of p elements given a noisy black box B, which for each t ∈ script F signp returns several most significant bits of the residue of f(t) modulo the prime p.",

author = "Sean Hallgren and Alexander Russell and Shparlinski, {Igor E.}",

year = "2005",

doi = "10.1007/11533719_43",

language = "English (US)",

volume = "3595",

pages = "420--429",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "11th Annual International Conference on Computing and Combinatorics, COCOON 2005 ; Conference date: 16-08-2005 Through 29-08-2005",

}

TY - JOUR

T1 - Quantum noisy rational function reconstruction

AU - Hallgren, Sean

AU - Russell, Alexander

AU - Shparlinski, Igor E.

PY - 2005

Y1 - 2005

N2 - We consider the problem of determining a rational function f over a finite field script F signp of p elements given a noisy black box B, which for each t ∈ script F signp returns several most significant bits of the residue of f(t) modulo the prime p.

AB - We consider the problem of determining a rational function f over a finite field script F signp of p elements given a noisy black box B, which for each t ∈ script F signp returns several most significant bits of the residue of f(t) modulo the prime p.

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

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

U2 - 10.1007/11533719_43

DO - 10.1007/11533719_43

M3 - Conference article

AN - SCOPUS:26844443101

SN - 0302-9743

VL - 3595

SP - 420

EP - 429

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 11th Annual International Conference on Computing and Combinatorics, COCOON 2005

Y2 - 16 August 2005 through 29 August 2005

ER -

Quantum noisy rational function reconstruction

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this