# Re: First quantum byte!

*From*: Mike Amling <nospam@xxxxxxxxxxx>*Date*: Thu, 01 Dec 2005 21:55:36 GMT

`Gabriele Avosani wrote:`

Starting from a number c that is the product of m and n prime numbers, does this method reveal the first bits of m and n ? I have a similar method for this, it's not a quantum tecnique and it is not a Pauli trap, but it indeed reveal the first 8/10 bits of m and n, starting with c.

I'm surprised. Can you determine the first 8 to 10 bits of the two prime factors of this composite number (shown in base 16):

I'm surprised. Can you determine the first 8 to 10 bits of the two prime factors of this composite number (shown in base 16):

48BD35D32ECC151DC2CCF74A83B2CFB9FA16E2E1\ BB52CF1F1D82DABC2D4C3CC168B7B67C06AE9382\ 532B09DDE197407FA90696C82E02D8668AA4B63D\ 6D14E086B4

--Mike Amling .

**Follow-Ups**:**Re: First quantum byte!***From:*Mxsmanic

**Re: First quantum byte!***From:*Gabriele Avosani

**References**:**Re: First quantum byte!***From:*Gabriele Avosani

- Prev by Date:
**Choice of a and b in SRP-6** - Next by Date:
**Re: C-equivalence aware hash function** - Previous by thread:
**Re: First quantum byte!** - Next by thread:
**Re: First quantum byte!** - Index(es):