Loading...
Search for:
bayat-sarmadi--m
0.246 seconds
Total 20563 records
High-throughput low-complexity systolic montgomery multiplication over GF(2m) Based on Trinomials
, Article IEEE Transactions on Circuits and Systems II: Express Briefs ; Volume 62, Issue 4 , January , 2015 , Pages 377-381 ; 15497747 (ISSN) ; Farmani, M ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2015
Abstract
Cryptographic computation exploits finite field arithmetic and, in particular, multiplication. Lightweight and fast implementations of such arithmetic are necessary for many sensitive applications. This brief proposed a low-complexity systolic Montgomery multiplication over GF(2m). Our complexity analysis shows that the area complexity of the proposed architecture is reduced compared with the previous work. This has also been confirmed through our application-specific integrated circuit area and time equivalent estimations and implementations. Hence, the proposed architecture appears to be very well suited for high-throughput low-complexity cryptographic applications
Secure two-party computation using an efficient garbled circuit by reducing data transfer
, Article 8th International Conference on Applications and Techniques in Information Security, ATIS 2017, 6 July 2017 through 7 July 2017 ; Volume 719 , 2017 , Pages 23-34 ; 18650929 (ISSN); 9789811054204 (ISBN) ; Farzam, M. H ; Bayat Sarmadi, S ; Sharif University of Technology
Springer Verlag
2017
Abstract
Secure computation has obtained significant attention in the literature recently. Classic architectures usually use either the Garbled Circuit (GC) or the Goldreich-Micali-Wigderson (GMW) protocols. So far, to reduce the complexity of communications in these protocols, various methods have been proposed. The best known work in both methods reduces the communication up to almost 2k-bits (k is the symmetric security parameter) for each AND gate, and using XOR gate is free. In this paper, by combining GC and GMW, we propose a scheme in the semi-honest adversary model. This scheme requires an Oblivious Transfer (OT) and a 2-bit data transfer for each AND gate, keeping XOR gates free. The...
Efficient and concurrent reliable realization of the secure cryptographic SHA-3 algorithm
, Article IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ; Vol. 33, issue. 7 , July , 2014 , p. 1105-1109 ; 0278-0070 ; Mozaffari-Kermani, M ; Reyhani-Masoleh, A ; Sharif University of Technology
2014
Abstract
The secure hash algorithm (SHA)-3 has been selected in 2012 and will be used to provide security to any application which requires hashing, pseudo-random number generation, and integrity checking. This algorithm has been selected based on various benchmarks such as security, performance, and complexity. In this paper, in order to provide reliable architectures for this algorithm, an efficient concurrent error detection scheme for the selected SHA-3 algorithm, i.e., Keccak, is proposed. To the best of our knowledge, effective countermeasures for potential reliability issues in the hardware implementations of this algorithm have not been presented to date. In proposing the error detection...
A Trusted Design Platform for Trojan Detection in FPGA Bitstreams Using Partial Reconfiguration
, M.Sc. Thesis Sharif University of Technology ; Bayat-Sarmadi, Siavash (Supervisor)
Abstract
Hardware Trojans have emerged as a major concern for integrated circuits in recent years. As a result, detecting Trojans has become an important issue in critical applications, such as finance and health. In this work, a trusted platform for detecting Trojans in FPGA bitstreams is presented. The proposed methodology takes advantage of increased Trojan activation, caused by transition aware partitioning of the circuit, while it benefits partial reconfiguration feature of FPGAs to reduce area overhead. Simulation results, performed for the transition probability thresholds of 〖10〗^(-4) and 〖2×10〗^(-5), show that this method increases the ratio of the number of transitions in the Trojan...
Performance Evaluation of Physical Unclonable Functions and Proposing a Scheme on FPGA
, M.Sc. Thesis Sharif University of Technology ; Bayat-Sarmadi, Siavash (Supervisor)
Abstract
In recent years, in addition to traditional cryptographic blocks, a hardware blocks in this work namely PUF, has been used mostly for chip ID generation, authentication and so on. In this work we study recent proposed PUFs and their implementations on FPGA, and the measurement of quality metrics on them. Some of most important characteristics of PUFs are unpredictability, reliability, number of challenge response pairs and area. According to experiments that have been performed in this study and also according to previous work, one high-quality PUF in term of uniqueness and reliability is Ring Oscillator PUF. However, the disadvantage of this PUF is small number of challenge and response...
Increasing BIOS Trust in Personal Computers Using Reconfigurable Devices
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Due to the expansion of digital system threats, trusted computation with a new approach for countering such threats has emerged. This approach is based on using a hardware module for implementing a trusted platform (TPM). TPM includes a chipset and the trusted systems core. Nowadays many of mobile computers do include this technology. This hardware creates trust using a trust chain and expanding this trust to other parts of the system. The starting point in this chain is the computer BIOS. BIOS is the first code that the system usually executes. One of the most powerful recent attacks on computer systems is to infect the BIOS and other firmware. One of such complicated attacks is the rootkit...
Efficient Implementation of Post-Quantum Cryptography Based on Learning with Errors
, Ph.D. Dissertation Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Public key encryption (PKE) cryptography plays a big role in securing communication channels of internet. The security of every PKE scheme is usually based on a hard problem that has no polynomial time solution using any computational structure. However, widely used classic PKE schemes such as RSA or ECC, are based on hard problems that have polynomial solutions using a quantum computer. Therefore, such PKE schemes will not be secure in post-quantum era. Among quantum-resistant schemes, lattice-based cryptography and especially learning with errors (LWE) problem have gained high attention due to their low computational complexity. In this thesis, different LWE-based cryptosystems are...
Implementation of an IoT Edge Computing Module in Compliance with TPM Standards
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Cloud computing has a significant role in expanding applications of the Internet of Things (IoT). Currently, applications such as virtual reality and augmented reality require low latency, which is not achievable using traditional cloud computing in some scenarios. Edge computing is a new approach in IoT, which solves some of the limitations of the cloud computing by extending and developing its operations. Reducing response time and network traffic are some of the most important achievements of edge computing. Despite of its numerous advantages over cloud computing, edge computing faces serious challenges such as virtualization, implementation infrastructure, resource allocation and task...
Improving Remote Attestation Techniques for IoT Devices using Physical Model
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Due to the widespread growth in the use of IoT devices, authors consider these devices as an attractive target platform. Several approaches have been proposed to defend IoT devices against various attacks. However, most of them suffer from some shortcomings such as being computationally expensive, not being general, or not being robust enough.Due to the attacks such as firmware modification and the existence of computational limitations, the use of local approaches is inefficient. Another approach is to use remote attestation techniques, which are divided into two categories, static and dynamic. However, static detection techniques are vulnerable to runtime attacks. Furthermore, existing...
Customizing a Privacy-Preserving Blockchain-Based Distributed Ledger for Second-Price Auction Smart Contract
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
A distributed ledger is a method of digital data storage and sharing in different places, and the blockchain technology is a way of implementing a distributed ledger. This technology has been employed in many of the cryptocurrencies like Ethereum to store transactions. In addition to storing transactions, Ethereum deploys scripts called smart contracts that are automatically executable. These scripts execute transparently and without preserving the privacy of participants. On the other hand, confidentiality and privacy are among the important components in data, network, and system security. Models such as Hawk and Enigma have been presented to obtain privacy-preserving in smart contracts;...
Network Traffic Reduction in Internet of Things Using Reconfigurable Cache based on Workload Characterization
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Nowadays, with the advancement of internet of things, The number of nodes within the network has increased and there is huge traffic in these networks despite the small volume of data sent and received each node. The current architecture of the Internet network does not have the functionality required for Internet of things, as a result of designing a new architecture for Internet - based Internet of things. Content - based network is a new architecture introduced to the Internet, and its purpose is to change the network from host-centric to content-centric. One of the features of content-based networks is the use of in network caching that helps increase productivity and reduce the traffic...
Implementation of Remote Attestation Mechanism on Internet of Things End-Nodes using TPM
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Today Internet of Things (IoT) applications are growing rapidly around us and alongside this trend, the topics of security and trust in this field are getting more serious. A big part of this field is composed of embedded systems. Remote attestation is a prominent security option in regards of attesting to the integrity of these type of systems and consequently establishing trust remotely. Remote attestation has been an active field of research to attest different type of systems against various types of threats. A noteworthy security hardware, enabling this type of process, is the Trusted Platform Module (TPM). Incorporating this chip in traditional personal computers for security purposes...
Low-Latency Cloud Gaming Using Task Offloading and Resource Allocation in Mobile Edge Networks
,
M.Sc. Thesis
Sharif University of Technology
;
Bayat Sarmadi, Siavash
(Supervisor)
Abstract
The video game industry has turned into one of the most remunerative entertainment industries amongst multimedia applications. The development of cloud-based services in recent years, has also turned cloud gaming in the form of ``gaming as a service'' into one of the most intriguing novel applications. In previous works, it has been shown that the employment of servers closer to the users in providing cloud gaming services could greatly enhance users' quality of experience, reduce network core congestion, and improve quality of service metrics. In this research, task offloading and resource allocation optimization for providing cloud gaming using edge computing has been investigated in newer...
Systolic gaussian normal basis multiplier architectures suitable for high-performance applications
, Article IEEE Transactions on Very Large Scale Integration (VLSI) Systems ; Volume 23, Issue 9 , 2015 , Pages 1969-1972 ; 10638210 (ISSN) ; Kermani, M. M ; Bayat Sarmadi, S ; Lee, C. Y ; Sharif University of Technology
2015
Abstract
Normal basis multiplication in finite fields is vastly utilized in different applications, including error control coding and the like due to its advantageous characteristics and the fact that squaring of elements can be obtained without hardware complexity. In this brief, we present decomposition algorithms to develop novel systolic structures for digit-level Gaussian normal basis multiplication over GF (2m). The proposed architectures are suitable for high-performance applications, which require fast computations in finite fields with high throughputs. We also present the results of our application-specific integrated circuit synthesis using a 65-nm standard-cell library to benchmark the...
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...
Enhancing A RISC-V Based Processor to Support Lattice-based Post-uantum Cryptography
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
The amount of data over networks are increasing rapidly, and accordingly, smart devices are being encountered severe challenges by the advancement of security threats. In order to create safe communications among smart devices, employing public-key cryptography is needed. But, public-key and classic cryptography, such as RSA, have high computation complexities and are not resistant to quantum attacks. Due to mentioned reasons, using these types of cryptography algorithms in internet-of-things (IoT) devices is unreasonable. In the past decade, lattice-based cryptography has been one of the pioneer post-quantum cryptography members, which benefits from comparatively lower computational...
GPU-based Acceleration of Isogeny-based Cryptography
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Post-quantum cryptography, as one of the newest groups of cryptographic algorithms, is thought to be secure against most sophisticated attacks by the groundbreaking quantum computers. Isogeny-based cryptography is an appealing contender among them due to its exceptional characteristics, especially the shortest public key in key encapsulation, encryption and decryption amid the other nominees of NIST post-quantum standard. However, its high computational complexity is a significant drawback. This research aims to increase the performance of isogeny-based cryptography in the most compute-intensive part, both in throughput and latency perspectives on GPUs and CPUs, which are the most widespread...
Implementing Spectre Attack based on RSB on ARM Architecture
, M.Sc. Thesis Sharif University of Technology ; Bayat Sarmadi, Siavash (Supervisor)
Abstract
Performance-enhancing mechanisms such as branch prediction, out-of-order execution, and cache hierarchy, have been wildly employed in today’s modern processing units. Although successful in increasing the CPU performance, exploiting the design flaws and security bugs in these components have set the background for various types of microarchitectural attacks. For instance, Spectre and Meltdown have made a serious impact on commercial processors such as ARM, Intel, and AMD. Given the exponential growth in number of smartphones and IoT devices, using ARM processors, as well as the high demand for Intel processors in Desktop PCs and servers, many researchers have tried to evaluate the security...
Efficient Implementation of Elliptic Curve Cryptography
, Ph.D. Dissertation Sharif University of Technology ; Bayat-Sarmadi, Siavash (Supervisor)
Abstract
Elliptic curve cryptography (ECC) has received attention because it can achieve the same security level as other classical asymmetric methods while using a key with smaller length. Although ECC is more efficient compared to AlGemal and RSA cryptosystems, fast computation of ECC is always desirable. Point multiplication is an essential operation in cryptographic computations. Low-latency and low-complexity multiplication architectures lead to more efficient cryptosystems.In this thesis, a fixed-base comb point multiplication method has been used to perform regular point multiplication. Additionally, two low-complexity (LC) and low-latency (LL) architectures for the regular point...
Dual-basis superserial multipliers for secure applications and lightweight cryptographic architectures
, Article IEEE Transactions on Circuits and Systems II: Express Briefs ; Vol. 61, Issue. 2 , February , 2014 , pp. 125-129 ; ISSN: 15497747 ; Mozaffari Kermani, M ; Azarderakhsh, R ; Lee, C. Y ; Sharif University of Technology
2014
Abstract
Cryptographic algorithms utilize finite-field arithmetic operations in their computations. Due to the constraints of the nodes which benefit from the security and privacy advantages of these algorithms in sensitive applications, these algorithms need to be lightweight. One of the well-known bases used in sensitive computations is dual basis (DB). In this brief, we present low-complexity superserial architectures for the DB multiplication over GF (2m). To the best of our knowledge, this is the first time that such a multiplier is proposed in the open literature. We have performed complexity analysis for the proposed lightweight architectures, and the results show that the hardware complexity...