Learn More
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization of N with given bits of p. It is well-known that this problem is polynomial-time solvable if at most half of the bits of p are unknown and if the unknown bits are located in one(More)
We look at iterated power generators si = s e i−1 mod N for a random seed s0 ∈ ZN that in each iteration output a certain amount of bits. We show that heuristically an output of (1 − 1 e) log N most significant bits per iteration allows for efficient recovery of the whole sequence. This means in particular that the Blum-Blum-Shub generator should be used(More)
TCHo is a public key encryption scheme based on a stream cipher component, which is particular suitable for low cost devices like RFIDs. In its basic version, TCHo offers no IND-CCA2 security, but the authors suggest to use a generic hybrid construction to achieve this security level. The implementation of this method however, significantly increases the(More)
Bulk B-C-N materials were synthesized under static high thermobaric conditions (20 GPa and 2,000 °C) in a multianvil apparatus from a polymer derived t-BC 1.97 N ceramic. The bulk samples were characterised using X-ray synchrotron radiation and analytical transmission electron microscopy in combination with electron energy loss spectroscopy. Polycrystalline(More)
We study the factoring with known bits problem, where we are given a composite integer N = p1p2. .. pr and oracle access to the bits of the prime factors pi, i = 1,. .. , r. Our goal is to find the full factorization of N in polynomial time with a minimal number of calls to the oracle. We present a rigorous algorithm that efficiently factors N given (1 − 1(More)
  • 1