Exponential Multiplication Schemes

DSpace Repository

Exponential Multiplication Schemes

Borchert, Bernd; Reinhardt, Klaus
Dateien:
Thumbnail
106. KB
PDF
URI: http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-25189
http://hdl.handle.net/10900/48969
Dokumentart: Report
Date: 2006
Source: WSI ; 2006 ; 10
Language: German
Faculty: 7 Mathematisch-Naturwissenschaftliche Fakultät
Department: Informatik
DDC Classifikation: 004 - Data processing and computer science
Keywords: Faktorisierung
License: http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=de http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=en
Order a printed copy: Print-on-Demand
Show full item record

Inhaltszusammenfassung:

We present an idea to describe a polynomial with 2^n distinct integer zeros by an n-tuple of integers via a scheme of n recurring equations. We call such an n-tuple an exponential multiplication scheme of size n. Exponential multiplication schemes of size 1,2,3, and 4 are presented. Under the assumption that fast exponential multiplication scheme generators exist we suggest a fast randomized heuristic for the factorization problem.

This item appears in the following Collection(s)