Browsing by Author "Yanik, T"

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    A Survey of SIP Authentication and Key Agreement Schemes
    Kilinc, HH; Yanik, T
    We present a survey of authentication and key agreement schemes that are proposed for the SIP protocol. SIP has become the center piece for most VoIP architectures. Performance and security of the authentication and key agreement schemes are two critical factors that affect the VoIP applications with large number of users. Therefore, we have identified, categorized and evaluated various SIP authentication and key agreement protocols according to their performance and security features. Although the performance is inversely proportional to the security features provided in general, we observed that there are successful schemes from both the performance and security viewpoint.
  • No Thumbnail Available
    Item
    Efficient ID-based authentication and key agreement protocols for the session initiation protocol
    Kilinç, HH; Allaberdiyev, Y; Yanik, T; Erdem, SS
    In a widely deployed VoIP system tens of thousands of clients compete for the SIP proxy server's authentication service. SIP protocol implementations have to meet certain QoS and security requirements. In this study new ID-based protocols are proposed for the SIP authentication and key agreement protocols. These protocols minimize the use of expensive pairing functions but still resist notable attacks. The security of the proposed protocols are analyzed and demonstrated with security proofs based on the BJM security model. Finally, the performance overhead of the proposed protocols are compared to ID-based SIP authentication and key agreement protocols given in the literature.
  • No Thumbnail Available
    Item
    A General Digit-Serial Architecture for Montgomery Modular Multiplication
    Erdem, SS; Yanik, T; Çelebi, A
    The Montgomery algorithm is a fast modular multiplication method frequently used in cryptographic applications. This paper investigates the digit-serial implementations of the Montgomery algorithm for large integers. A detailed analysis is given and a tight upper bound is presented for the intermediate results obtained during the digit-serial computation. Based on this analysis, an efficient digit-serial Montgomery modular multiplier architecture using carry save adders is proposed and its complexity is presented. In this architecture, pipelined carry select adders are used to perform two final tasks: adding carry save vectors representing the modular product and subtracting the modulus from this addition, if further reduction is needed. The proposed architecture can be designed for any digit size delta and modulus theta. This paper also presents logic formulas for the bits of the precomputation -theta(-1) mod 2(delta) used in the Montgomery algorithm for delta <= 8. Finally, evaluation of the proposed architecture on Virtex 7 FPGAs is presented.