This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in pu
Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography
โ Scribed by Delaram Kahrobaei, Vladimir Shpilrain
- Publisher
- Amer Mathematical Society
- Year
- 2015
- Tongue
- English
- Leaves
- 136
- Series
- Contemporary Mathematics 633
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Subjects
Business Writing;Skills;Business & Money;Mathematics;Applied;Geometry & Topology;History;Infinity;Mathematical Analysis;Matrices;Number Systems;Popular & Elementary;Pure Mathematics;Reference;Research;Study & Teaching;Transformations;Trigonometry;Science & Math;Business & Finance;Accounting;Banking;Business Communication;Business Development;Business Ethics;Business Law;Economics;Entrepreneurship;Finance;Human Resources;International Business;Investments & Securities;Management;Marketing;Real Es
๐ SIMILAR VOLUMES
<p><p>Chaos-based cryptography, attracting many researchers in the past decade, is a research field across two fields, i.e., chaos (nonlinear dynamic system) and cryptography (computer and data security). It Chaos' properties, such as randomness and ergodicity, have been proved to be suitable for de
Chaos-based cryptography, attracting many researchers in the past decade, is a research field across two fields, i.e., chaos (nonlinear dynamic system) and cryptography (computer and data security). It Chaos properties, such as randomness and ergodicity, have been proved to be suitable for designing