Do you know how to tell a secret? And what does it have to do with Mathematics and Computer Science?
First of all: the need for secrecy is, indeed, so fundamental that we can safely say that it precedes Civilization, and even Humanity itself. Paleolithic hunters who would use sign language to communicate at distance without giving away their presence to their prays or predators can be said to use a form secret communication. However interesting, this example does not answer my previous questions.
From the the Greek words κρυπτός (kryptos) and γράφειν (graphein), meaning respectively ‘secret’ and ‘writing’, cryptography is any technique for discriminately hampering the interpretation of messages (not the access to them), aiming at impede the awareness of their meaning by third parties (or adversaries), however aware they might be of their content itself, while still allowing the intended recipient to construe the original meaning, by providing them with a specific instruction for it, the so called the ‘key’.
Having its first documented uses been done in the Ancient Egypt, back at least in the XIX century BC, cryptography has turned into one of the several anonymous technological heroes of our daily lives. From banking services to social networks to the military and intelligence any information system that deals with any minimally private or sensible information relies heavily on cryptography. From a more philosophical perspective, since privacy is to be considered a core component of individuality, to the point that it is held as the twelfth Human Right, cryptography is an indispensable component of modern world, for it allows an increasingly complex lifestyle to coexist with a healthy balance between individuality and collectivity.
SRVB cryptography are asymmetric cryptosystems by Daniel Santana Rocha and Yuri da Silva Villas Boas, that is based on the Knapsack problem. Contrary to RSA cryptosystem, SRVB is abundant on private keys, making it virtually costless, and contrary to the elliptic curves cyptosystem, it is completely open-source, and very easy to understand, use and implement (check out our project on GitHub and our paper).
SRVB cryptography is, thus, demonstrably simple and free, and, with your help, we may discover whether or not it is the first cryptosystem ever created to simultaneously be simple, free and reliable. By crowdfunding our campaign, you will:
- Contribute (80% of the donations) to offer a prize to whomever breaks an specified encrypted file, so that
- a) the absence of any winner provides a very strong evidence of the reliability of SRVB, in which case Daniel and Yuri will keep these 80%, or
- b) the eventuality of a successful attempt of breaking (in which case the person who breaks the encryption earns these 80% as a prize) would contribute to divulge and gather public interest to both theoretical and applicable knowledge within the mathematical fields of Algebra, Complexity, Cryptology;
- Directly reward SRVB‘s creators for their work (10% of the donations);
- Fund the advertisement of this whole campaign and media (the other 10%), thus potentiating the previous goals;
More details on the Contribute Page.
In the condition of mathematicians and programmers, if not at a top expert level, we do have an overall good command of information security technology at an operational and level. We want you to have it too, and this can become true through the vulgarization of the first Simple, Free and Reliable asymmetric cryptography ever created, ie the ultimate goal of this campaign.
Also, those who want to dig into the technical details can do so through our paper*, and in our mailing list. Enjoy!
We warmly thank you for your interest, attention, and trust!