✦ LIBER ✦

Combinatorial Group Theory and Public Key Cryptography

✍ Scribed by Vladimir Shpilrain; Gabriel Zapata

Publisher: Springer
Year: 2006
Tongue: English
Weight: 148 KB
Volume: 17
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-006-0006-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Public-key cryptography and invariant th

Public-key cryptography and invariant theory

✍ D. Grigoriev 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 152 KB

New public key cryptosystems from combin

New public key cryptosystems from combinatorial group theory

✍ Tang Xueming; Wang Xiaofei; Hong Fan; Cui Guohua 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 399 KB

The Conjugacy Search Problem in Public K

The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient

✍ Vladimir Shpilrain; Alexander Ushakov 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 93 KB

Information theory and public key crypto

Information theory and public key cryptosystems

✍ A.M. Gaglione 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Transitive Factorizations in the Symmetr

Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory

✍ Ian P. Goulden; David M. Jackson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 186 KB

We consider the determination of the number c k (α) of ordered factorizations of an arbitrary permutation on n symbols, with cycle distribution α, into k-cycles such that the factorizations have minimal length and the group generated by the factors acts transitively on the n symbols. The case k = 2

Combinatorial group theory: R. C. Lyndon

Combinatorial group theory: R. C. Lyndon and P. E. Schupp, Springer, 1977, 339 pp

✍ Gian-Carlo Rota 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 76 KB

It is becoming impossible any more to understand Wittgenstein without having read Malcolm. The urbane, courteous, limpid style gives an even, unexaggerated interpretation of the Master's words. One can even read this book for fun.