✦ LIBER ✦

Improving the strict avalanche characteristics of cryptographic functions

✍ Scribed by Jennifer Seberry; Xian-Mo Zhang; Yuliang Zheng

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 419 KB
Volume: 50
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)90042-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the number of functions satisf

Bounds on the number of functions satisfying the Strict Avalanche Criterion

✍ Thomas W. Cusick 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 268 KB

An upper bound on the number of function

An upper bound on the number of functions satisfying the Strict Avalanche Criterion

✍ Luke O'Connor 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Cryptographic keys for improving the rel

Cryptographic keys for improving the reliability of ciphers

✍ Czeslaw Kościelny; Wladyslaw Mochnacki 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 175 KB

An algorithm for the computation of stri

An algorithm for the computation of strict approximations in subspaces of spline functions

✍ Hans Strauss 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 790 KB

Improvement of the aging characteristics

Improvement of the aging characteristics of deuterium lamp

✍ Tatsuya Zama; Koichi Awazu; Hideo Onuki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 323 KB

A New Characteristic of the Identity Fun

A New Characteristic of the Identity Function

✍ Jean-Marie De Koninck; Imre Kátai; Bui Minh Phong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 338 KB

In 1992, C. Spiro [7] showed that if f is a multiplicative function such that f (1)=1 and such that f ( p+q)= f ( p)+ f (q) for all primes p and q, then f(n)=n for all integers n 1. Here we prove the following: for all primes p and integers m 1, (1) then f (n)=n for all integers n 1. Proof. First