Loading...
Search for:
asymmetric-cryptography
0.006 seconds
A novel probabilistic key management algorithm for large-scale MANETs
, Article Proceedings - 27th International Conference on Advanced Information Networking and Applications Workshops ; 2013 , Pages 349-356 ; 9780769549521 (ISBN) ; Emamjomeh Zadeh, E ; Norouzi Fard, A ; Movaghar, A ; Sharif University of Technology
2013
Abstract
Mobile ad hoc networks (MANETs) have become very interesting during last years, but the security is the most important problem they suffer from. Asymmetric cryptography is a very useful solution to provide a secure environment in multihop networks where intermediate nodes are able to read, drop or change messages before resending them. However, storing all keys in every node by this approach is inefficient, if practically possible, in large-scale MANETs due to some limitations such as memory or process capability. In this paper, we propose a new probabilistic key management algorithm for large-scale MANETs. To the best of our knowledge, this is the first method which probabilistically uses...
Efficient Implementation of Elliptic Curve Scalar Multiplication without Division and Inversion Operations
, M.Sc. Thesis Sharif University of Technology ; Bayat-Sarmadi, Siavash (Supervisor)
Abstract
Elliptic curve cryptography (ECC) has received attention because it can achieve a security level similar to other asymmetric methods while using a key with smaller length. Although ECC is more efficient compared to other asymmetric methods, fast computation of ECC is always desirable. In this thesis,a fixed-base comb point multiplication method has been modified to perform regular point multiplication. Additionally, two low-complexity and lowlatency architectures for the modified point multiplication algorithm has been proposed. In order to achieve these architectures, a low-latency pipelined digit-level field multiplier for all national institute of standards and technology (NIST)...
High Speed Implementation of Finite Field Multiplier Suitable for Isogeny-Based Protocols
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Classic public key cryptographic systems are based on difficult mathematical problems that will lose their security with the advent of high-speed quantum computers. Isogeny-based cryptography is one of the five main methods in post-quantum cryptography, the hard problem of which is finding large-degree isogenies between elliptic curves. The most important advantage of isogeny-based protocols is the shorter public key length and the main problem is their low speed and low performance compared to other cryptographic systems. Due to the fact that these protocols are implemented on a finite field using basic operations, such as multiplication, squaring, addition, and subtraction, improving the...
Efficient Implementation of Elliptic Curve Cryptography on Curve-25519
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Elliptic curve cryptography (ECC) has received attention because it can achieve a security level similar to other asymmetric methods while using a key with smaller length. Although ECC is more efficient compared to other asymmetric methods, fast computation of ECC is always desirable. In this thesis, a fixed-base comb point multiplication method has been modified to perform regular point multiplication. Additionally, two low-complexity and lowlatency architectures for the modified point multiplication algorithm has been proposed. In order to achieve these architectures, a low-latency pipelined digit-level field multiplier for all national institute of standards and technology (NIST)...
Expert key selection impact on the MANETs' performance using probabilistic key management algorithm
, Article SIN 2013 - Proceedings of the 6th International Conference on Security of Information and Networks ; 2013 , Pages 347-351 ; 9781450324984 (ISBN) ; Minaei, M ; Golkari, M ; Movaghar, A ; Sharif University of Technology
2013
Abstract
Mobile ad hoc networks (MANETs) have been turned into very attractive area of research in the duration of recent years, whereas security is the most challenging point that they undergo. Cryptography is an essential solution for providing security within MANETs. However, storing all keys in every node, if practically possible, is inefficient in large scale MANETs due to some limitations such as memory or process capability. This paper extends our previous idea which was a novel probabilistic key management algorithm that stores only a few randomly chosen keys instead of all ones. In this paper, several different scenarios are proposed for key selection in which they are more practical, and...
A low-latency and low-complexity point-multiplication in ECC
, Article IEEE Transactions on Circuits and Systems I: Regular Papers ; Volume 65, Issue 9 , 2018 , Pages 2869-2877 ; 15498328 (ISSN) ; Bayat Sarmadi, S ; Mosanaei Boorani, H ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2018
Abstract
Elliptic curve cryptography (ECC) has received attention, because it can achieve the same security level as other asymmetric methods while using a key with smaller length. Although ECC is more efficient compared with other asymmetric methods, the fast computation of ECC is always desirable. In this paper, a fixed-base comb point multiplication method has been used to perform regular point multiplication. In addition, two low-complexity (LC) and low-latency (LL) architectures for the regular point multiplication using fixed-base comb method have been proposed. The point multiplication architectures have been implemented using field-programmable gate array and application-specific integrated...