Now showing items 1-1 of 1

    • Sparse Boolean equations and circuit lattices 

      Semaev, Igor (Springer, 2010)
      A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In ...
      Peer reviewedJournal article