scispace - formally typeset
Search or ask a question

Showing papers on "MDS matrix published in 2005"


Proceedings ArticleDOI
Qun Wan, Yong-Jie Luo, Wan-Lin Yang, Jia Xu1, Jun Tang1, Yingning Peng1 
18 Mar 2005
TL;DR: Because the dimension knowledge of the localization problem is utilized to estimate the noise subspace and to mitigate the errors in TOA measurements, the proposed method is superior to the ordinary linear localization method in most of the enhanced quadrants of the area coordinates system.
Abstract: A novel noise subspace based method is applied to the minimum localization system using time-of-arrival (TOA) measurements from three base stations (BS). Since the distance measurement between the mobile station (MS) and the BS bears analogy to the multidimensional similarity (MDS) between their coordinates, we express the MS coordinate as the linear combination of the BSs' coordinates, where the weight vector lies in the noise subspace of the MDS matrix. It is proved that this weight vector is the area coordinate of the MS when the triangle formed by the three BSs serves as the reference frame. Because the dimension knowledge of the localization problem is utilized to estimate the noise subspace and to mitigate the errors in TOA measurements, the proposed method is superior to the ordinary linear localization method in most of the enhanced quadrants of the area coordinates system.

28 citations


PatentDOI
30 Aug 2005
TL;DR: In this article, the authors proposed a high-security cryptographic processing apparatus that increases difficulty in analyzing the key of a common-key-block cipher and a method for finding the key.
Abstract: The invention realizes a high-security cryptographic processing apparatus that increases difficulty in analyzing its key and a method therefor. In Feistel-type common-key-block cryptographic processing that repeatedly executes an SPN-type F-f unction having the nonlinear conversion section and the linear conversion section over a plurality of rounds, Linear conversion processing of an F-function corresponding to each of the plurality of rounds is carried out by linear conversion processing that applies square MDS (Maximum Distance Separable) matrices. The invention uses a setting that arbitrary m column vectors included in inverse matrices of square MDS matrices being set up at least in consecutive even-numbered rounds and in consecutive odd-numbered rounds, respectively, constitute a square MDS matrix. This structure realizes cryptographic processing whereby resistance to linear cryptanalysis attacks in the common-key-block cipher is improved.

25 citations