{'fraction_non_alphanumeric': 0.0319634703196347, 'fraction_numerical': 0.0060882800608828, 'mean_word_length': 4.672413793103448, '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}}
An Application of XTR for the Discrete Logarithm Problem on Barreto -- Naehrig Curve

This paper considers the discrete logarithm problem (DLP) appeared in the context of pairing - based cryptography with Barreto - Naehrig (BN) curve. Since the embedding degree of BN curve is 12, the DLP is defined in the extension field Fp12, where p is the characteristic. This paper first points out that efficient and compact subgroup trace representation (ECSTR:XTR) is available for representing the DLP. Then, XTR-based rho method for solving the DLP is proposed. After that, its efficiency with and without tag tracing technique is evaluated by a small experiment.