Quantum noisy rational function reconstruction

Sean Hallgren; Alexander Russell; Igor E. Shparlinski

Quantum noisy rational function reconstruction

Sean Hallgren^*, Alexander Russell, Igor E. Shparlinski

^*Corresponding author for this work

Department of Computing

Research output: Contribution to journal › Article

2 Citations (Scopus)

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
Pages (from-to)	420-429
Number of pages	10
Journal	Lecture Notes in Computer Science
Volume	3595
Publication status	Published - 2005

Fingerprint

Cite this

Hallgren, S., Russell, A., & Shparlinski, I. E. (2005). Quantum noisy rational function reconstruction. Lecture Notes in Computer Science, 3595, 420-429.

@article{2ebe66877ae84fe29ac728052ede2e7d,

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

language = "English",

volume = "3595",

pages = "420--429",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer, Springer Nature",

}

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

M3 - Article

VL - 3595

SP - 420

EP - 429

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

Access to Document

Link to publication in Scopus