In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Finite element simulations in computer graphics are typically based on tetrahedral or hexahedral elements, which enables simple and efficient implementations, but in turn requires...
Sebastian Martin, Peter Kaufmann, Mario Botsch, Ma...
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
In service-based systems, one of the most basic requirements for service matching is to find services with functionalities similar to the expected functionality of a given servic...