SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Mathematics of Computation

Volumn 67, Issue 224, 1998, Pages 1637-1663

A space efficient algorithm for group structure computation

(1) Teske, Edlyn a,b

a DARMSTADT UNIVERSITY OF TECHNOLOGY (Germany)

b UNIVERSITY OF WATERLOO (Canada)

Author keywords

Class groups; Generic algorithms; Group structure computation; Pollard's method

Indexed keywords

EID: 0032366142 PISSN: 00255718 EISSN: None Source Type: Journal
DOI: 10.1090/s0025-5718-98-00968-5 Document Type: Article

Times cited : (26)

References (16)

1
- 0031510230
- On some computational problems in finite abelian groups
- MR 98a:11185
- J. Buchmann, M.J. Jacobson Jr., and E. Teske. On some computational problems in finite abelian groups. Mathematics of Computation. 66:1603-1687, 1997. MR 98a:11185
- (1997) Mathematics of Computation , vol.66 , pp. 1603-1687
- Buchmann, J.¹ Jacobson M.J., Jr.² Teske, E.³

2
- 0040553594
- An improved Monte Carlo factorization algoritl m
- MR 82a:10007
- R.P. Brent. An improved Monte Carlo factorization algoritl m. BIT, 20:176-184, 1980. MR 82a:10007
- (1980) BIT , vol.20 , pp. 176-184
- Brent, R.P.¹

3
- 0003049266
- Heuristics on class groups of number fields
- Number Theory, Springer-Verlag, New York. MR 85g:10007
- H. Cohen and H.W. Lenstra, Jr. Heuristics on class groups of number fields. In Number Theory, Lecture notes in Math., volume 1068, pages 33-62. Springer-Verlag, New York, 1984. MR 85g:10007
- (1984) Lecture Notes in Math. , vol.1068 , pp. 33-62
- Cohen, H.¹ Lenstra H.W., Jr.²

4
- 0003705361
- Springer-Verlag, Berlin. MR 94i:11105
- H. Cohen. A Course, in Computational Algebraic Number Theory. Springer-Verlag, Berlin, 1993. MR 94i:11105
- (1993) A Course, in Computational Algebraic Number Theory
- Cohen, H.¹

5
- 84915939958
- Random mapping statistic
- Advances in Cryptology - EUROCRYPT '89, Springer-Verlag, New York. MR 91h:94003
- P. Flajolet and A.M. Odiyzko. Random mapping statistic. In Advances in Cryptology - EUROCRYPT '89, Lecture Notes in Computer Sci., volume 434, pages 329-354, Springer-Verlag, New York, 1990. MR 91h:94003
- (1990) Lecture Notes in Computer Sci. , vol.434 , pp. 329-354
- Flajolet, P.¹ Odiyzko, A.M.²

6
- 0003657590
- Addison-Wesley, Reading, Massachusetts. MR 56:4281
- D.E. Knuth. The art of computer programming, Volume 3: Sorting and searching. Addison-Wesley, Reading, Massachusetts, 1973. MR 56:4281
- (1973) The Art of Computer Programming, Volume 3: Sorting and Searching , vol.3
- Knuth, D.E.¹

7
- 0003657590
- Addison-Wesley, Reading, Massachusetts. MR 51:14624
- D.E. Knuth. The, art of computer programming. Volume 1: Fundamental algorithms. Addison-Wesley, Reading, Massachusetts, 1975. MR 51:14624
- (1975) The, Art of Computer Programming. Volume 1: Fundamental Algorithms , vol.1
- Knuth, D.E.¹

8
- 0040223354
- Universität des Saarlandes, Saarbrücken, Germany
- LiDIA Group, Universität des Saarlandes, Saarbrücken, Germany. LiDIA - A library for computational number theory, Version 1.2, 1996.
- (1996) LiDIA - A Library for Computational Number Theory, Version 1.2

9
- 84966241531
- A Monte Carlo factoring algorithm with linear storage
- MR 85d:11106
- H.W. Lenstra, Jr. and C.P. Schnorr. A Monte Carlo factoring algorithm with linear storage. Mathematics of Computation, 43(167):289-311, 1984. MR 85d:11106
- (1984) Mathematics of Computation , vol.43 , Issue.167 , pp. 289-311
- Lenstra H.W., Jr.¹ Schnorr, C.P.²

10
- 0003948561
- of Mathematical Centre Tracts. Mathematisch Centrum. Amsterdam. MR 84d:10004
- H.W. Lenstra, Jr. and R. Tijdeman. editors. Computational methods in number theory, volume 154/155 of Mathematical Centre Tracts. Mathematisch Centrum. Amsterdam, 1982. MR 84d:10004
- (1982) Computational Methods in Number Theory , vol.154-155
- Lenstra H.W., Jr.¹ Tijdeman, R.²

11
- 0002139049
- The discrete logarithm problem
- Cryptology and Computational Number Theory, American Mathematic Society. MR 92d:11133
- K. McCurley. The discrete logarithm problem. In Cryptology and Computational Number Theory, Proc. Symp. Appl. Math., vol. 42, pages 49-74. American Mathematic Society, 1990. MR 92d:11133
- (1990) Proc. Symp. Appl. Math. , vol.42 , pp. 49-74
- McCurley, K.¹

12
- 84966238549
- Monte Carlo methods for index computation (mod p)
- MR 58:10684
- J.M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of Computation, 32(143):918-924, 1978. MR 58:10684
- (1978) Mathematics of Computation , vol.32 , Issue.143 , pp. 918-924
- Pollard, J.M.¹

13
- 0038933271
- Lenstra, Jr. and Tijdeman [LT82]. MR 85g:11118
- R.J. Schoof. Quadratic fields and factorization. In Lenstra, Jr. and Tijdeman [LT82], pages 235-286. MR 85g:11118
- Quadratic Fields and Factorization , pp. 235-286
- Schoof, R.J.¹

14
- 0000211152
- Class number, a theory of factorization and genera
- AMS, Providence, R.I., MR 47:4932
- D. Shanks. Class number, a theory of factorization and genera. In Proc. Symp. Pure Math. 20, pages 415-440. AMS, Providence, R.I., 1971. MR 47:4932
- (1971) Proc. Symp. Pure Math. , vol.20 , pp. 415-440
- Shanks, D.¹

15
- 84942550160
- Lower bounds for discrete logarithms and related problems
- Advances in Cryptology-Eurocrypt '97, Springer-Verlag, New York
- V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology-Eurocrypt '97, Lectures Notes in Computer Sci., Volume 1233, pp. 256-266, Springer-Verlag, New York, 1997.
- (1997) Lectures Notes in Computer Sci. , vol.1233 , pp. 256-266
- Shoup, V.¹

16
- 0040223355
- Generating random walks in groups
- MR 89a:68108
- J. Sattler and C.P. Schnorr. Generating random walks in groups. Ann.-Univ.-Sci.-Budapest.-Sect.-Comput., 6:65-79, 1985. MR 89a:68108
- (1985) Ann.-Univ.-Sci.-Budapest.-Sect.-Comput. , vol.6 , pp. 65-79
- Sattler, J.¹ Schnorr, C.P.²

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