We initiate the formal treatment of cryptographic constructions (“Polly Cracker”) based on the
hardness of computing remainders modulo an ideal over multivariate polynomial rings. We …

The RSA cryptosystem has been a cornerstone of modern public key infrastructure;
however, recent advancements in quantum computing and theoretical mathematics pose …

We propose a new fully homomorphic cryptosystem called Symmetric Polly Cracker
(SymPC) and we prove its security in the information theoretical settings. Namely, we prove …

Development of prototype at data security through secret messages is needed for disguising
the messages sent in smartphone chatting application, WhatsApp (WA) Chat. We propose a …

We formally treat cryptographic constructions based on the hardness of deciding ideal
membership in multivariate polynomial rings. Of particular interest to us is a class of …

Abstract In 1994, Moss Sweedler's dog proposed a cryptosystem, known as Barkee's
Cryptosystem, and the related cryptanalysis. Its explicit aim was to dispel the proposal of …

Mientras el mundo está cada vez más conectado, con cada vez más datos migrándose a la
nube, cuestiones de seguridad todavía existen. Usuarios que eligen procesar datos en la …

When building cryptographic systems, one is constantly on the hunt for hard to solve
problems, but are all problems suitable? In this thesis we will take a look at Gröbner bases …

Algebra Computazionale B Page 1 Algebra Computazionale B basato sull’omonimo corso
tenuto dal prof. Carlo Traverso Anno Accademico 2012/13 - I semestre Oscar Papini Page 2 ii …

Název práce: Aplikace Gröbnerových bází v kryptografii Autor: Aleš Fuchs Katedra: Katedra
algebry Vedoucí diplomové práce: Mgr. Jan Št'ovíček Ph. D., Katedra algebry Abstrakt: V této …