Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,940,503 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.
2018
2018
A SECURE VARIANT OF SCHNORR SIGNATURE USING THE RSA ALGORITHM
Leila Zehhafi
,
O. Khadir
2018
Corpus ID: 203191379
In this paper we propose a topic on cryptography. It is a digital signature protocol. Indeed, we have improved the signature of…
Expand
2017
2017
On Instance Compression, Schnorr/Guillou-Quisquater, and the Security of Classic Protocols for Unique Witness Relations
Yi Deng
,
Xuyang Song
,
Jingyue Yu
,
Yu Chen
IACR Cryptology ePrint Archive
2017
Corpus ID: 26107736
We revisit the problem of whether the witness hiding property of classic 3-round public-coin proof systems for languages…
Expand
2016
2016
New Approaches for Secure Outsourcing Algorithm for Modular Exponentiations
Xi Jun Lin
,
Lin Sun
,
Haipeng Qu
,
Xiaoshuai Zhang
IACR Cryptology ePrint Archive
2016
Corpus ID: 441792
Outsourcing paradigm is one of the most attractive benefits of cloud computing, where computation workloads can be outsourced to…
Expand
2016
2016
Parallel Improved Schnorr-Euchner Enumeration SE++ for the CVP and SVP
Fábio Correia
,
Artur Mariano
,
A. Proença
,
Christian Bischof
,
Erik Agrell
International Euromicro Conference on Parallel…
2016
Corpus ID: 267787213
The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since…
Expand
2014
2014
Compute-and-forward protocol design based on improved sphere decoding
Jinming Wen
,
Baojian Zhou
,
W. Mow
,
X. Chang
IEEE International Conference on Communications…
2014
Corpus ID: 5977114
We consider the compute-and-forward protocol design problem with the objective being maximizing the computation rate at a single…
Expand
2008
2008
A Parallel LLL using POSIX Threads
W. Backes
,
S. Wetzel
2008
Corpus ID: 12143177
In this paper we introduce a new parallel variant of the LLL la ttice basis reduction algorithm. Lattice theory and in particular…
Expand
2007
2007
Two Counterfeiting Signature for Schnorr Signature Scheme and the Analysis of its Security
Deng Cong-zheng
2007
Corpus ID: 63665160
Schnorr signature system is uncertain.The parameters of the Schnorr signature system are randomly selected,moreover,the initial…
Expand
2004
2004
A fast recursive sphere decoder with linear storage
Weiyu Xu
,
Youzheng Wang
,
Anxin Li
,
Zucheng Zhou
,
Jing Wang
APCC/MDMC '04. The Joint Conference of the 10th…
2004
Corpus ID: 25754477
A novel fast recursive sphere decoder with competitive extension (CR-SD) is proposed for the exact maximum-likelihood (ML…
Expand
2004
2004
A flexible near-optimum detector for V-BLAST
Weiyu Xu
,
Youzheng Wang
,
Zucheng Zhou
,
Jing Wang
Proceedings of the IEEE 6th Circuits and Systems…
2004
Corpus ID: 25110945
V-BLAST is an important multiple input and multiple output (MIMO) space-time architecture for future high data rate wireless…
Expand
2002
2002
A new lattice decoding for space time block codes with low complexity
Lotfollah Beygi Harchegani
,
A. Ghaderipoor
,
K. Dolatyar
,
S. H. Jamali
IEEE International Symposium on Personal, Indoor…
2002
Corpus ID: 6508080
We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The…
Expand