Abstract
By using the minimal polynomial of ergodic matrix and the property of polynomial over finite field, we present a polynomial time algorithm for the two-side exponentiation problem about ergodic matrices over finite field (TSEPEM), and analyze the time and space complexity of the algorithm. According to this algorithm, the public key scheme based on TSEPEM is not secure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
