{'fraction_non_alphanumeric': 0.02046783625730994, 'fraction_numerical': 0.005847953216374269, 'mean_word_length': 5.041176470588235, '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 Minimal Euclidean Distance Searching Technique for Sudoku Steganography

Sudoku, a simple and fun game of logic, has been used for steganography to conceal messages into a digital image recently. Chang et al. adapted the idea of smallest Manhattan distance, embedding secret messages into the neighbors of the located element according to a given Sudoku solution. Hong et al. improved Chang et al.psilas technique by introducing additional set of candidate elements to reduce distortions. However, the aforementioned methods suffer from undesirable distortions because the Manhattan distance architectures are used in their method. The proposed method suggests a new scheme for searching embedding positions based on the nearest Euclidean distance, so that minimal distortions can be reached. The experimental results show that, in average, the visual quality of stego image is 1.70 dB higher than that of Chang et al.psilas method, and 0.72 dB higher than that of Hong et al.psilas method under the same embedding capacity.