Lucas–Lehmer–Riesel test

Known as: Lucas-Lehmer-Riesel test, LLR, Lehmer 
In mathematics, the Lucas–Lehmer–Riesel test is a primality test for numbers of the form N = k ⋅ 2n − 1, with 2n > k. The test was developed by… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Following an idea of B. H. Gross, who presented an elliptic curve test for Mersenne primes Mp = 2 p − 1, we propose a similar… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper, we address the security of multimodal biometric systems when one of the modes is successfully spoofed. We propose… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In this paper, we evaluate the performance of several objective measures in terms of predicting the quality of noisy speech… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper introduces the related-key boomerang and the related-key rectangle attacks. These new attacks can expand the… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A computationally efficient space–time turbo equalization algorithm is derived for frequency-selective multiple-input–multiple… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
MOTIVATION Discovery of regulatory motifs in unaligned DNA sequences remains a fundamental problem in computational biology. Two… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on soft… (More)
  • figure 1
  • figure 2
  • table I
  • figure 6
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
27 '~,~mJ,Lhilj It. Ttwera~iIp. S., Aiuchi. T., Nakaka, K., ~dktlrllurJ, ¥, and kurih,llr,i. '~, )qqO) / Bk}L ('henl 265. 1577 
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?