On an Analogue to the Lucas-lehmer-riesel Test Using Elliptic Curves
نویسندگان
چکیده
Following an idea of B. H. Gross, who presented an elliptic curve test for Mersenne primes Mp = 2 p − 1, we propose a similar test with elliptic curves for generalized Thabit primes K(h, n) := h · 2 − 1 for any positive odd number h and any integer n > log2(h) + 2.
منابع مشابه
Dynamically twisted algebra Aq,p;π̂(ĝl2) as current algebra generalizing screening currents of q-deformed Virasoro algebra
In this paper, we propose an elliptic algebra Aq,p;π̂(ĝl2) which is based on the relations RLL = LLR, where R and R are the dynamical R-maxtrices of A (1) 1 type face model with the elliptic moduli shifted by the center of the algebra. From the Ding-Frenkel correspondence , we find that its corresponding (Drinfeld) current algebra at level one is the algebra of screening currents for qdeformed V...
متن کاملDynamically twisted algebra Aq,p;π̂(ŝl2) as current algebra generalizing screening currents of q-deformed Virasoro algebra
In this paper, we propose an elliptic algebra Aq,p;π̂(ŝl2) which is based on the relations RLL = LLR , where R and R are the dynamical R-maxtrices of A (1) 1 type face model with the elliptic moduli chosen differently.From the corresponding Ding-Frenkel correspondence , we show that the algebra Aq,p;π̂(ŝl2) at level one is the algebra of screening currents for q-deformed Virasoro algebra. The bos...
متن کاملApplication of the Bubble-Check algorithm to Non-Binary LLR computation in QAM coded schemes
متن کامل
LDPC Decoder LLR Stopping Criterion
The log-likelihood ratio test on a single check node within the LDPC decoder is monitored to develop a stopping criterion for the decoder that is better than previous stopping criteria, without sacrificing the BER performance. Simulation results are presented for the transmission of the rate 1 2 (288, 576) WiMAX 802.16e LDPC code digits using binary phase shift keying (BPSK) over an AWGN channel.
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012