# Search results for: Brigitte Vallée

Journal of Symbolic Computation > 2018 > 85 > C > 72-107

Lecture Notes in Computer Science > LATIN 2006: Theoretical Informatics > Regular Contributions > 224-237

Lecture Notes in Computer Science > Eurocal '87 > 376-378

Journal of Symbolic Computation > 2016 > 74 > C > 425-474

*b*. The worst-case number of iterations is linear in the size of the entries. In contrast, the average number of iterations...

*N*. We analyse the three main parameters of the binary continued fraction expansion, namely the height, the number of steps of the binary Euclidean algorithm, and finally the sum of the exponents of powers of 2 contained in the numerators...

Lecture Notes in Computer Science > LATIN 2000: Theoretical Informatics > Algebraic Algorithms > 343-354

Lecture Notes in Computer Science > Automata, Languages and Programming > Contributed Papers > 750-763

Lecture Notes in Computer Science > Advances in Cryptology — EUROCRYPT ’88 > Cryptanalysis > 281-291

*n*. The encryption and the decryption of these schemes are very simple when the factorisation of the modulus, a large composite number, is known. We show here that we can, for any odd

*n*, solve, in polynomial probabilistic...

Lecture Notes in Computer Science > Automata, Languages and Programming > Algorithm Analysis > 152-165

*subsequence*in a text (rather than a string understood as a sequence of consecutive symbols). A characteristic parameter is the number of occurrences of a given pattern

*w*of length

*m*as a subsequence in a random text of length

*n*generated by a memoryless source. Spacings between letters...

Lecture Notes in Computer Science > LATIN 2006: Theoretical Informatics > Regular Contributions > 689-702

Lecture Notes in Computer Science > Applied Algebra, Algebraic Algorithms and Error-Correcting Codes > 427-442

*n*. When

*n*is a power of a prime number, polynomial-time algorithms, either deterministic or probabilistic, allow one to solve these problems. The same is true, via the Chinese remainder theorem, when the factorisation of

*n*is known. A natural and important question is the following...

Information Security and Cryptography

Theory of Computing Systems > 2016 > 58 > 4 > 528-578