Search results for "primitive-root"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
45	Andrzej Paszkiewicz	A new prime p for which the least primitive root (modp) and the least primitive root (modp2) are not equal.	Math. Comput.	2009	DBLP DOI BibTeX RDF
32	Guozhen Xiao, Shimin Wei	Fast Algorithms for Determining the Linear Complexity of Period Sequences.	INDOCRYPT	2002	DBLP DOI BibTeX RDF	cryptography, fast algorithm, linear complexity, periodic sequence, k-error linear complexity
32	Elena Czeizler, Lila Kari, Shinnosuke Seki	On a Special Class of Primitive Words.	MFCS	2008	DBLP DOI BibTeX RDF
29	Jun Zhang, LiQun Chen	An Improved Algorithm for Discrete Logarithm Problem.	ESIAT (2)	2009	DBLP DOI BibTeX RDF	discrete logarithm problem (DLP), baby-step giant-step, primitive-root, hash table
29	E. V. Krishnamurthy	On the Conversion of Hensel Codes to Farey Rationals.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	reduced residue system, Euclidean filtering algorithm, Euler's totient function, Farey rationals, isobaric set, multiplicative inverse, p-adic arithmetic, primitive root, factorization, Conversion, index, greatest common divisor, Hensel code, extended Euclidean algorithm
22	V. P. Ramesh, R. Gowtham	The Inverse of a Bad Primitive Root is Not Bad.	Am. Math. Mon.	2023	DBLP DOI BibTeX RDF
22	Seoyoung Kim, M. Ram Murty	Corrigendum to "Artin's primitive root conjecture for function fields revisited" [Finite Fields Appl. 67 (2020) 101713].	Finite Fields Their Appl.	2022	DBLP DOI BibTeX RDF
22	V. P. Ramesh, M. Makeshwari	A Prime Primitive Root p of 2p + 1 is a Sophie Germain Prime.	Am. Math. Mon.	2022	DBLP DOI BibTeX RDF
22	V. P. Ramesh, M. Makeshwari	Least Primitive Root of any Safe Prime is Prime.	Am. Math. Mon.	2022	DBLP DOI BibTeX RDF
22	Seoyoung Kim, M. Ram Murty	Artin's primitive root conjecture for function fields revisited.	Finite Fields Their Appl.	2020	DBLP DOI BibTeX RDF
22	Stephan Ramon Garcia, Elvis Kahoro, Florian Luca	Primitive Root Bias for Twin Primes.	Exp. Math.	2019	DBLP DOI BibTeX RDF
22	Lee Troupe	Bounded gaps between prime polynomials with a given primitive root.	Finite Fields Their Appl.	2016	DBLP DOI BibTeX RDF
22	Pallab Kanti Dey, Balesh Kumar	An Analogue of Artin's Primitive Root Conjecture.	Integers	2016	DBLP BibTeX RDF
22	Shri Prakash Dwivedi	Computing Multiplicative Order and Primitive Root in Finite Cyclic Group.	CoRR	2014	DBLP BibTeX RDF
22	Shri Prakash Dwivedi	Computing multiplicative order and primitive root in finite cyclic group.	IC3	2014	DBLP DOI BibTeX RDF
22	Christopher Ambrose	On the Least Primitive Root Expressible as a Sum of Two Squares.	Integers	2013	DBLP BibTeX RDF
22	Na Ma, Xiquan Liang	Basic Properties of Primitive Root and Order Function.	Formaliz. Math.	2012	DBLP DOI BibTeX RDF
22	Pieter Moree	Artin's Primitive Root Conjecture -- A Survey --.	Integers	2012	DBLP BibTeX RDF
22	Andrzej Paszkiewicz, Andrzej Schinzel	Numerical calculation of the density of prime numbers with a given least primitive root.	Math. Comput.	2002	DBLP DOI BibTeX RDF
22	Andrzej Paszkiewicz, Andrzej Schinzel	On the least prime primitive root modulo a prime.	Math. Comput.	2002	DBLP DOI BibTeX RDF
22	Huapeng Wu, M. Anwarul Hasan	Efficient Exponentiation of a Primitive Root in GF(2^m).	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF
22	Jianqin Zhou, Qiang Zheng	A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3).	CANS	2006	DBLP DOI BibTeX RDF	Cryptography, linear complexity, periodic sequence, minimal polynomial
16	Dorit Aharonov, Vaughan Jones, Zeph Landau	A Polynomial Quantum Algorithm for Approximating the Jones Polynomial.	Algorithmica	2009	DBLP DOI BibTeX RDF
16	Dorit Aharonov, Vaughan Jones, Zeph Landau	A polynomial quantum algorithm for approximating the Jones polynomial.	STOC	2006	DBLP DOI BibTeX RDF	Jones Polynomial, Temperley-Lieb, braids, unitary representation, algorithm, approximation, knots, quantum
11	Yun Kyoung Han, Jin-Ho Chung, Kyeongcheol Yang	On the k-Error Linear Complexity of pm -Periodic Binary Sequences.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
11	Qi Cheng 0001	Derandomization of Sparse Cyclotomic Integer Zero Testing.	FOCS	2007	DBLP DOI BibTeX RDF
11	S. Anand, Gurumurthi V. Ramanan	Periodicity, complementarity and complexity of 2-adic FCSR combiner generators.	AsiaCCS	2006	DBLP DOI BibTeX RDF	?-sequences, 2-adic complexity, stream ciphers, combiners, linear complexity, pseudorandom number generators, feedback shift registers, FCSR
11	Shimin Wei, Guolong Chen, Guozhen Xiao	A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences.	CISC	2005	DBLP DOI BibTeX RDF
11	Wilfried Meidl	How Many Bits have to be Changed to Decrease the Linear Complexity?.	Des. Codes Cryptogr.	2004	DBLP DOI BibTeX RDF	algorithm, stream ciphers, linear complexity, periodic sequences, k-error linear complexity
11	Juhani Karhumäki, Michel Latteux, Ion Petre	The Commutation with Codes and Ternary Sets of Words.	STACS	2003	DBLP DOI BibTeX RDF
11	Masayuki Noro, Kazuhiro Yokoyama	Yet another practical implementation of polynomial factorization over finite fields.	ISSAC	2002	DBLP DOI BibTeX RDF
11	Armin Nückel, Andreas Klappenecker	On the Parametrization of Algebraic Discrete Fourier Transforms.	EUROCAST	1997	DBLP DOI BibTeX RDF
11	William H. Payne, John R. Rabung, T. P. Bogyo	Coding the Lehmer pseudo-random number generator.	Commun. ACM	1969	DBLP DOI BibTeX RDF	prime factorization, primitive roots, uniform frequency function, uniform probability density, simulation, random number, modular arithmetic, pseudo-random number