Abstract
Given a global exponent for a black box group encrypting , where is an unknown finite field of unknown odd characteristic, we construct, in probabilistic time polynomial in , the isomorphisms where is a black box field encrypting . Our algorithm makes no reference to any additional oracles. We also give similar algorithms for black box groups encrypting , .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.