{'fraction_non_alphanumeric': 0.01732283464566929, 'fraction_numerical': 0.012598425196850394, 'mean_word_length': 4.781818181818182, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A New Approach for Matrix NTRU

Abstract This paper is an improvement to Luo and Lin (2011) of matrix NTRU that was published in International Journal of Computer Science and Network Security. After examination of their paper, our new approach offers an improvement to their method. The purpose of this paper is to firstly show that the sophisticated procedure of Luo and Lin is redundant and secondly to present our improvement. The same numerical example in Luo and Lin (2011) will be referred to, in order to clearly demonstrate our findings. Our new approach is aimed at helping cryptosystems develop NTRU in matrix representation.