메뉴 건너뛰기




Volumn 4752 LNCS, Issue , 2007, Pages 58-73

Experiments on the linear algebra step in the number field sieve

Author keywords

Block lanczos; Ethernet; Integer factoring; Number field sieve; Parallel computation

Indexed keywords

ETHERNET; INTEGER PROGRAMMING; PARALLEL PROCESSING SYSTEMS;

EID: 38149079783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75651-4_5     Document Type: Conference Paper
Times cited : (14)

References (10)
  • 1
    • 0013460463 scopus 로고
    • The development of the number field sieve
    • Lenstra, A.K, Lenstra Jr, H.W, eds, Springer, Heidelberg
    • Lenstra, A.K., Lenstra Jr., H.W. (eds.): The development of the number field sieve. Lecture Notes in Mathematics, vol. 1554. Springer, Heidelberg (1993)
    • (1993) Lecture Notes in Mathematics , vol.1554
  • 2
    • 38149039671 scopus 로고    scopus 로고
    • Kleinjung, T.: rsa200 (2005), http://www.crypto-world.com/announcements/ rsa200.txt
    • (2005) Kleinjung, T.: Rsa200
  • 3
    • 38149051760 scopus 로고    scopus 로고
    • Silverman, R.D.: A cost-based security analysis of symmetric and asymmetric key lengths. RSA Laboratories' Bulletin, (revised 2001) (2000), http://www.rsasecurity.com/rsalabs/node.asp?id=2088
    • Silverman, R.D.: A cost-based security analysis of symmetric and asymmetric key lengths. RSA Laboratories' Bulletin, (revised 2001) (2000), http://www.rsasecurity.com/rsalabs/node.asp?id=2088
  • 4
    • 35248814230 scopus 로고    scopus 로고
    • Leyland, P., Lenstra, A., Dodson, B., Muffett, A., Wagstaff, S.: MPQS with three large primes. In: Fieker, C., Kohel, D.R. (eds.) ANTS-V. LNCS, 2369, pp. 446-460. Springer, Heidelberg (2002)
    • Leyland, P., Lenstra, A., Dodson, B., Muffett, A., Wagstaff, S.: MPQS with three large primes. In: Fieker, C., Kohel, D.R. (eds.) ANTS-V. LNCS, vol. 2369, pp. 446-460. Springer, Heidelberg (2002)
  • 6
    • 84957682846 scopus 로고
    • A block Lanczos algorithm for finding dependencies over GF
    • Guillou, L.C, Quisquater, J.J, eds, EUROCRYPT 1995, Springer, Heidelberg
    • Montgomery, P.L.: A block Lanczos algorithm for finding dependencies over GF(2). In: Guillou, L.C., Quisquater, J.J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 106-120. Springer, Heidelberg (1995)
    • (1995) LNCS , vol.921 , pp. 106-120
    • Montgomery, P.L.1
  • 7
    • 84968521645 scopus 로고    scopus 로고
    • Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
    • Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Mathematics of Computation 62, 333-350 (2004)
    • (2004) Mathematics of Computation , vol.62 , pp. 333-350
    • Coppersmith, D.1
  • 8
    • 38149046063 scopus 로고    scopus 로고
    • Distributed linear algebra
    • Montgomery, P.L.: Distributed linear algebra. In: presentation slides for ECC2000 (2000) http://www.cacr.math.uwaterloo.ca/conferences/2000/ecc2000/ montgomery.p8
    • (2000) presentation slides for ECC2000
    • Montgomery, P.L.1
  • 9
    • 84957652084 scopus 로고    scopus 로고
    • Golliver, R.A., Lenstra, A.K., McCurley, K.S.: Lattice sieving and trial division. In: Huang, M-D.A., Adleman, L.M. (eds.) ANTS-I. LNCS, 877, pp. 18-27. Springer, Heidelberg (1994)
    • Golliver, R.A., Lenstra, A.K., McCurley, K.S.: Lattice sieving and trial division. In: Huang, M-D.A., Adleman, L.M. (eds.) ANTS-I. LNCS, vol. 877, pp. 18-27. Springer, Heidelberg (1994)


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