Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve
Date
2018-01-01
Author
Küçüksakallı, Ömer
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
235
views
0
downloads
Cite This
We give another proof of the Lucas-Lehmer test by using a singular cubic curve. We also illustrate a practical way to choose a starting term for the Lucas-Lehmer-Riesel test by trial and error. Moreover, we provide a nondeterministic test for determining the primality of integers of the form N = hp(n) - 1 for any odd prime p. We achieve these by using the group structure on a singular cubic curve induced from the group law of elliptic curves.
Subject Keywords
Elliptic curve
,
Jacobi symbol
,
Dickson polynomial
,
Lucas sequence
URI
https://hdl.handle.net/11511/55366
Journal
JOURNAL OF INTEGER SEQUENCES
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
A New Algorithm for Residue Multiplication Modulo 2(521)-1
Ali, Shoukat; Cenk, Murat (2016-12-02)
We present a new algorithm for residue multiplication modulo the Mersenne prime p = 2(521) - 1 based on the Toeplitz matrix-vector product. For this modulus, our algorithm yields better result in terms of the total number of operations than the previously known best algorithm of Granger and Scott presented in Public Key Cryptography (PKC) 2015. We have implemented three versions of our algorithm to provide an extensive comparison - according to the best of our knowledge with respect to the well-known algori...
A Hilbert Space of Probability Mass Functions and Applications on the Sum-Product Algorithm
Bayramoglu, Muhammet Fatih; Yılmaz, Ali Özgür (2008-09-05)
In this paper a Hilbert space structure of probability mass functions (PMF) will be presented. The tools provided by the Hilbert space, specifically the norm and the inner product, may be useful while analyzing and improving the sum-product algorithm in many aspects. Our approach provides a metric distance between PMFs and a new point of a view of the log-likelihood ratio (LLR) such that the LLR representation is nothing but a Hilbert space representation.
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three
Cenk, Murat; Hasan, M. Anwar (2018-03-01)
In this paper, we first present an enhancement of the well-known Karatsuba 2-way and 3-way algorithms for characteristic three fields, denoted by where nae1. We then derive a 3-way polynomial multiplication algorithm with five 1/3 sized multiplications that use interpolation in . Following the computation of the arithmetic and delay complexity of the proposed algorithm, we provide the results of our hardware implementation of polynomial multiplications over and . The final proposal is a new 3-way polynomial...
A generalized fixed point free automorphism of prime power order
Ercan, Gülin (2012-06-01)
Let G be a finite group and alpha be an automorphism of G of order p(n) for an odd prime p. Suppose that alpha acts fixed point freely on every alpha-invariant p'-section of G, and acts trivially or exceptionally on every elementary abelian alpha-invariant p-section of G. It is proved that G is a solvable p-nilpotent group of nilpotent length at most n + 1, and this bound is best possible.
A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials
Özbudak, Ferruh; Cenk, Murat (2013-10-01)
In this paper, Hermite polynomial representation is proposed as an alternative way to represent finite fields of characteristic two. We show that multiplication in Hermite polynomial representation can be achieved with subquadratic space complexity. This representation enables us to find binomial or trinomial irreducible polynomials which allows us faster modular reduction over binary fields when there is no desirable such low weight irreducible polynomial in other representations. We then show that the pro...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ö. Küçüksakallı, “A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve,”
JOURNAL OF INTEGER SEQUENCES
, pp. 0–0, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55366.