Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,257,085 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Anonymous veto network
Decisional Diffie–Hellman assumption
Dining cryptographers problem
Password Authenticated Key Exchange by Juggling
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
A new quasi-optimal detection algorithm for a non orthogonal Spectrally Efficient FDM
Ioannis Kanaras
,
A. Chorti
,
M. Rodrigues
,
I. Darwazeh
9th International Symposium on Communications and…
2009
Corpus ID: 13164106
Non-orthogonal Spectrally Efficient Frequency Division Multiplexing (SEFDM) signals of a small dimensionality can be optimally…
Expand
Highly Cited
2008
Highly Cited
2008
The application of lattice-reduction to the K-Best algorithm for near-optimal MIMO detection
M. Shabany
,
P. Gulak
IEEE International Symposium on Circuits and…
2008
Corpus ID: 14152050
An efficient lattice-reduction (LR) aided implementation of the K-best algorithm is proposed for the general infinite lattice…
Expand
2008
2008
Traceable and Retrievable Identity-Based Encryption
M. Au
,
Qiong Huang
,
Joseph K. Liu
,
W. Susilo
,
D. Wong
,
Guomin Yang
International Conference on Applied Cryptography…
2008
Corpus ID: 15288440
Very recently, the concept ofTraceable Identity-based Encryption (IBE) scheme (or Accountable Authority Identity based Encryption…
Expand
2005
2005
A 53.3 Mb/s 4/spl times/4 16-QAM MIMO decoder in 0.35-/spl mu/m CMOS
Zhan Guo
,
P. Nilsson
IEEE International Symposium on Circuits and…
2005
Corpus ID: 1962554
An ASIC implementation of the K-best Schnorr-Euchner decoder is presented for a 4/spl times/4 16-QAM MIMO system. There are…
Expand
Highly Cited
2004
Highly Cited
2004
Reduced complexity Schnorr-Euchner decoding algorithms for MIMO systems
Zhan Guo
,
P. Nilsson
IEEE Communications Letters
2004
Corpus ID: 14069738
A new reduced-complexity Schnorr-Euchner decoding algorithm is proposed in this letter for uncoded multi-input multi-output…
Expand
2004
2004
VLSI implementation issues of lattice decoders for MIMO systems
Zhan Guo
,
P. Nilsson
IEEE International Symposium on Circuits and…
2004
Corpus ID: 7394666
Lattice decoders for MIMO systems, including the sphere decoder (SD) and the Schnorr-Euchner (SE) decoder, have been shown to…
Expand
2004
2004
Nouvelles Constructions algébriques de codes spatio-temporels atteignant le compromis "Multiplexga-Diversité"
Ghaya Rekaya Ben Othman
2004
Corpus ID: 169972304
Durant ces dernieres annees, un grand interet a ete accorde aux systemes a antennes multiples a cause de leur capacite a…
Expand
Highly Cited
2004
Highly Cited
2004
A VLSI architecture of the Schnorr-Euchner decoder for MIMO systems
Zhan Guo
,
Peter Nilsson
Proceedings of the IEEE 6th Circuits and Systems…
2004
Corpus ID: 7306613
The lattice decoder is shown to approach the performance of maximum-likelihood decoder for MIMO wireless systems with low…
Expand
2004
2004
Efficient authenticated encryption schemes with public verifiability
Guilin Wang
,
F. Bao
,
Changshe Ma
,
Kefei Chen
IEEE 60th Vehicular Technology Conference, . VTC…
2004
Corpus ID: 190376
An authenticated encryption scheme allows messages to be encrypted and authenticated simultaneously. C. Ma and K. Chen proposed…
Expand
1999
1999
Efficient Oblivious Proofs of Correct Exponentiation
M. Jakobsson
,
C. Schnorr
Communications and Multimedia Security
1999
Corpus ID: 36501696
We study the notion of meta-proofs, which, as the name indicates, are proofs about proofs. We employ the notion of meta-proofs to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE