Skip to content

Latest commit

 

History

History

backdoor_generator

Ways to generate a non-prime DH modulus to create a NOBUS backdoor

The obvious way of building a backdoor is to ease the discrete logarithm problem of one of the public key. This can be achieved by making one of the following discrete logarithm easier:

  • Pollard Rho (O(sqrt(p)) with p the order of the base)
  • NFS (depends on the modulus)
  • SNFS (depends on the modulus as well)
  • Pohlig-Hellman (O(sqrt(q)) with q largest factor of the order)

In order to make the backdoor NOBUS we use a composite modulus, there are two methods here: hide in the composite modulus a small subgroup generated by a specific generator (CM-HSS), or hide in the composite modulus a smooth order that we can use with Pohlig-Hellman (CM-HSO). These methods are documented in backdoor_generator.sage and are detailed in /whitepaper.tex (work in progress paper).