By Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov

Covering relatives among 3 assorted parts of arithmetic and theoretical computing device technological know-how, this booklet explores how non-commutative (infinite) teams, that are ordinarily studied in combinatorial team conception, can be utilized in public key cryptography.

Show description

Read or Download Group-based Cryptography (Advanced Courses in Mathematics - CRM Barcelona) PDF

Best Combinatorics books

Bent Functions: Results and Applications to Cryptography

Bent features: effects and purposes to Cryptography deals a special survey of the items of discrete arithmetic referred to as Boolean bent services. As those maximal, nonlinear Boolean services and their generalizations have many theoretical and useful purposes in combinatorics, coding concept, and cryptography, the textual content presents a close survey in their major effects, offering a scientific evaluate in their generalizations and purposes, and contemplating open difficulties in type and systematization of bent services.

A First Course in Combinatorial Mathematics (Oxford Applied Mathematics and Computing Science Series)

Now in a brand new moment version, this quantity offers a transparent and concise therapy of an more and more vital department of arithmetic. a distinct introductory survey whole with easy-to-understand examples and pattern difficulties, this article comprises details on such easy combinatorial instruments as recurrence kin, producing capabilities, prevalence matrices, and the non-exclusion precept.

Winning Solutions (Problem Books in Mathematics)

This ebook offers the mathematical instruments and problem-solving event had to effectively compete in high-level challenge fixing competitions. every one part offers vital historical past details after which offers a number of labored examples and routines to assist bridge the space among what the reader might already understand and what's required for high-level competitions.

Combinatorial Designs: A Tribute to Haim Hanani (Annals of Discrete Mathematics)

Haim Hanani pioneered the concepts for developing designs and the idea of pairwise balanced designs, major on to Wilson's life Theorem. He additionally led the best way within the examine of resolvable designs, masking and packing difficulties, latin squares, 3-designs and different combinatorial configurations.

Extra info for Group-based Cryptography (Advanced Courses in Mathematics - CRM Barcelona)

Show sample text content

Rated 4.41 of 5 – based on 25 votes