Sciweavers

290 search results - page 54 / 58
» Pseudorandom Bits for Polynomials
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Quantum interactive proofs with short messages
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and veriļ¬er. The ļ...
Salman Beigi, Peter W. Shor, John Watrous
PAIRING
2010
Springer
237views Cryptology» more  PAIRING 2010»
13 years 6 months ago
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barretoā€“Naehrig elliptic curve. Our library is able to compute the ...
Jean-Luc Beuchat, Jorge E. González-D&iacut...
TCOM
2010
116views more  TCOM 2010»
13 years 6 months ago
Optimal Routing for Decode-Forward in Cooperative Wireless Networks
Abstractā€”We investigate routing in cooperative multipleterminal wireless networks in which the nodes can collaborate with each other in data transmission. First, we motivate coop...
Lawrence Ong, Mehul Motani
ICASSP
2011
IEEE
13 years 4 days ago
Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent
This paper considers the problem of low complexity implementation of high-performance semideļ¬nite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
Hoi-To Wai, Wing-Kin Ma, Anthony Man-Cho So
PKC
2011
Springer
197views Cryptology» more  PKC 2011»
12 years 11 months ago
Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
We investigate the security of a generalization of HFE (multivariate and odd-characteristic variants). First, we propose an improved version of the basic Kipnis-Shamir key recovery...
Luk Bettale, Jean-Charles Faugère, Ludovic ...