Presentation	1995/12/14 On the Reduced Recognition of a Primitive Element in Z^*_n Hideo Suzuki, Tadao Nakamura, Tetsuo Ikeda,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The primitive roots in Z^*_n are defined and exist if n=2, 4, p^α, 2p^α. Knuth showed the definition of the primitive roots in Z^*_ as the necessary and sufficient condition for the recognition of a primitive root in Z^*_. In the paper, we define the primitive elements in Z^*_n as generalized primitive roots that take the maximum multiplicative order. And we mention two theorems for the reduced recognition of a primitive element in Z^*_n for any composite n. The two theorems allow us to code a fast recognition program for a primitive element.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	primitive element modulo a composite / primitive root / universal exponent
Paper #	ISEC95-32
Date of Issue

Conference Information
Committee	ISEC
Conference Date	1995/12/14(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Information Security (ISEC)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On the Reduced Recognition of a Primitive Element in Z^*_n
Sub Title (in English)
Keyword(1)	primitive element modulo a composite
Keyword(2)	primitive root
Keyword(3)	universal exponent
1st Author's Name	Hideo Suzuki
1st Author's Affiliation	Dept. of Electrical Communications, Tohoku University()
2nd Author's Name	Tadao Nakamura
2nd Author's Affiliation	Graduate School of Information Sciences, Tohoku University
3rd Author's Name	Tetsuo Ikeda
3rd Author's Affiliation	Dept. of Electrical and Computer Eng., Nagoya Institute of Technology
Date	1995/12/14
Paper #	ISEC95-32
Volume (vol)	vol.95
Number (no)	422
Page	pp.pp.-
#Pages	6
Date of Issue