Computer Science – Computational Complexity
Scientific paper
2008-01-31
Bulletin of the Lviv University, Series in Mechanics and Mathematics. Vol. 61, pp. 195--205 (2003)
Computer Science
Computational Complexity
12 pages
Scientific paper
We design a perfect zero-knowledge proof system for recognition if two
permutation groups are conjugate.
No associations
LandOfFree
Zero-Knowledge Proofs of the Conjugacy for Permutation Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Zero-Knowledge Proofs of the Conjugacy for Permutation Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zero-Knowledge Proofs of the Conjugacy for Permutation Groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-204740