Displaying similar documents to “Sequences of 0's and 1's”

Addendum to: "Sequences of 0's and 1's" (Studia Math. 149 (2002), 75-99)

Johann Boos, Toivo Leiger (2005)

Studia Mathematica

Similarity:

There is a nontrivial gap in the proof of Theorem 5.2 of [2] which is one of the main results of that paper and has been applied three times (cf. [2, Theorem 5.3, (G) in Section 6, Theorem 6.4]). Till now neither the gap has been closed nor a counterexample found. The aim of this paper is to give, by means of some general results, a better understanding of the gap. The proofs that the applications hold will be given elsewhere.

Algebra of Polynomially Bounded Sequences and Negligible Functions

Hiroyuki Okazaki (2015)

Formalized Mathematics

Similarity:

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