Geodesic
Short signatures from the difficulty of factoring problem
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 2 (2013), pp. 27-36.

Voir la notice de l'article provenant de la source Math-Net.Ru

For some practical applications there is a need of digital signature schemes (DSSes) with short signatures. The paper presents some new DSSes based on the difficulty of the factorization problem, the signature size of them being equal to 160 bits. The signature size is significantly reduced against the known DSS. The proposed DSSes are based on the multilevel exponentiation procedures. Three type of the exponentiation operations are used in the DSSes characterized in performing multiplication modulo different large numbers. As modulus prime and composite numbers are used. The latters are difficult for factoring and have relation with the prime modulus. 
@article{BASM_2013_2_a3,
     author = {N. A. Moldovyan and A. A. Moldovyan and V. A. Shcherbacov},
     title = {Short signatures from the difficulty of factoring problem},
     journal = {Buletinul Academiei de \c{S}tiin\c{t}e a Republicii Moldova. Matematica},
     pages = {27--36},
     publisher = {mathdoc},
     number = {2},
     year = {2013},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/BASM_2013_2_a3/}
}
TY  - JOUR
AU  - N. A. Moldovyan
AU  - A. A. Moldovyan
AU  - V. A. Shcherbacov
TI  - Short signatures from the difficulty of factoring problem
JO  - Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
PY  - 2013
SP  - 27
EP  - 36
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BASM_2013_2_a3/
LA  - en
ID  - BASM_2013_2_a3
ER  - 
%0 Journal Article
%A N. A. Moldovyan
%A A. A. Moldovyan
%A V. A. Shcherbacov
%T Short signatures from the difficulty of factoring problem
%J Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
%D 2013
%P 27-36
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BASM_2013_2_a3/
%G en
%F BASM_2013_2_a3
N. A. Moldovyan; A. A. Moldovyan; V. A. Shcherbacov. Short signatures from the difficulty of factoring problem. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 2 (2013), pp. 27-36. http://geodesic.mathdoc.fr/item/BASM_2013_2_a3/

[1] Rivest R. L., Shamir A., Adleman L. M., “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Communications of the ACM, 21:2 (1978), 120–126 | DOI | MR | Zbl

[2] Rabin M. O., Digitalized signatures and public key functions as intractable as factorization, Technical report MIT/LCS/TR-212, MIT Laboratory for Computer Science, 1979

[3] Fiat A., Shamir A., “How to prove yourself: Practical solutions to identification and signature problems”, Advances in cryptology – CRYPTO'86, LNCS, 263, Springer-Verlag, 1987, 186–194 | MR

[4] Menezes A. J., Vanstone S. A., Handbook of Applied Cryptography, CRC Press, 1996

[5] Pintsov L., Vanstone S., “Postal revenue collection in the digital age”, Proceedings of Financial Cryptography, LNCS, 1962, ed. Y. Frankel, Springer-Verlag, 2000, 105–120

[6] ElGamal T., “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory, IT-31:4 (1985), 469–472 | DOI | MR | Zbl

[7] Schnorr C. P., “Efficient signature generation by smart cards”, J. Cryptology, 4 (1991), 161–174 | DOI | MR | Zbl

[8] ANSI X9.62 and FIPS 186-2, Elliptic curve signature algorithm, 1998

[9] Moldovyan N. A., “New Public Key Cryptosystems Based on Difficulty of Factorization and Discrete Logarithm problems”, 3d Int. Workshop IF' 07 Proc. (St. Petersburg, May 28–29, 2007), LNGC, 14, Springer, 160–172

[10] Moldovyan N. A., “Short Signatures from Difficulty of Factorization Problem”, International Journal of Network Security, 8:1 (2009), 90–95 http://ijns.femto.com.tw

[11] Moldovyan N. A., “An approach to shorten digital signature length”, Computer Science Journal of Moldova, 14:3(42) (2006), 390–396 | MR | Zbl

[12] Gordon J., “Strong primes are easy to find”, Advances in cryptology – EUROCRYPT'84, LNCS, 209, Springer-Verlag, 1985, 216–223 | MR

[13] Pieprzyk J., Hardjono Th., Seberry J., Fundumentals of Computer Security, Springer-Verlag, Berlin, 2003