SCOPUS 정보 검색 플랫폼

Volumn 3, Issue 1, 1992, Pages 17-31

Discrete logarithms a parallel pseudorandom pattern generator analysis method

Author keywords

Cellular automata; discrete logarithms; LFSR; phaseshift; pseudorandom pattern generator

Indexed keywords

MATHEMATICAL TECHNIQUES - POLYNOMIALS;

BUILT IN SELF TEST SYSTEM; CELLULAR AUTOMATA; DISCRETE LOGARITHMS; LSFR; PHASESHIFT; PSEUDORANDOM PATTERN GENERATOR;

ELECTRONIC CIRCUITS;

EID: 0026818726 PISSN: 09238174 EISSN: 15730727 Source Type: Journal
DOI: 10.1007/BF00159828 Document Type: Article

Times cited : (12)

References (14)

1
- 0002279899
- Design considerations for parallel pseudorandom pattern generators
- (1990) J. Elect. Testing: Theory and Appl. , vol.1 , pp. 73-87
- Bardell, P.H.¹

2
- 0025402263
- Cellular automata circuits for built-in self-test
- (1990) IBM J. Res. and Dev. , vol.34 , pp. 389-405
- Hortensius, P.D.¹ McLeod, R.D.² Podaima, B.W.³

3
- 0022756561
- Pseudorandom arrays for built-in tests
- (1986) IEEE Trans. Comput. , vol.100-135 , pp. 653-658
- Bardell, P.H.¹ McAnney, W.H.²

4
- 84935249999
- M. Serra, D.M. Miller, and J.C. Muzio, “Linear cellular automata and LFSRs are isomorphic,” Proc. Third Tech. Workshop on New Dir. for IC Testing, Halifax, N.S. pp. 213–233, October, 1988.

5
- 84935249996
- P.H. Bardell, “Analysis of cellular automata used as parallel pseudorandom pattern generators,”Proc. IEEE Int. Test Conf., pp. 762–767, September 10–14, 1990.

6
- 35949018560
- Statistical mechanics of cellular automata
- (1983) Rev. Modern Physics , vol.55 , pp. 601-644
- Wolfram, S.¹

7
- 46149128523
- Random sequence generation by cellular automata
- (1986) Adv. in Appl. Math. , vol.7 , pp. 127-169
- Wolfram, S.¹

8
- 84957014368
- Discrete logarithms in finite fields and their cryptographic significance
- Lecture Notes in Computer Science 209, Springer-Verlag, Berlin
- (1984) Advances in Crypotology: Proc. EUROCRYPT '84 , pp. 225-314
- Odlyzko, A.M.¹

9
- 84935250022
- L. Adleman, “A subexponential algorithm for the discrete logarithm problem with applications to cryptography,” Proc. IEEE 20th Annual Symposium of Foundations of Computer Science, pp. 55–60, 1979.

10
- 0021468777
- Fast evaluation of logarithms in fields of characteristic two
- (1984) IEEE Transactions on Information Theory , vol.30 IT , pp. 587-594
- Coppersmith, D.¹

11
- 0004201481
- rev. ed, Aegean Park Press, Laguna Hills, CA
- (1982) Shift Register Sequences
- Golomb, S.W.¹

13
- 84935250021
- M. Serra and T. Slater, “A Lanczos algorithm in a finite field and its application,”J. Combinatorial Mathematics and Combinatorial Computing, vol. 7, April 1990.

14
- 84935250026
- L.T. Wang and E.J. McCluskey, “A hybrid design of maximum length sequence generators,”Proc. IEEE Int. Test Conf., Washington, D.C., pp. 38–45, September 1986.

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