Abstract by anuja a sonalker on Asymmetric Key Distribution

Document Outline

• Anuja A Sonalker
• Asymmetric Key Distribution.
• ASYMMETRIC KEY DISTRIBUTION
  • North Carolina State University
• Dr. Gregory T. Byrd, Chair of Advisory Committee
• Dr. Peng Ning
• Dr. Ken Vu
  • • • BIOGRAPHY
• Chapter 1
  • Problem Definition
• Chapter 2
  • Introduction to Threshold Cryptography
    • • Fig 2.1: Shamir’s Secret Sharing
    • 2.8 Breaking the Algorithm
    • 2.8.1 Factoring N
      • Table 2.1: Factorization time by NFS
• Chapter 3
  • Asymmetric Key Distribution
    • • Fig 3.3: The Asymmetric Key Distribution algorithm
    • 3.4 Mathematical Analysis of the Asymmetric Key Distribution Algorithm
• 3.7 Secret share generation
  • • 3.8 Key Share Reuse
      • Fig 3.5: Typical Trusted Dealer table after Key generation
  • 3.10 Security Concerns
    • 3.10.1 Breaking the system
• Chapter 4
  • Implementation
  • 4.1 Communication Mechanisms in Java
    • 4.3 Implementation
  • All the share servers and the Special Server register themselves by binding with the registry. This way, any server can look up another server in the registry and set up communication with it.
    • • • 4.4.1.3 Signature Share generation time
• Chapter 5
  • Dual Threshold Approach
    • • Fig 5.2: Asymmetric Key Distribution Algorithm with Dual Threshold.
    • 5.3 Advantages
• Chapter 6
  • Conclusion