Heba Fadhil

Bio: Heba Fadhil is an academic researcher from University of Baghdad. The author has contributed to research in topics: Computer science & Cloud computing. The author has an hindex of 1, co-authored 6 publications receiving 21 citations.

Parallelizing RSA Algorithm on Multicore CPU and GPU

Abstract: Public key algorithms are extensively known to be slower than symmetric key alternatives in the a r e a of cryptographic algorithms for the reason of their basis in modular arithmetic. The most public key algorithm widely used is the RSA. Therefore, how to enhance the speed of RSA algorithm has been the research significant topic in the computer security as well as in computing fields. With remarkable increase in the computing capability of the modern Graphics Processing Unit's (GPUs) as a co-processor of the CPU, one can significantly benefit from the Single Instruction Multiple Thread (SIMT) style of computing. This paper proposes a hybrid system to parallelize the RSA for multicore CPU and many cores GPUs with variable key size. In doing so, three variants implementation for the RSA algorithm are done to facilitate the performance comparison against Crypto++ library and sequential counterpart. The GPU implementation gained approximately 23 speed up factor over the sequential CPU implementation; while the multithread CPU implementation gained only 6 speed up factor over the sequential CPU implementation as far as the latency is concerned. Furthermore, additional speedup could be gained as far as the throughput is concerned; the throughput gained for 1024 bits is ~1800 msg/sec; as for 2048 bits is ~250 msg/sec. Due to overlapping of multithread operation whenever free resources are available. The experiments are conducted on a laptop with Intel Core I7-2670QM, 2.20 GHz CPU and Nvidia GeForce GT630M GPU. Results reveal that the GPU is appropriate to speed up the RSA algorithm. General Terms Parallel Processing, Parallel Computing, RSA Algorithm, SIMT, Multithreading and Concurrent Computing, Heterogeneous computing.

The Perception of Information Security Threats Surrounding the Cloud Computing Environment

Abstract: a form for permitting services to user's everywhere is Cloud Computing; a suitable departure to the network is available upon request for a common set of constructive computing resources. These developments have created new security loopholes, including security issues that remain high full impressions. An up-and-coming area for study is the security of Cloud Computing, in particular for public clouds what can be provided from the infrastructure and computer resources owned by an outsourced party that provides individuals with services. One of the most complex problems in cloud computing is the security challenge. At first security challenges necessitate being addressed ahead of implementing Cloud Computing in an organization. This paper brings out a systematic literature evaluation by spotting the light on cloud computing security necessities; alongside with security issues, it is worth mentioning that solutions for the provision of information security in cloud computing has been discussed in this research.

Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm

Abstract: In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. This study presents a hybrid greedy hill climbing algorithm (HGHC) that ensures both effectiveness and near-optimal results for generating a small number of test data. To make certain that the suggested HGHC outperforms the most used techniques in terms of test size. It is compared to others in order to determine its effectiveness. In contrast to recent practices utilized for the production of covering arrays (CAs) and mixed covering arrays (MCAs), this hybrid strategy is superior since allowing it to provide the utmost outcome while reducing the size and limit the loss of unique pairings in the CA/MCA generation.

An open cloud-based platform for the creation and delivery of smart applications and services

Abstract: With the increasing integration of computers and smartphones into our daily lives, in addition to the numerous benefits it offers over traditional paper-based methods of conducting affairs, it has become necessary to incorporate one of the most essential facilities into this integration; namely: colleges. The traditional approach for conducting affairs in colleges is mostly paper-based, which only increases time and workload and is relatively decentralized. This project provides educational and management services for the university environment, targeting the staff, the student body, and the lecturers, on two of the most used platforms: smartphones and web applications. The services include project management, attendance marking, various notifications and alerts, files and resources, a grading system, and an assignment management system. This project also aims to ultimately digitalize most of the information inside the college. The web platform contains accounts for an admin; who is the person with the highest authority within the system, the head of the department, the department coordinator, the project coordinator, the lecturers, and the students. Each of those accounts has its privileges and the interaction between those accounts is managed via a backend system. The mobile platform targets the students exclusively and is linked with the web platform.

Evolutionary Perspective of Mobile Communication Technologies

Abstract: At the present time participants are looking for an appropriate package that includes all the advanced features because they have become recognizable with the evidence of mobile phone technology At present, it is developing very rapidly and addresses all mobile and wireless communications fields This makes the most important goal of cell phone giants to search for new and improved technology to outperform competitors The successive gesture of expansions in wireless mobile communications is mandatory to appreciate ubiquitous connectivity through massive volumes and diversity of data, through revenues of hastening accumulation, operate and utilization of information for separable social connections and sensing/control in cyber-physical systems This research covenants with the study and relative scrutiny of cellular wireless technologies which embraces first, second, third, fourth and fifth generations as they fall beneath the wireless cellular technologies? As well as, the prospects of future generations like the sixth and the seventh generations

Hiding Data Using Efficient Combination of RSA Cryptography, and Compression Steganography Techniques

Abstract: Data compression is an important part of information security because compressed data is more secure and easy to handle. Effective data compression technology creates efficient, secure, and easy-to-connect data. There are two types of compression algorithm techniques, lossy and lossless. These technologies can be used in any data format such as text, audio, video, or image file. The main objective of this study was to reduce the physical space on the various storage media and reduce the time of sending data over the Internet with a complete guarantee of encrypting this data and hiding it from intruders. Two techniques are implemented, with data loss (Lossy) and without data loss (Lossless). In the proposed paper a hybrid data compression algorithm increases the input data to be encrypted by RSA (Rivest–Shamir–Adleman) cryptography method to enhance the security level and it can be used in executing lossy and lossless compacting Steganography methods. This technique can be used to decrease the amount of every transmitted data aiding fast transmission while using slow internet or take a small space on different storage media. The plain text is compressed by the Huffman coding algorithm, and also the cover image is compressed by Discrete wavelet transform DWT based that compacts the cover image through lossy compression in order to reduce the cover image’s dimensions. The least significant bit LSB will then be used to implant the encrypted data in the compacted cover image. We evaluated that system on criteria such as percentage Savings percentage, Compression Time, Compression Ratio, Bits per pixel, Mean Squared Error, Peak Signal to Noise Ratio, Structural Similarity Index, and Compression Speed. This system shows a high-level performance and system methodology compared to other systems that use the same methodology.

Parallel processing and parallel algorithms: theory and computation

Abstract: This book covers the essential elements of parallel processing and parallel algorithms. It is unique in that it is a self-contained book. It covers everything fundamental to parallel processing from computer architecture to parallel programming and parallel algorithms. It is designed to function as a text for an undergraduate course in parallel processing, but also works well as a comprehensive reference for professionals interested in all phases of parallel processing and parallel programming.

Towards Information-Centric Networking (ICN) Naming for Internet of Things (IoT):The Case of Smart Campus

Abstract: Information-Centric Networking (ICN) specifically Name Data Networking (NDN) is the name-base (content-base) networking and takes named-contents as "first class citizen", being considered as the ideal candidate to form the Future Internet basis. NDN striking features like named-data self-secured contents, name-base-forwarding, in-network caching and mobility support suits the Internet of Things (IoT) environment, which aims to enable communication among smart devices and to combine all Internet-based smart applications under the one roof. With these aims, IoT put many research challenges regarding its network architecture as it should support heterogeneous devices and offer scalability. IoT may depend on the names and addresses of billions of the devices and should smartly manage the bulk of data produced every second. IoT application smart campus has gained a lot of attention in both industry and academia due to many reasons. Therefore, to design NDN for IoT, a sophisticated naming scheme is needed to explore and it is the main motivation for this work. In this paper, we study NDN-IoT smart campus (in terms of connected devices and contents) and find that it lacks in a reasonable naming and addressing mechanism; and thus we propose NDN based Hybrid Naming Scheme (NDN-HNS) for IoT based Smart Campus (IoTSC).

High Performance Post-Quantum Key Exchange on FPGAs

Abstract: Lattice-based cryptography is a highly potential candidate that protects against the threats of quantum attack. At Usenix Security 2016, Alkim, Ducas, Popplemann, and Schwabe proposed a post-quantum key exchange scheme called NewHope, based on a variant of lattice problem, the ring-learning-with-errors (RLWE) problem. In this work, we propose a high performance hardware architecture for NewHope. Our implementation requires 6,680 slices, 9,412 FFs, 18,756 LUTs, 8 DSPs and 14 BRAMs on Xilinx Zynq-7000 equipped with 28mm Artix-7 7020 FPGA. In our hardware design of NewHope key exchange, the three phases of key exchange costs 51.9, 78.6 and 21.1 μs, respectively. It achieves more than 4.8 times better in terms of area-time product compared to previous results of hardware implementation of NewHope-Simple from Oder and Guneysu at Latin-crypt 2017.

Implementation of RSA Signatures on GPU and CPU Architectures

Abstract: This paper reports a constant-time CPU and GPU software implementation of the RSA exponentiation by using algorithms that offer a first-line defense against timing and cache attacks. In the case of GPU platforms the modular arithmetic layer was implemented using the Residue Number System (RNS) representation. We also present a CPU implementation of an RNS-based arithmetic that takes advantage of the parallelism provided by the Advanced Vector Extensions 2 (AVX2) instructions. Moreover, we carefully analyze the performance of two popular RNS modular reduction algorithms when implemented on many- and multi-core platforms. In the case of CPU platforms we also report that a combination of the schoolbook and Karatsuba algorithms for integer multiplication along with Montgomery reduction, yields our fastest modular multiplication procedure. In comparison with previous literature, our software library achieves faster timings for the computation of the RSA exponentiation using 1024-, 2048- and 3072-bit private keys.