𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the generalized MinRank problem

✍ Scribed by Faugère, Jean-Charles; Safey El Din, Mohab; Spaenlehauer, Pierre-Jean

Book ID
120475924
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
456 KB
Volume
55
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the generalized conjugacy
Complexity of the generalized conjugacy problem
✍ Sang Geun Hahn; Eonkyung Lee; Je Hong Park 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Recently, the generalized conjugacy problem(GCP) in braid groups was introduced as a candidate for cryptographic one-way function. A GCP in a braid group can be transformed into a GCP in a general linear group by the Burau representation. We study the latter problem induced in this way.

The complexity of the generalized Lloyd
The complexity of the generalized Lloyd - Max problem (Corresp.)
✍ Garey, M.; Johnson, D.; Witsenhausen, H. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 351 KB

However this method requires considering in turn each of the m ( 1 k possible choices of B. Thus when, e.g., one has II = m = 2 k, the effort required increases exponentially with k. A~wwr-A simple (combinatorial) special case of the generalized Lloyd-Max (or quantization) problem is shown to be non