I'm not taking about calculation privkey from collection signatures. You will not find my solutions on net. i rebuild LLL and way of rearranged for testing one signature as part r s z for finding closest pointt as integer value.
And if someone of you do the same we can discus
Ok can you tell me what are the inegality you want to resolve?
the HNP problem is based on the following problem
α is a secret integer (it can be the privkey, or the nonce k for R).
The attacker is assumed to be given an oracle that given a random sequence of integers
ti , for i ∈ {1, . . . , m}, returns a sequence
ai such that
|ti.α − ai | mod q ≤ C
ti is a partial information knowed by the attacker. so if you don't have
ti it's impossible to resolve the inegality system.