Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Lecture Notes in Computer Science Unpaywall

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

Lecture Notes in Computer ScienceJan 1, 2003

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

Lecture Notes in Computer ScienceJan 1, 2003

Loading next page...
 
/lp/unpaywall/a-polynomial-time-algorithm-for-the-braid-diffie-hellman-conjugacy-13CSFyYrsm

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Unpaywall
ISSN
0302-9743
DOI
10.1007/978-3-540-45146-4_13
Publisher site
See Article on Publisher Site

Abstract

Journal

Lecture Notes in Computer ScienceUnpaywall

Published: Jan 1, 2003

There are no references for this article.