© 2016, Pleiades Publishing, Ltd.In this paper we show the use of commutative operads in public-key cryptography. Commutative operads were introduced by S.N. Tronin in 2006. They are a special case of algebraic operads and a natural generalization of commutative algebraic theories. We consider some cryptographic protocols based on commutative operads. For the protocol of the creation a common secret key, we describe and investigate its implementation and cryptographic security in particular cases
This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory...
We present the noncommutative version of the Polly Cracker cryptosystem, which is more promising tha...
Abstract The Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-...
© 2016, Pleiades Publishing, Ltd.In this paper we show the use of commutative operads in public-key ...
© 2016, Pleiades Publishing, Ltd.In this paper we discuss the possibility of using the categorical g...
International audienceCryptographic protocols are successfully analyzed using formal methods. Howeve...
Cryptographic protocols are successfully analyzed using formal methods. However, formal approaches u...
We show that varieties of algebras over abstract clones and over the corresponding operads are ratio...
International audienceWe introduce a functorial construction which, from a monoid, produces a set-op...
We generalize the construction of multitildes in the aim to provide multitilde operators for regular...
International audienceOperads are algebraic devices offering a formalization of the concept of opera...
Many formal techniques for the verification of cryptographic protocols rely on the abstract definiti...
Algebra is one of the important fields of mathematics. It concerns with the study and manipulation o...
About 20 years ago, Wagner showed that most of the (then) known techniques used in the cryptanalysis...
42 pages. Complete version of the extended abstracts arXiv:1208.0920 and arXiv:1208.0922Internationa...
This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory...
We present the noncommutative version of the Polly Cracker cryptosystem, which is more promising tha...
Abstract The Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-...
© 2016, Pleiades Publishing, Ltd.In this paper we show the use of commutative operads in public-key ...
© 2016, Pleiades Publishing, Ltd.In this paper we discuss the possibility of using the categorical g...
International audienceCryptographic protocols are successfully analyzed using formal methods. Howeve...
Cryptographic protocols are successfully analyzed using formal methods. However, formal approaches u...
We show that varieties of algebras over abstract clones and over the corresponding operads are ratio...
International audienceWe introduce a functorial construction which, from a monoid, produces a set-op...
We generalize the construction of multitildes in the aim to provide multitilde operators for regular...
International audienceOperads are algebraic devices offering a formalization of the concept of opera...
Many formal techniques for the verification of cryptographic protocols rely on the abstract definiti...
Algebra is one of the important fields of mathematics. It concerns with the study and manipulation o...
About 20 years ago, Wagner showed that most of the (then) known techniques used in the cryptanalysis...
42 pages. Complete version of the extended abstracts arXiv:1208.0920 and arXiv:1208.0922Internationa...
This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory...
We present the noncommutative version of the Polly Cracker cryptosystem, which is more promising tha...
Abstract The Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-...