In the past, ARM and Intel x86 computer processors were leaders in the different specialized areas with no competing interest. While Intel was building processors for the PCs and servers, ARM was concentrated on the handheld devices. Nowadays, with no hard limits in computing power between the different sizes of devices, ARM and Intel-based microprocessors are competitors. In this paper, a comparative study is done to evaluate the performance of the two microprocessors. Both, the in-order and the out-of-order, CPU models are used within each architecture, and four performance metrics (total consumed energy, throughput, average cycles per instruction (CPI), and L2 cache miss rate) are used to evaluate the work. The well-known computer architecture simulator, Gem5, is used to accomplish the work. Results show that ARM microprocessor outperforms x86 microprocessor in the most cases.

Peer-to-peer (P2P) content distribution and file sharing systems aim to facilitate the dissemination of large files over unreliable networks. Network coding is a transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems.

In peer-to-peer (P2P) content distribution systems, network coding is known as a helpful method for increasing the content availability, accelerating the download process, and robustness against churn. Originally, dense network coding (DNC) has been proposed and theoretically considered as an optimal solution. However, due to its huge computational overhead, it is not viable for real-world systems. Subsequently, sparse, generations, and overlapped generations network coding schemes are proposed as possible alternatives but at reduced performance compared to that provided by the DNC. Further in this article, an improved applicable network coding scheme for P2P content distribution systems referred to therein as Super Generation Network Coding (SGNC) is proposed. SGNC maximizes the generation size so that it is as close as possible to the optimal size without adding computational overhead. Theoretical analysis and experimental work show that SGNC outperforms classical and all previous coding based schemes for P2P content distribution systems in terms of content availability, download time, overhead, and decodability for all piece scheduling policies.

Crystals-Kyber and Classic-McEliece are two prominent post-quantum key encapsulation mechanisms (KEMs) designed to address the challenges posed by quantum computing to classical cryptographic schemes. While the former has been standardized by the National Institute of Standards and Technology (NIST), the latter is well-known for its exceptional robustness and as one of the finalists of the fourth round of post-quantum cryptography standardization. Private set intersection (PSI) is a privacy-preserving technique that enables two parties, each possessing a dataset, to compute the intersection of their sets without revealing anything else. This can be achieved thanks to homomorphic encryption (HE), which allows computations on encrypted data. In this paper, firstly, we study Kyber and McEliece, apart from being KEMs, as post-quantum public key encryption (PKE), and examine their homomorphic properties. Secondly, we design two different two-party PSI protocols that utilize the homomorphic capabilities of Kyber and McEliece. Thirdly, a practical performance evaluation under NIST’s security levels 1, 3, and 5 is conducted, focusing on three key metrics: storage overhead, communication overhead, and computation cost. Insights indicate that the Kyber-based PSI Protocol, which utilizes the multiplicative homomorphic property, is secure but less efficient. In contrast, the McEliece-based PSI protocol, while efficient in practice, raises concerns regarding its security as a homomorphic encryption scheme.

Peer-to-peer (P2P) content distribution or file sharing system aims to facilitate the dissemination of large files over unreliable networks. Network coding is a new transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems.