Hyperencryption and Provably Everlasting Secrecy by Virtual Satellite

Modern encryption methods are based for their security on unproven assumptions such as the computational intractability of factorization of large integers. This has prompted research into alternatives such as quantum cryptography. We consider an encryption method employing an intensive public stream of random bits. The Sender and Receiver use a shared private key to extract from the stream one-time pads used to encrypt messages. We have shown, together with Y. Aumann and Y.Z. Ding, that this leads to provably unbreakable encryption and to everlasting secrecy. More recently we created the Virtual Satellite model, now being implemented at Harvard, which again provides provably unbreakable encryption. The talk will be self contained.