activity
20112024
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations · 79 across the 4 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2024

On the Low Weight Polynomial Multiple Problem

Ferucio Laurenţiu Ţiplea, Simona-Maria Lăzărescu

Finding a low-weight multiple (LWPM) of a given polynomial is very useful in the cryptanalysis of stream ciphers and arithmetic in finite fields. There is no known deterministic po…