Explore the vast range of titles available.

Hash functions are an essential mechanism in today’s world of information security. It is common practice to utilize them for storing and verifying passwords, developing pseudo-random sequences, and deriving keys for various applications, including military, online commerce, banking, healthcare management, and the Internet of Things (IoT). Among the cryptographic hash algorithms, the Keccak hash function (also known as SHA-3) stands out for its excellent hardware performance and resistance to current cryptanalysis approaches compared to algorithms such as SHA-1 and SHA-2. However, there is always a need for hardware enhancements to increase the throughput rate and decrease area consumption. This study specifically focuses on enhancing the throughput rate of the Keccak hash algorithm by presenting a novel architecture that supplies efficient outcomes. This novel architecture achieved impressive throughput rates on Field-Programmable Gate Array (FPGA) devices with the Virtex-5, Virtex-6, and Virtex-7 models. The highest throughput rates obtained were 26.151 Gbps, 33.084 Gbps, and 38.043 Gbps, respectively. Additionally, the research paper includes a comparative analysis of the proposed approach with recently published methods and shows a throughput rate above 11.37% Gbps in Virtex-5, 10.49% Gbps in Virtex-6 and 11.47% Gbps in Virtex-7. This comparison allows for a comprehensive evaluation of the novel architecture’s performance and effectiveness in relation to existing methodologies.

This volume contains the proceedings of the 15th International Conference on Arithmetic, Geometry, Cryptography, and Coding Theory (AGCT), held at the Centre International de Rencontres Mathematiques in Marseille, France, from May 18-22, 2015. Since the first meeting almost 30 years ago, the biennial AGCT meetings have been one of the main events bringing together researchers interested in explicit aspects of arithmetic geometry and applications to coding theory and cryptography. This volume contains original research articles reflecting recent developments in the field.

This volume contains the proceedings of the 10th International Congress on Finite Fields and their Applications (Fq 10), held July 11-15, 2011, in Ghent, Belgium. Research on finite fields and their practical applications continues to flourish. This volume's topics, which include finite geometry, finite semifields, bent functions, polynomial theory, designs, and function fields, show the variety of research in this area and prove the tremendous importance of finite field theory.

The second Women in Numbers workshop (WIN2) was held November 6-11, 2011, at the Banff International Research Station (BIRS) in Banff, Alberta, Canada. During the workshop, group leaders presented open problems in various areas of number theory, and working groups tackled those problems in collaborations begun at the workshop and continuing long after. This volume collects articles written by participants of WIN2. Survey papers written by project leaders are designed to introduce areas of active research in number theory to advanced graduate students and recent PhDs. Original research articles by the project groups detail their work on the open problems tackled during and after WIN2. Other articles in this volume contain new research on related topics by women number theorists. The articles collected here encompass a wide range of topics in number theory including Galois representations, the Tamagawa number conjecture, arithmetic intersection formulas, Mahler measures, Newton polygons, the Dwork family, elliptic curves, cryptography, and supercongruences. WIN2 and thisProceedingsvolume are part of the Women in Numbers network, aimed at increasing the visibility of women researchers' contributions to number theory and at increasing the participation of women mathematicians in number theory and related fields.

Quantum communication has made great breakthroughs in recent years. Because of its characteristics for strict information security transmission and high speed, it has received attention from related research fields around the world. This paper briefly reviews the progress in the field of quantum computing and communication. The basic functions of quantum mechanics related to the quantum communication are first introduced, including qubit, logic gates, postulates, polarization and quantum entanglement. Then the applications of quantum communication are discussed including teleportation, cryptography and quantum networks. Finally, advantages and disadvantages for the current applications are analyzed and the challenges remained in the current research are demonstrated.

Hybrid key encapsulation is in the process of becoming the de-facto standard for integration of post-quantum cryptography (PQC). Supporting two cryptographic primitives is a challenging task for constrained embedded systems. Both contemporary cryptography based on elliptic curves or RSA and PQC based on lattices require costly multiplications. Recent works have shown how to implement lattice-based cryptography on big-integer coprocessors. We propose a novel hardware design that natively supports the multiplication of polynomials and big integers, integrate it into a RISC-V core, and extend the RISC-V ISA accordingly. We provide an implementation of Saber and X25519 to demonstrate that both lattice- and elliptic-curve-based cryptography benefits from our extension. Our implementation requires only intermediate logic overhead, while significantly outperforming optimized ARM Cortex M4 implementations, other hardware/software codesigns, and designs that rely on contemporary accelerators.

Photonic quantum technology provides a viable route to quantum communication1,2, quantum simulation3 and quantum information processing4. Recent progress has seen the realization of boson sampling using 20 single photons3 and quantum key distribution over hundreds of kilometres2. Scaling the complexity requires architectures containing multiple photon sources, photon counters and a large number of indistinguishable single photons. Semiconductor quantum dots are bright and fast sources of coherent single photons5–9. For applications, a roadblock is the poor quantum coherence on interfering single photons created by independent quantum dots10,11. Here we demonstrate two-photon interference with near-unity visibility (93.0 ± 0.8)% using photons from two completely separate GaAs quantum dots. The experiment retains all the emission into the zero phonon line—only the weak phonon sideband is rejected; temporal post-selection is not employed. By exploiting quantum interference, we demonstrate a photonic controlled-not circuit and an entanglement with fidelity of (85.0 ± 1.0)% between photons of different origins. The two-photon interference visibility is high enough that the entanglement fidelity is well above the classical threshold. The high mutual coherence of the photons stems from high-quality materials, diode structure and relatively large quantum dot size. Our results establish a platform—GaAs quantum dots—for creating coherent single photons in a scalable way.Droplet GaAs quantum dots are interconnectable sources of single photons. Near-identical photons from remote GaAs quantum dots now show an interference visibility of 93% with quantum entanglement between the separate photon streams from the two sources.

Attacks on Internet of Things (IoT) devices are on the rise. Physical Unclonable Functions (PUFs) are proposed as a robust and lightweight solution to secure IoT devices. The main advantage of a PUF compared to the current classical cryptographic solutions is its compatibility with IoT devices with limited computational resources. In this paper, we investigate the maturity of this technology and the challenges toward PUF utilization in IoT that still need to be addressed.