One nice number-theoretic approach to the problem of preventing someone (including the original sender) from decrypting a message before a certain amount of time elapses can be found in the paper: Time-lock puzzles and timed-release Crypto by Ronald L. Rivest, Adi Shamir, and David A. Wagner. which is avaialable from: http://theory.lcs.mit.edu/~rivest/publications.html The difficulty with this problem, in general, is that the notions of cpu time and real time don't often coincide. Hope this help, Zulfikar.
- time dependant Arrianto Mukti Wibowo
- Re: time dependant Eric Murray
- Re: time dependant Arnold G. Reinhold
- Re: time dependant Michael Paul Johnson
- Re: time dependant j
- time dependant Raph Levien
- Re: time dependant Steven M. Bellovin
- Re: time dependant Matt Crawford
- Re: time dependant Zulfikar A Ramzan
- Re: time dependant amir . herzberg
- Re: time dependant P.J. Ponder
- Re: time dependant Steven M. Bellovin
- Re: time dependant Arnold G. Reinhold
- Re: time dependant John Kelsey
- Re: time dependant Arnold G. Reinhold
- Re: time dependant John Kelsey
- Re: time dependant John Denker
- Re: time dependant Steven M. Bellovin