Cryptology ePrint Archive: Report 2021/913

Available versions in chronological order


Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
Stefano Barbero and Emanuele Bellini and Carlo Sanna and Javier Verbel

Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
Stefano Barbero and Emanuele Bellini and Carlo Sanna and Javier Verbel
Original publication (with minor differences): Discrete Applied Mathematics


[ Cryptology ePrint archive ]