Results 1  10
of
683,017
LLL reducing with the most significant bits
"... Let B be a basis of a Euclidean lattice, and B ̃ an approximation thereof. We give a sufficient condition on the closeness between B ̃ and B so that an LLLreducing transformation U for B ̃ remains valid for B. Further, we analyse an efficient reduction algorithm when B is itself a small deformatio ..."
Abstract
 Add to MetaCart
deformation of an LLLreduced basis. Applications include speedingup reduction by keeping only the most significant bits of B, reducing a basis that is only approximately known, and efficiently batching LLL reductions for closely related inputs.
On the OBDD complexity of the most significant bit of integer multiplication
 In Proc. of 5th TAMC
"... Abstract. Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations. Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for boolean functions. Among the many areas of application a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
are verification, model checking, computeraided design, relational algebra, and symbolic graph algorithms. In this paper it is shown that the OBDD complexity of the most significant bit of integer multiplication is exponential answering an open question posed by Wegener (2000).
Security of the most significant bits of the Shamir message passing scheme
 MATH. COMP
, 2000
"... Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a “hidden ” element α of a finite field Fp of p elements from rather short strings of the most significant bits of the remainder modulo p of αt for several values of t selected uniformly at random from F ∗ p.Unfor ..."
Abstract

Cited by 20 (14 self)
 Add to MetaCart
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a “hidden ” element α of a finite field Fp of p elements from rather short strings of the most significant bits of the remainder modulo p of αt for several values of t selected uniformly at random from F ∗ p
On The Most Significant Bit w.r.t. Side Information
"... Given a single i.i.d. source ∼ ∏ , one can find efficient schemes to compress it. However, one may not always be interested in. One may instead be interested in a correlated sequence. For our setting, we simply ..."
Abstract
 Add to MetaCart
Given a single i.i.d. source ∼ ∏ , one can find efficient schemes to compress it. However, one may not always be interested in. One may instead be interested in a correlated sequence. For our setting, we simply
A New Image Steganography Method Based on Pixel Neighbors and 6 Most Significant Bit(MSB) Compare
"... Today, steganography is known as an effective way to convey secret data. A wide range of techniques has been developed in this context, each seeking to improve certain problems of their own. The current paper presents a method by which, when comparing three color values at each pixel to the correspo ..."
Abstract
 Add to MetaCart
to the corresponding ones from all its eight neighbors, it is attempted to embed message bits into the two least significant bits of a color component of an image that an acceptable color difference has happened in. Due to the mechanism proposed, this method makes the message difficult to be discovered. However, since
High confidence visual recognition of persons by a test of statistical independence
 IEEE Trans. on Pattern Analysis and Machine Intelligence
, 1993
"... Abstruct A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a samp ..."
Abstract

Cited by 596 (8 self)
 Add to MetaCart
, whose mostsignificant bits comprise a 256byte “iris code. ” Statistical decision theory generates identification decisions from ExclusiveOR comparisons of complete iris codes at the rate of 4000 per second, including calculation of decision confidence levels. The distributions observed empirically
On the Security of DiffieHellman Bits
, 2000
"... Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element α of a finite field IFp of p elements from rather short strings of the most significant bits of the remainder modulo p of ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element α of a finite field IFp of p elements from rather short strings of the most significant bits of the remainder modulo p of
Implicit Factoring with Shared Most Significant and Middle Bits
"... The corresponding paper version of this extended abstract is accepted for PKC2010 [3] The problem of factoring integers given additional information about their factors has been studied since 1985. In [6], Rivest and Shamir showed that N = pq of bitsize n and with balanced factors (log2(p) ≈ log2 ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(q) ≈ n 2) can be factored in polynomial time as soon as we have access to an oracle that returns the n 3 most significant bits (MSBs) of p. Beyond its theoretical interest, the motivation behind this is mostly of cryptographic nature. In fact, during an attack of an RSAencrypted exchange
A Reconfigurable Most/Least Significant Bit Multiplier for GF(2m)
"... An efficient architecture of a reconfigurable Least/Most Significant Bit multiplier for Galois field where, is presented. The proposed multiplier can operate either as a most significant or as a least significant bit first multiplier. The value m, of the irreducible polynomial degree, can be changed ..."
Abstract
 Add to MetaCart
An efficient architecture of a reconfigurable Least/Most Significant Bit multiplier for Galois field where, is presented. The proposed multiplier can operate either as a most significant or as a least significant bit first multiplier. The value m, of the irreducible polynomial degree, can
Gaussian interference channel capacity to within one bit
 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing
"... Abstract—The capacity of the twouser Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing o ..."
Abstract

Cited by 451 (28 self)
 Add to MetaCart
outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a very simple and explicit Han–Kobayashi type scheme can achieve to within a single bit per second per hertz (bit
Results 1  10
of
683,017