摘要
晶格密碼學中有以Hoffstein等人於1996年所提出的NTRU公開金鑰密碼系統，在量子電腦運算能力逐漸進步的情況下，NTRU是近年來其中一個可以抵抗Shor演算法的公開金鑰密碼系統。 而Canetti等人於1997年所提出的「可否認加密」技術，其概念是當監聽者要求發送者傳給收件者的密文，被迫透露真實訊息的線索給監聽者知道時，「可否認加密」可以在密文中仿造出一個虛假訊息使監聽者相信，藉此保護真實訊息。 我們將Canetti等人於1997年提出「可否認加密」的加密方式與Hoffstein等人於1996年所提出的NTRU公開金鑰密碼系統做結合，這可以讓我們有能力創造出偽造的金鑰來欺騙監聽者，亦能在一般加密及可否認加密下皆可解出正確的訊息。
並列摘要
Among researches of lattice-based cryptography, Hoffstein et al. proposed the NTRU public key cryptosystem in 1996. As the computing power of quantum computers increase rapidly, NTRU is one of the public key cryptosystems that can resist Shor's algorithm in recent years. Deniable encryption is a concept proposed by Canetti et al. in 1997, that is when a listener asks the sender and the receiver of the ciphertext for some clue of the true message, deniable encryption will create a fake message in the ciphertext, and send to the listener. This allows the true message to be protected. We combine the encryption method of "deniable encryption" proposed by Canetti et al. in 1997 with the NTRU public key cryptographic system proposed by Hoffstein et al. in 1996. This allows us to create a forged key to deceive the listener, and the correct message can be solved under normal encryption and deniable encryption.
參考文獻
[1] Daniel J. Bernstein,Chitchanok Chuengsatiansup,Tanja Lange, NTRU Prime, IACR Cryptology ePrint
Archive, 2016:461,2016.
[2] Andrew Brockmann, A Plausibly Deniable Encryption Scheme forPersonal Data Storage, 2015.
[3] R. Canetti,U. Feige,O. Goldreich, M. Naor, Adaptively secure multi-party computation, In STOC, pages
639–648,1996