The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Abstract. Biology has moved from a bench-based discipline to a bioinformational science in modern times but application of computational and analytical methods of informatics in it...
: To enhance users' social embedding within learning networks, we propose to establish ad hoc transient communities. These communities serve a particular goal, exist for a lim...
Adriana J. Berlanga, Peter B. Sloep, Liesbeth Kest...
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...