|
|
Featured White Papers
- Why choose an Open Source BPM?
- 10 FAQs on Business Process Management
- Best Practices for Getting Started with BPM
- Free Your Devs From The Pain Of Java Redeploys
- Increase Velocity 40% by Using JRebel
- What Developers Want: The End of Application Redeploys
- Developer Productivity Report: Java Tools, Tech, Devs, and Data
- Coding with JRebel: Java Forever Changed
- Utilizing Fast Testing to Transform Java Development
- Do You Really Get Classloaders?
- Pragmatic Continuous Delivery with Jenkins, Nexus, and LiveRebel
- Your Next Java Web App: Less XML, No Long Restarts, Fewer Hassles
- Coding with JRebel, Java Forever Changed
- 2012 Developer Productivity Report: Java Tools, Tech, Devs, and Data
Cool algorithm
Submitted by Johannes Brodwal on Tue, 04/07/2009 - 18:35.
Tags:
Back to:
www.javaworld.com/javaworld/jw-03-2009/jw-03-lamport-otp.html.
I found it a little hard to understand the underlying security aspects. Is the security of the algorithm based on the fact that the successor-function F is hard to reverse? So that if
A = F(B)
Then it's hard to reverse F? So that knowing A and F will not help you find B?
Secondly, is it correct that the algorithm is insufficient to establish trust? It merely verifying that a visitor is a returning user.
Finally: Is there a common way to handle it if the client runs out of keys?