Code based signature schemes with special properties
Texte intégral
Documents relatifs
Using the Extended Forking Lemma, we prove in the fol- lowing that the signature scheme derived from the MQ-based zero-knowledge identification scheme is secure against adaptively
Schemes based on problems as syndrome decoding or decoding random codes are well studied for years and there doesn't exist polynomial time algorithm to solve those problems even in
void ibpsternanswer(unsigned int b, const BitSequence const * secret, const unsigned int const * sig, const BitSequence const * sigseed, const BitSequence const * y, const BitSe-
We are essentially concerned about this problem because it can be used to build a post-quantum signature scheme based on the hardness of solving random instances of PKP.. It is
So, traditional digital signature systems that are used presently in practice are vulnerable to attacks implemented on quantum computers.. The security of these systems
Sketch of proof Once again the proof is straightforward, receiving a Syndrome Decoding challenge, the simulator B will produce a sequence of games where he will process to
The security of our blind protocol is based on the security of a trapdoor function for the syndrome decoding problem: the CFS signature scheme for Hamming distance and on the
3 presents a general adaptation of Lyubashevsky’s framework to coding theory, not restricted to specific (quasi- cyclic) codes. 4 is devoted to expressing key recovery from a