random comments on computer security

Public Key / Private Key encryption systems are not provably secure. Given a public key and some newly-discovered vulnerability, a message might be decrypted. Perhaps the NSA already has the capability to decrypt 1024 RSA [Speculation here and here]. To make public key encryption more secure, keep the public key “semi-private”. Alice meets with Bob […]

A properly-implemented One Time Pad (OTP) encryption system is provably unbreakable. But OTP is not a popular system with many persons because of the problem of key distribution. You need one random bit of key for each bit of message. Over time, you might want to send many GB of message, and that would necessitate […]

Suppose that you want to hide messages in digital photos. You can change the least significant bits of the file, without changing the image much. The problem is that the changes in the file can be detected. The least significant bits are not random, but when they are changed to an encrypted message, those bits […]

I. Features: 1. Verification that each ballot was printed and issued by proper authority. 2. Exclusion of fake ballots. 3. Exclusion of multiple copies of any valid ballot. 4. Open verification system: verification database can be revealed publicly or shared with third party without compromising validation. 5. Hacker-resistant system: hackers who obtain verification database cannot […]

Two unrelated sets of Random Numbers (RN) are produced: A and B. Each RN in each set is tied to an exact day and time. The RNs are one-time-use only. The period of time when the RN is valid can be one minute or one hour or some other period. For this example, let’s suppose […]

Tag Cloud