Skip to search formSkip to main contentSkip to account menu

Schnorr group

A Schnorr group, proposed by Claus P. Schnorr, is a large prime-order subgroup of , the multiplicative group of integers modulo for some prime . To… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Non-orthogonal Spectrally Efficient Frequency Division Multiplexing (SEFDM) signals of a small dimensionality can be optimally… 
Highly Cited
2008
Highly Cited
2008
  • M. ShabanyP. Gulak
  • 2008
  • Corpus ID: 14152050
An efficient lattice-reduction (LR) aided implementation of the K-best algorithm is proposed for the general infinite lattice… 
2008
2008
Very recently, the concept ofTraceable Identity-based Encryption (IBE) scheme (or Accountable Authority Identity based Encryption… 
2005
2005
An ASIC implementation of the K-best Schnorr-Euchner decoder is presented for a 4/spl times/4 16-QAM MIMO system. There are… 
Highly Cited
2004
Highly Cited
2004
A new reduced-complexity Schnorr-Euchner decoding algorithm is proposed in this letter for uncoded multi-input multi-output… 
2004
2004
Lattice decoders for MIMO systems, including the sphere decoder (SD) and the Schnorr-Euchner (SE) decoder, have been shown to… 
2004
2004
Durant ces dernieres annees, un grand interet a ete accorde aux systemes a antennes multiples a cause de leur capacite a… 
Highly Cited
2004
Highly Cited
2004
The lattice decoder is shown to approach the performance of maximum-likelihood decoder for MIMO wireless systems with low… 
2004
2004
An authenticated encryption scheme allows messages to be encrypted and authenticated simultaneously. C. Ma and K. Chen proposed… 
1999
1999
We study the notion of meta-proofs, which, as the name indicates, are proofs about proofs. We employ the notion of meta-proofs to…