This webspace is sponsered by . This site has been updated on 10/01/2007
1. What is TurboCrypt?
TurboCrypt is a new efficient and easy implementable public key algorithm
usable for both digital signature generation and public key encryption.
It is based - unlike most other public key algorithm - not on a number theoretical problem, but on very hard NP-complete lattice problems (namely the shortest and closest vector problem). Therefore, this scheme is a real alternative to RSA or Diffie-Hellman / El Gamal.
Furthermore, it's core function - an almost linear homomorphic one-way function - may be a cryptographical primitve function, that can be used for secure biometrical enhanced key generation, watermarking, ...
2. Where can I find a description of TurboCrypt?
You will find a complete description of the algorithm in this paper.
Please note, that I will soon publish a revised version of this paper, when enough comments and critics have arrived.
In some days I will publish a tutorial on TurboCrypt.
3. Shall I use TurboCrypt by now and what have I to consider?
No, TurboCrypt is a "brand-new" algorithm, which has been published to the
cryptographic community on 10/01/2007. If you would like to use this system,
wait at least one month until 11/01/2007.
Until then I will know more about the security or any flaws that might still exist in the first version.
Furthermore, you have to consider: This is a scientific publication.
Hence, you won't find any indication or statement in it about legal concerns
using cryptography or any new invention in your country. Check all your local
rights, before using scientific work in general or cryptographic work in this
particular case in any of your products.
The use of cryptographic algorithms may be prohibited or restricted in your country!
4. How can I contribute to this project / algorithm?
TurboCrypt is newly presented public key algorithm. Hence, there can be flaws or security holes I did not see. As a result, this public key scheme requires intensive public review.
You can therefore contribute to this project by reviewing the presented
algorithm. Just send me your constructive comments or critics to the
email address given below. If you found any possible
weakness or a way, to improve the algorithm, send me your results.
Your comments or critics will be published (with your name) on this site (except you do not agree with this, of course).
I am also interested in "coding help". I plan to program a cryptographic library using this new algorithm. I need some help to include a encrypted "virtual hard disc" for Micrsosoft Windows(TM) operating systems.
If you want to donate money on this project, just click here:
5. Is there a demonstration software?
A demonstration software (for VB and C++ each) will be published soon. Each library is also capable of all cryptographic standard functions like cryptographic Hash functions, symmetric encryption, ...
6. Was there already a presentation of this algorithm to the public?
The first version of the digital signature algorithm of this new public key scheme was at first successfully presented at Germany's biggest youth science fair "Jugend Forscht" in 2004. One year later I presented the signature algorithm to an international audience at the Intel ISEF (International Science and Engineering Fair) in Phoenix, Arizona.
I have further improved this algorithm and found a secure and efficient way to implement a public key encryption algorithm.
7. Can I expect some other security related publications on this site?
Yes. You will find here all comments and critics I receive for the new public
You will furhtermore find here new publications of me concerning other cryptographic techniques used in the demonstration software used here.
8. About the author and inventor of Turbo-Crypt
I'm Gerold Grünauer, a 20 year old german student and hobby cryptographer.
I'm studying "Technomathematik" (a mixture of engineering science, applied informatics and mathematics).
8 years ago, I've found my hobby: Cryptography and computer security.
I successfully presented a lot of my ideas concerning cryptographic protocolls, encryption algorithms and cryptanalysis at Germanys biggest youth science fair "Jugend Forscht".
At the moment I try to find a practical decentralized digital voting scheme.
You can contact me at: