메뉴 건너뛰기




Volumn 11, Issue 1, 2010, Pages 23-32

Nonce generation for the digital signature standard

Author keywords

Digital signature algorithm; Linear congruential generator; Nonce

Indexed keywords

DIGITAL SIGNATURE ALGORITHMS; DIGITAL SIGNATURE STANDARD; HIGH PROBABILITY; LINEAR CONGRUENTIAL GENERATOR; LINEAR CONGRUENTIAL GENERATOR (LCG); MULTIPLE RECURSIVE GENERATORS; NONCE; PSEUDO-RANDOM NUMBERS;

EID: 79951702367     PISSN: 1816353X     EISSN: 18163548     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (6)

References (22)
  • 1
    • 51249173801 scopus 로고
    • On Lov́asz' lattice reduction and the nearest lattice point problem
    • L. Babai, "On Lov́asz' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
    • (1986) Combinatorica , vol.6 , Issue.1 , pp. 1-13
    • Babai, L.1
  • 3
    • 0024303956 scopus 로고
    • Inferring sequences produced by pseudo random number generators
    • J. Boyar, "Inferring sequences produced by pseudo random number generators," Journal of the ACM, vol. 36, no. 1, pp. 129-141, 1989.
    • (1989) Journal of the ACM , vol.36 , Issue.1 , pp. 129-141
    • Boyar, J.1
  • 10
    • 31644449755 scopus 로고    scopus 로고
    • Research issues and challenges for multiple digital signatures
    • M. S. Hwang and C. C. Lee, "Research issues and challenges for multiple digital signatures," International Journal of Network Security, vol. 1, no. 1, pp. 1-7, 2005.
    • (2005) International Journal of Network Security , vol.1 , Issue.1 , pp. 1-7
    • Hwang, M.S.1    Lee, C.C.2
  • 11
    • 0001134554 scopus 로고    scopus 로고
    • Lattice reduction: A toolbox for the cryptanalyst
    • A. Joux and J. Stern, "Lattice reduction: A toolbox for the cryptanalyst," Journal of Cryptology, vol. 11, no. 3, pp.161-185, 1998.
    • (1998) Journal of Cryptology , vol.11 , Issue.3 , pp. 161-185
    • Joux, A.1    Stern, J.2
  • 13
  • 14
    • 0006890305 scopus 로고
    • Seminumerical Algorithms
    • Addison-Wesley, Reading, Mass
    • D. E. Knuth, Seminumerical Algorithms, The Art of Computer Programming (Vol. 2), Addison-Wesley, Reading, Mass., 1969.
    • (1969) The Art of Computer Programming , vol.2
    • Knuth, D.E.1
  • 15
    • 0021819410 scopus 로고
    • Deciphering a linear congruential encryption
    • D. E. Knuth, "Deciphering a linear congruential encryption," IEEE Transactions on Information Theory, vol. 83, no. 11, pp. 49-52, 1985.
    • (1985) IEEE Transactions on Information Theory , vol.83 , Issue.11 , pp. 49-52
    • Knuth, D.E.1
  • 16
    • 84875360956 scopus 로고
    • National Institute of Standards and Technology (NIST)
    • May 19
    • National Institute of Standards and Technology (NIST), FIPS Publication 186: Digital Signature Standard, May 19, 1994.
    • (1994) FIPS Publication Digital Signature Standard , vol.186
  • 20
    • 84892526019 scopus 로고    scopus 로고
    • Statistical properties of digital piecewise linear chaotic maps and their roles in cryptography and pseudo-random coding
    • Dec
    • S. Li, Q. Li, W. Li, X. Mou, and Y. Cai, "Statistical properties of digital piecewise linear chaotic maps and their roles in cryptography and pseudo-random coding," Proceedings of the 8th IMA International Conference, pp. 205-221, Dec. 2001.
    • (2001) Proceedings of the 8th IMA International Conference , pp. 205-221
    • Li, S.1    Li, Q.2    Li, W.3    Mou, X.4    Cai, Y.5
  • 21
    • 0003987443 scopus 로고    scopus 로고
    • Cryptography: Theory and Practice
    • Chapman & Hall, 3rd edition
    • D. Stinson, Cryptography: Theory and Practice, Chapman & Hall, 3rd edition, 2006.
    • (2006)
    • Stinson, D.1
  • 22
    • 84968520264 scopus 로고
    • Random numbers generated by linear recurrence modulo two
    • R. C. Tausworthe, "Random numbers generated by linear recurrence modulo two," Mathematics of Computation, vol. 19, no. 90, pp. 201-209, 1965.
    • (1965) Mathematics of Computation , vol.19 , Issue.90 , pp. 201-209
    • Tausworthe, R.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.