Algebra of Polynomially Bounded Sequences and Negligible Functions
Formalized Mathematics · 2015
DOI: 10.1515/forma-2015-0029 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formalized Mathematics, 2015. Verfasst von Hiroyuki Okazaki. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-SA 3.0).
Abstract (Originalsprache)
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation between polynomially bounded sequences, using negligible functions.
Zitieren
APA
Okazaki, H. (2015). Algebra of Polynomially Bounded Sequences and Negligible Functions. Formalized Mathematics. https://doi.org/10.1515/forma-2015-0029
Vancouver
Okazaki H. Algebra of Polynomially Bounded Sequences and Negligible Functions. Formalized Mathematics. 2015. doi:10.1515/forma-2015-0029
BibTeX
@article{Okazaki2015,
author = {Okazaki, Hiroyuki},
title = {Algebra of Polynomially Bounded Sequences and Negligible Functions},
journal = {Formalized Mathematics},
year = {2015},
doi = {10.1515/forma-2015-0029}
}
EUVIMED