China
Africa
Explore chapters and articles related to this topic
Cache and Memory
Published in Heqing Zhu, Data Plane Development Kit (DPDK), 2020
For Intel® Atom Processor (C3xxx) shown in (Figure 2.5), only L1 and L2 caches are existing. L2 cache is shared by the core pair, and the cache size is up to the different processors with 1 MB or 2 MB options being available. Hyper-threading is not supported. In the DPDK context, the physical threads are the same as the logical threads. Intel® Atom SoC is integrated with two DDR4 memory channels. The integrated Ethernet IP is based on 82599 and enabled by ixgbe PMD (poll mode driver) in DPDK. Roughly speaking, DPDK I/O workload running on atom core is about 50% performance of running a similar workload on Xeon/Xeon-D core. QAT, as crypto accelerator, can deliver up to 20 Gbps crypto/compression in this SoC; software library is supported by DPDK.
An FPGA-Based Advanced Lightweight Cryptography Architecture for IoT Security and Its Cryptanalysis
Published in Rohit Tanwar, Tanupriya Choudhury, Mazdak Zamani, Sunil Gupta, Information Security and Optimization, 2020
Rajdeep Chakraborty, Jyotsna Kumar Mandal
This proposed block cipher, RCC, is inspired by the NIST (McKay et al., 2017) report about lightweight cryptography published in 2017. In a cryptography project, Kerry A. McKay et al. proposed the working scope of NIST’s lightweight cryptography and security project including all cryptographic existing primitives and existing modes which are very much needed in constrained-resource environments. This report’s emphasis is on lightweight cryptography, lightweight crypto-hash, lightweight authentication and some protocols. The long-term effective security is very much needed. By using these algorithms, the aim should be implementation in post-quantum security, or these applications should allow all of them to be easily replaceable by those algorithms which are implemented and designed for post-quantum security.
The Flat Tire of Antivirus Technologies
Published in Rocky Dr. Termanini, The Nano Age of Digital Immunity Infrastructure Fundamentals and Applications, 2018
Take, for example, the Yahoo and Verizon merger. Yahoo’s stock plummeted Thursday as cybersecurity issues continued to rankle the company and reports surfaced that Verizon was looking to change the terms of—or possibly abort—its planned US$4.8 billion acquisition of the early Internet darling. Yahoo announced that a 2013 hack had compromised more than a billion user accounts. Names, email addresses, passwords, phone numbers, birthdays, and “in some cases, encrypted or unencrypted security questions and answers” were potentially accessed in the breach. It turned out that Yahoo uses what’s known as a Message Digest (MD5) algorithm to protect and store passwords. MD5 was the most vulnerable and broken crypto algorithm. Yahoo was using Bitdefender antivirus.
On-chain global maintenance services: technical, legal and managerial implications
Published in International Journal of Parallel, Emergent and Distributed Systems, 2023
Andrea Vitaletti, Maurizio Pizzonia, Marco Zecchini, Diego Pennino, Salvatore Esposito De Falco, Francesco Pacileo, Alessandro Bellini, Antonio Bonifacio, Domenico Sardanelli, Pietro Vito, Simone Naldini
The GSM requires the identification of the parts, both for the purpose of mapping the responsibilities (accountability) and for verifying the suitable professional skills of the Facility Manager and of the sub-suppliers/contractors. Nowadays, digital identity is usually guaranteed by trusted identity providers such as Facebook (Facebook Connect) and Google (Google Sign-In) which have control of the information associated with users identities. Self-sovereign identity (SSI) [32] is a new approach to digital identity that gives individuals control over the information they use to prove their identity instead of relying on trusted identity providers. In an SSI system, users generate and control unique identifiers called decentralized identifiers (DiD). Most SSI systems are decentralized and the credentials are managed using crypto wallets and verified using public-key cryptography anchored on a distributed ledger [33].
A robust image-based cryptology scheme based on cellular nonlinear network and local image descriptors
Published in International Journal of Parallel, Emergent and Distributed Systems, 2020
Mohammad Mahdi Dehshibi, Jamshid Shanbehzadeh, Mir Mohsen Pedram
Even though both cryptography and steganography provide security, using cryptography and steganography together is beneficial where they can add multiple layers to security. Concerning this hypothesis, some researchers concentrate their objective on proving its validity. Bloisi and Iocchi [31] presented a crypto-steganography system by using images as cover objects for steganography and as keys for cryptography. The strength of the proposed system was in the new concept of key image in which both cover and the key were considered as the cover image to change the cover coefficients randomly. This modification opposes for a steganalytic tool to search for a predictable set of modifications. Bansod et al. [32] suggested a hybrid crypto-steganography scheme in which Block Plane Coding Technique (BPCS) was used to hide more secret data with peak signal-to-noise ratio (PSNR) values of 43.2, 34.8, and 43.9 dB for Red, Green, and Blue channels, respectively. Bhattacharyya et al. [33] improved the robustness of secret data in the BPCS algorithm by investigating the role of Pixel Mapping. In [34] compressive sensing theory was used to propose a secure and high capacity crypto-steganography system which preserves the cover image imperceptibility. The discrete cosine transform and random sensing matrix were utilised as the sparse domain and measurement domain, respectively.
A robust, distributed, and privacy-preserving aggregation scheme for smart grid communications
Published in Journal of the Chinese Institute of Engineers, 2019
Gang Shen, Yixin Su, Danhong Zhang, Cheng Zhang, Mingwu Zhang
In this paper, we use a computer that has 3-GHz Pentium IV processor with 512 MB memory to calculate the operational costs. It supposed that , , , and denote the computational costs of an exponentiation operation in (), an exponentiation operation in , a multiplication operation in , and a pairing operation, respectively. Compared with above-mentioned operations, the multiplication operation in is negligible. In the light of MIRACL (Miracl crypto) and PBC (Lynn 2012), the calculation time of cryptography operations are as follows: , , , and .