• 제목/요약/키워드: identity matrix

검색결과 110건 처리시간 0.027초

Identity Based Proxy Re-encryption Scheme under LWE

  • Yin, Wei;Wen, Qiaoyan;Li, Wenmin;Zhang, Hua;Jin, Zheng Ping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권12호
    • /
    • pp.6116-6132
    • /
    • 2017
  • The proxy re-encryption allows an intermediate proxy to convert a ciphertext for Alice into a ciphertext for Bob without seeing the original message and leaking out relevant information. Unlike many prior identity based proxy re-encryption schemes which are based on the number theoretic assumptions such as large integer factorization and discrete logarithm problem. In this paper, we first propose a novel identity based proxy re-encryption scheme which is based on the hardness of standard Learning With Error(LWE) problem and is CPA secure in the standard model. This scheme can be reduced to the worst-case lattice hard problem that is able to resist attacks from quantum algorithm. The key step in our construction is that the challenger how to answer the private query under a known trapdoor matrix. Our scheme enjoys properties of the non-interactivity, unidirectionality, anonymous and so on. In this paper, we utilize primitives include G-trapdoor for lattice and sample algorithms to realize simple and efficient re-encryption.

대역폭 제한 조건과 Gram 행렬의 단위행렬로의 사영을 이용한 압축센싱 능동소나 송신파형 설계 (Transmission waveform design for compressive sensing active sonar using the matrix projection from Gram matrix to identity matrix and a constraint for bandwidth)

  • 이세현;이근화;임준석;정명준
    • 한국음향학회지
    • /
    • 제38권5호
    • /
    • pp.522-533
    • /
    • 2019
  • 거리-도플러 추정을 위한 압축센싱(Compressive Sensing,CS) 모델은 과소결정계인 y = Ax 선형시스템으로 표현할 수 있다. 압축센싱 기법으로 위 선형시스템의 해를 찾으려면 행렬 A가 충분히 비간섭적이고 x가 희소해야 한다. 본 연구는 행렬 A가 비간섭적이도록 행렬 A의 상호간섭성을 낮추는 동시에 소나시스템에서 요구하는 대역폭을 유지하는 송신파형 설계 방법을 제안하였다. 제안한 방법은 행렬사영으로 센싱행렬을 최적화하는 방법과 DFT(Discrete Fourier Transform) 행렬을 이용하여 원하지 않은 주파수밴드를 억압하는 두 가지 방법을 결합한 것이다. 정합필터와 압축센싱 기법을 이용하여 기존파형 LFM(Linear Frequency Modulated)과 설계한 파형의 거리-도플러 추정 성능을 비교하였다. 시뮬레이션을 통해 설계한 송신파형이 기존파형(LFM)보다 탐지성능이 우수함을 보인다.

담수산 이매패류 패각내 유기각질 단백질 특성 (Characterization of the Organic Matrix Protein in the Freshwater Pelecypod Shells)

  • 박성빈;조동현
    • 한국패류학회지
    • /
    • 제3권1호
    • /
    • pp.3-14
    • /
    • 1987
  • The electrophoretic and innunological cnalyses of organic matrices in the shells of freshwater bivalves were made in order to dlucidate the biochemical characteristics and species-specific differinces of the applied shells, The water-soluble and insoluble matrices of four species of freshwater bivalves, Andodonta fukudai, Unio douglasiae, Lanceolaria and Chrbicula fluminea, were used as analytical materials, There was non-identity in immuno affinity between anti soluble matrix(anti-Sm) and anti insoluble matrix(anti-ISM)sera against the organic matrix of Andodnta fukudai. The SMs of four species (S. fukudai, U.douglasiae, L. acrorhyncha, and C. fluminea) showed the differences in the precipitate arcs at the level of family, though ISMs did mot show differences. In the electrophoretic analysis, all foru species had two SDS-electrophoretic bands of SM, of which molecular wights appeared to be lower than 55,000, shereas the native organic matrices of foru speceis had higher molecular weighrs than those from SDS-dldctrophoresis. Only calcium ion among many ions in extrapallial fluid(EPF) caused SM to change into insoluble molecules, thus the EPF pretreated with Ca++did not form the precipitate arc when did the immuno diffusion whth anti SM serum. ISM precursor may be polymerized into macromolecules like periostracin, a precusor of periostracum, judging from the similat polymerization patterns in 0.1M Tris formate buffer(pH 3); they may be made insoluble macromolecules due to their strong natrue of hydrophobicity.

  • PDF

Mallows의 $C_L$ 통계량을 이용한 수문응답 추정 (Hydrologic Response Estimation Using Mallows' $C_L$ Statistics)

  • 성기원;심명필
    • 한국수자원학회논문집
    • /
    • 제32권4호
    • /
    • pp.437-445
    • /
    • 1999
  • 비모수능형회귀분석법을 이용하여 수문응답을 추정하는 방안에 대하여 연구하였다. 응답을 추정하기 위하여 평균제곱예측오차에 대한 추정량인 CL 통계량을 최소화하는 방법을 적용하였으며 가중행렬은 전통적으로 이용도는 단위행렬과 특수한 형태인 행렬인 Laplacian 행렬을 각각 이용하여 비교하였다. 또한 추정응답의 오차분산을 추정하는 방안에 대한 검토도 실행하였다. 합성자료와 실제자료에 대한 분석 결과 가중행렬과 Laplacian 행렬을 오차분산은 편기 수정된 추정치를 이용하는 것이 좋은 결과를 보여 주었다. 본 연구에서 제시된 절차 및 방법은 수문응답 분리에 있어서 안정적이고 효율적으로 적용될 수 있을 것으로 판단된다.

  • PDF

시변 페이딩 환경에서 Lattice Reduction 기반 MIMO 수신기를 위한 계산량 감소 기법 (Complexity Reduction Scheme for Lattice Reduction-based MIMO Receiver under Time Varying Fading Environments)

  • 김한나;최권휴
    • 한국통신학회논문지
    • /
    • 제34권11A호
    • /
    • pp.852-861
    • /
    • 2009
  • 본 논문에서는 시변 페이딩 환경에서 기존의 Lattice Reduction(LR)기반 MIMO 수신기의 계산량을 효과적으로 감소시키는 새로운 기법을 제안한다. 시변 페이딩 채널 환경의 경우 매 프레임의 채널 행렬들이 시간 상관성에 의해 변화되므로, LR을 통해 얻어진 정수 행렬 P가 시간에 따라 크게 바리지 않는 성질을 발견하였다. 이러한 특성을 이용하여 연속된 채널에 대하여 LR을 독립적으로 수행하는 것이 아니라 직전 채널에서 구한 P를 초기조건으로 하여 LLL-LR 기법과 Seysen LR 기법을 수행한다. 실험결과에서는 제안된 기법이 기존 LR 기법과 같은 직교성 정도를 유지하면서 기존 LR 기법에 비해 계산량은 확연히 감소시켰음을 보인다.

THE GENERAL LINEAR GROUP OVER A RING

  • Han, Jun-Cheol
    • 대한수학회보
    • /
    • 제43권3호
    • /
    • pp.619-626
    • /
    • 2006
  • Let m be any positive integer, R be a ring with identity, $M_m(R)$ be the matrix ring of all m by m matrices eve. R and $G_m(R)$ be the multiplicative group of all n by n nonsingular matrices in $M_m(R)$. In this pape., the following are investigated: (1) for any pairwise coprime ideals ${I_1,\;I_2,\;...,\;I_n}$ in a ring R, $M_m(R/(I_1{\cap}I_2{\cap}...{\cap}I_n))$ is isomorphic to $M_m(R/I_1){\times}M_m(R/I_2){\times}...{\times}M_m(R/I_n);$ and $G_m(R/I_1){\cap}I_2{\cap}...{\cap}I_n))$ is isomorphic to $G_m(R/I_1){\times}G_m(R/I_2){\times}...{\times}G_m(R/I_n);$ (2) In particular, if R is a finite ring with identity, then the order of $G_m(R)$ can be computed.

USING AN ABSTRACTION OF AMINO ACID TYPES TO IMPROVE THE QUALITY OF STATISTICAL POTENTIALS FOR PROTEIN STRUCTURE PREDICTION

  • Lee, Jin-Woo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제15권3호
    • /
    • pp.191-199
    • /
    • 2011
  • In this paper, we adopt a position specific scoring matrix as an abstraction of amino acid type to derive two new statistical potentials for protein structure prediction, and investigated its effect on the quality of the potentials compared to that derived using residue specific amino acid identity. For stringent test of the potential quality, we carried out folding simulations of 91 residue A chain of protein 2gpi, and found unexpectedly that the abstract amino acid type improved the quality of the one-body type statistical potential, but not for the two-body type statistical potential which describes long range interactions. This observation could be effectively used when one develops more accurate potentials for structure prediction, which are usually involved in merging various one-body and many-body potentials.

f-CLEAN RINGS AND RINGS HAVING MANY FULL ELEMENTS

  • Li, Bingjun;Feng, Lianggui
    • 대한수학회지
    • /
    • 제47권2호
    • /
    • pp.247-261
    • /
    • 2010
  • An associative ring R with identity is called a clean ring if every element of R is the sum of a unit and an idempotent. In this paper, we introduce the concept of f-clean rings. We study various properties of f-clean rings. Let C = $\(\array{A\;V\\W\;B}\)$ be a Morita Context ring. We determine conditions under which the ring C is f-clean. Moreover, we introduce the concept of rings having many full elements. We investigate characterizations of this kind of rings and show that rings having many full elements are closed under matrix rings and Morita Context rings.

Extensions of Strongly α-semicommutative Rings

  • Ayoub, Elshokry;Ali, Eltiyeb;Liu, ZhongKui
    • Kyungpook Mathematical Journal
    • /
    • 제58권2호
    • /
    • pp.203-219
    • /
    • 2018
  • This paper is devoted to the study of strongly ${\alpha}-semicommutative$ rings, a generalization of strongly semicommutative and ${\alpha}-rigid$ rings. Although the n-by-n upper triangular matrix ring over any ring with identity is not strongly ${\bar{\alpha}}-semicommutative$ for $n{\geq}2$, we show that a special subring of the upper triangular matrix ring over a reduced ring is strongly ${\bar{\alpha}}-semicommutative$ under some additional conditions. Moreover, it is shown that if R is strongly ${\alpha}-semicommutative$ with ${\alpha}(1)=1$ and S is a domain, then the Dorroh extension D of R by S is strongly ${\bar{\alpha}}-semicommutative$.

THE REPRESENTATION AND PERTURBATION OF THE W-WEIGHTED DRAZIN INVERSE

  • Xu, Zhaoliang;Wang, Guorong
    • Journal of applied mathematics & informatics
    • /
    • 제23권1_2호
    • /
    • pp.113-126
    • /
    • 2007
  • Let A and E be $m{\times}n$ matrices and W an $n{\times}m$ matrix, and let $A_{d,w}$ denote the W-weighted Drazin inverse of A. In this paper, a new representation of the W-weighted Drazin inverse of A is given. Some new properties for the W-weighted Drazin inverse $A_{d,w}\;and\;B_{d,w}$ are investigated, where B=A+E. In addition, the Banach-type perturbation theorem for the W-weighted Drazin inverse of A and B are established, and the perturbation bounds for ${\parallel}B_{d,w}{\parallel}\;and\;{\parallel}B_{d,w}-A_{d,w}{\parallel}/{\parallel}A_{d,w}{\parallel}$ are also presented. When A and B are square matrices and W is identity matrix, some known results in the literature related to the Drazin inverse and the group inverse are directly reduced by the results in this paper as special cases.