IEEE Communications Letters · 2004 · 58 citations · 4 references
ComputingComputer ScienceMathematicsAlgorithmsCryptographyInformation TheoryCryptographic ComplexityDigital SignaturesError-correcting CodesInformation-theoretic CryptographyCryptographic SignaturesSignature AnalysisSignature Scheme Constructions
Tightness of the Karystinos-Pados bounds was originally proved with four exceptions. In this letter, we modify the algorithm of constructing signatures removing three of these exceptions. For the fourth one the tighter bounds are derived.
4