CAJ | 학술논문

基于格上SIS（the Small Integer Solutions problem）最小整数解问题提出了一个新的线性同态签名方案，该方案可以抵抗量子计算的攻击。与之前的线性同态签名方案相比较，摆脱了对同态哈希的依赖性，提高了计算效率，但安全级别仍然不变，并且证明了该方案满足正确性、不可伪造性和私有性。
기우격상SIS（the Small Integer Solutions problem）최소정수해문제제출료일개신적선성동태첨명방안，해방안가이저항양자계산적공격。여지전적선성동태첨명방안상비교，파탈료대동태합희적의뢰성，제고료계산효솔，단안전급별잉연불변，병차증명료해방안만족정학성、불가위조성화사유성。
A new linearly Homomorphic signature algorithm based on SIS(the Small Integer Solutions problem) difficulty problem on lattice is given in this paper. It can resist the quantum computing attack. Compared with the previous schemes,it gets rid of the dependence on homomorphic hash,and improves the computatinal efficiency. While the security level remains unchanged,and proved to be satisfied correction,unforgeability and privacy.