We demonstrate an efficient method for computing a Gröbner basis of a zero-dimensional ideal describing the key-recovery problem from a single plaintext/ciphertext pair for the full AES-128. This Gröbner basis is relative to a degree-lexicographical order. We investigate whether the existence of this Gröbner basis has any security implications for the AES.

In this paper we present a first approximation to the automatic detection of zero subjects and impersonal constructions in Brazilian Portuguese. To the best of our knowledge, this is the first attempt of approaching such task using machine learning in Portuguese. We compiled a corpus containing more than 5,600 instances annotated with the classes to be identified: explicit subjects, zero subjec...

The so-called ZOH discretization or step-invariant transformation is not one-to-one and hence one can not recover the continuous-time system from its discretized model without further information. Here we show that it is possible to reconstruct a continuous-time rational transfer function based on discretized models at several, suitably chosen, sampling rates. The results also relate to the pro...

We consider the random graph M n ¯ p on the set [n], were the probability of {x, y} being an edge is p |x−y| , and ¯ p = (p 1 , p 2 , p 3 , ...) is a series of probabilities. We consider the set of all ¯ q derived from ¯ p by inserting 0 probabilities to ¯ p, or alternatively by decreasing some of the p i. We say that ¯ p hereditarily satisfies the 0-1 law if the 0-1 law (for first order logic)...