Privus: Fully Encrypted Email, Chat and Texting made Simple
The first onetimepad encrypted email service that’s as easy to use as Gmail, and lets you keep your existing email address.
Privus: Fully Encrypted Email, Chat and Texting made Simple
The first onetimepad encrypted email service that’s as easy to use as Gmail, and lets you keep your existing email address.
Frequently Asked Questions

OneTime Pad (OTP) encryption is a symmetrical encryption method that was first attributed to Frank Miller in 1882. It was then redesigned and patented around 1917 – and since that time the protocol has never been cracked.
OTP is uncrackable because of four characteristics.
• An UltraSimple Encryption Algorithm
• Ephemeral Keys
• Extremely Long Key Lengths
• Random Key SegmentsAn UltraSimple Encryption Algorithm – The most commonly used encryption methods have complex mathematical algorithms based on discrete logarithmic functions. The problem is that these algorithms are so complex and require such precise inputs that “backdoors” be hidden within them.
The complexity of these algorithms does not make them stronger. In fact, the power of any encryption method has never been based on the algorithm. The strength of every reliable encryption method used in the last 4,000 years has always been in the cipherkey. (A cipherkey is essentially a long password that’s used as a mathematical value, which is applied to the algorithm.)
The math used in OTP encryption is a simple 2digit addition problem followed by an even simpler division problem. In fact, it’s so simple, it can be done by hand – as it was for over 70 years, throughout the Cold War. That simplicity means it’s impossible for an attacker to hide anything inside the algorithm.
This means the only way any wouldbe attackers can penetrate an OTPencrypted message is to reconstruct the original cipherkey.
Ephemeral (short life) Keys – The term “OneTime” comes from the fact that each cipherkey is only used once. One of the obvious benefits to this is that should a cipherkey that was used in one message be compromised, it cannot be used to decrypt any other messages.
But there’s another benefit as well.
One approach to cryptoanalysis (codebreaking) is to look for repeating patterns that might reveal sentence structure, word types or even specific phrases.
By changing the cipherkey each time you encrypt a message, there are no patterns to analyze. This means a codebreaker is forced to start from scratch with each message, because he has nothing to build upon from any previous messages.
Random Key Segments – By closing any potential “backdoor” access through the algorithm and by eliminating any chance of identifying repeating patterns from persistent cipherkeys, an attacker’s only remaining option is to try to “guess” a cipherkey through a trial and error search.
Statistically, the number one way codebreakers get past encryption is through weak cipherkeys.
Using any kind of “logic” to create a cipherkey makes it exponentially easier for an attacker to figure it out.
Using patterns or words in a key not only mathematically reduces the number of possible combinations, but those patterns or words are often related to you in some way such as birthdays, anniversaries, names, jobs, hobbies, etc.
This makes it much easier for an attacker to analyze all the possibilities within the time period that you want the message to remain secret.
The only reason we turn to patterns, words or other logicbased cipherkeys is so we can remember them. But with our “Privus CKey” functionality, you don’t need to remember anything.
We strictly adhere to the OTP protocol by always allowing you to easily (automatically) create and use cryptolevel random cipherkeys.
This further reduces an attacker’s options by forcing him to resort to a “bruteforce” attack. (A brute force attack is simply trying every possible combination of characters.) This increases the number of possible combinations for any given key length by orders of magnitude.
Extremely Long Key Lengths – It’s a mathematical reality that the longer the cipherkey is, the longer it will take to try all the possible combinations through a bruteforce attack.
There are 95 characters on the standard QWERTY keyboard. So…
If your key is 1 character long there are 95 possible combinations
If your key is 2 characters long there are 9,025 possible combinations
If your key is 3 characters long there are 857,375 possible combinations
If your key is 4 characters long there are 81,450,625 possible combinationsAs you can see, the numbers get really big, really fast.
A cipherkey that’s 2,000 characters long has 2.8003e+3955 possible combinations. (That’s a 2 followed by 3,955 digits.)
If you had seven quadrillion computers (that's over one million computers for every man, woman and child on the planet) that could generate a quadrillion keys each second, it would take over a quadrillion centuries to generate less than 1% of all the possible combinations.
Results of the Protocol – OTP encryption has been proven to be mathematically uncrackable. It earns this distinction because even if an attacker were to find some way to penetrate all four of the barriers outlined above, the outcome would be meaningless.
That’s because as we force an attacker into trying every possible cipherkey, our algorithm produces every possible output for a given message length.
For example, the following eight messages are all 24 characters long. Given a bruteforce attack, an attacker would generate all eight (and hundreds more) potential messages and not know which one was correct.
1. Meet me at the same place
2. Don’t go there ever again3. I’m still leaving at dawn
4. I am not going until 9:005. George will pay with cash
6. He’ll use my credit cards7. Enter my SSN: 222334444
8. Use Al’s SSN: 666778888
Finally, with Privus, all your cipherkeys are hidden from the internet. So there is no technological way for an attacker to get to them as long as your personal device (i.e., computer, tablet, phone, etc.) is not compromised.Last updated:
Don't see the answer to your question? Ask the project creator directly.
Ask a question