Search

This article discusses the urgent need to develop post-quantum cryptography in order to protect data from being compromised by future quantum computers. Public-key cryptography, which is currently used to secure information, would become ineffective if a quantum computer were able to break it. The National Institute of Standards and Technology (NIST) has launched a contest to find alternative cryptographic algorithms that are resistant to quantum attacks, and 26 algorithms have been selected for further testing. Lattice-based cryptography has emerged as a promising approach, but NIST is exploring other options to avoid relying solely on one type of algorithm. The transition to post-quantum cryptography will require time and upgrades to computer systems and protocols. [Extracted from the article]

This article investigates uncloneable cryptography which is the application of the quantum mechanics no-cloning theorem to quantum cryptography. An in-depth examination of Stephen Wiesner’s private quantum money scheme leads to a discussion of verification keys and uncloneable signatures. Topics also include quantum copy-protection and uncloneable encryption.

The article compares the three widely used terms such as digital security, cybersecurity, and cryptography. Topics discussed include the important fields of study in cryptography, important classical encryption schemes, and fictional characters that are often used to illustrate various scenarios and algorithms.

The article discusses the challenges facing the quantum computing industry in transitioning to new post-quantum cryptography (PQC) standards which are under development by the U.S. National Institute of Standards and Technology (NIST) in collaboration with the cryptography research community. It questions whether this community has done enough to understand and enable frameworks for achieving cryptographic agility.

This article discusses the ethical implications of quantum computing, a transformative technology that has the potential to revolutionize industries such as cryptography and artificial intelligence. The attainment of quantum supremacy, where quantum computers outperform classical computers at specific tasks, raises concerns about power imbalances, security risks, economic disparity, and job displacement. To address these challenges, ethical frameworks must prioritize data privacy and security, responsible research and development, collaboration and global cooperation, and education and awareness. Balancing innovation with ethical considerations and establishing clear ethical guidelines are crucial for maintaining public trust and ensuring equitable distribution of the benefits of quantum computing. Governmental involvement in regulating quantum technology is also necessary to address national security, economic growth, and ethical considerations. International cooperation, finding the right balance between innovation and security, and promoting public awareness are key challenges and opportunities in the quantum age. [Extracted from the article]

Quantum networks are a new frontier in communication technology that leverage the principles of quantum mechanics to provide unprecedented levels of security and efficiency. Unlike classical networks, quantum networks use qubits, which can exist in multiple states simultaneously due to superposition and entanglement. Quantum networks offer superior security through quantum key distribution (QKD) and can transmit information more efficiently than classical networks. They have potential applications in cybersecurity, distributed quantum computation, healthcare, supply chain management, and more. However, building efficient and scalable quantum repeaters remains a challenge, and the practical implementation of quantum networks is still in the experimental phase. Despite these challenges, quantum networks have the potential to create significant economic value and are attracting significant investments. Organizations should prepare for the phased adoption of quantum technologies and stay abreast of government initiatives and collaborations with academic and research institutions. [Extracted from the article]

The article focuses on the U.N. declaring 2025 as the "International Year of Quantum Science and Technology" to celebrate a century of quantum mechanics and enhance public awareness of its significance. Topics include quantum computing's potential in healthcare and AI, the challenges and advancements in quantum cryptography and sensing applications, and the importance of photonics in developing quantum technologies.

China has become a frontrunner in the field of quantum technology, including quantum computing, quantum sensing, and quantum communications. This rapid development has been supported by significant public funding and high-level political attention. Chinese researchers have achieved scientific breakthroughs in quantum technology, and the country accounts for a large portion of global public investment in the field. While the United States still leads in terms of the number of quantum startups and investors, China's advancements in quantum technology, particularly in quantum cryptography, are notable. China's quantum sector is heavily influenced by state-level policies, which have increasingly emphasized the development and application of quantum technology. Understanding China's quantum technology policies is crucial in the context of international technological competition. [Extracted from the article]

The article explores the advancements and potential of quantum computing, highlighting its use cases in cryptography, optimization problems, and drug discovery/materials science. It also discusses the challenges and future outlook of quantum computing, along with various programming platforms available for developing quantum applications, such as IBM Quantum Computing Platform, Microsoft Quantum Development Kit.

Hannah Ritchie, a scientist and author, believes that sustainability is still achievable within our lifetime by focusing on data and evidence. In her book, she presents evidence that sustainable progress is possible through advancements in technology and understanding. Ritchie emphasizes the importance of accurate communication and reliable sources of data in addressing climate change and other global issues. The article also discusses the potential impact of quantum computing on the insurance industry, highlighting its ability to optimize portfolios, analyze datasets, enhance security, and improve data collection. While there are challenges to overcome, the field of quantum computing is expected to continue advancing with significant investments from governments and the private sector. [Extracted from the article]

Bernstein, who coined the term post-quantum cryptography in 2003 to refer to these kinds of algorithms, says the NSA is actively engaged in putting secret weaknesses into new encryption standards that will allow them to be more easily cracked with the right knowledge. Daniel Bernstein at the University of Illinois Chicago says that the US National Institute of Standards and Technology (NIST) is deliberately obscuring the level of involvement the US National Security Agency (NSA) has in developing new encryption standards for "post-quantum cryptography" (PQC). News Technology A PROMINENT cryptography expert has told New Scientist that a US spy agency could be weakening a new generation of algorithms designed to protect against hackers equipped with quantum computers. [Extracted from the article]

The New Scientist article provides information on various topics. It includes a virtual event featuring cosmologist Katherine Freese discussing dark matter, a tour of Tasmania's flora, fauna, and geology, a podcast previewing trends and innovations for 2024, a video interview with conservationist Jane Goodall on climate change, a newsletter discussing lunar missions, and an essential guide on understanding the mind. The article aims to inform readers about these diverse subjects and provide resources for further exploration. [Extracted from the article]

The authors discuss the use of quantum technology in the field of cyber security. They mention the current state of quantum computing including various myths, how it can be used in cryptographic attacks and how to protect against such attacks, and the need to protect quantum computers.

Quantum cryptography promises levels of security that are impossible to attain in a classical world. Can this security be guaranteed to classical users of a quantum protocol, who may not even trust the quantum devices used to implement the protocol? This central question dates back to the early 1990s when the challenge of achieving Device-Independent Quantum Key Distribution (DIQKD) was first formulated. We answer the challenge by rigorously proving the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution. The proof of security builds on techniques from the classical theory of pseudo-randomness to achieve a new quantitative understanding of the non-local nature of quantum correlations. [ABSTRACT FROM AUTHOR]

Gmail users get two security boosts There's a reason why Google's Gmail service has 1.8 billion users, and that's the combination of interface and ubiquity. Real World Computing Be it a privacy issue or yet another zero-day vulnerability in the Chrome browser, more often than not I'm pulling my (imaginary) hair out while writing about Google. When you're signed into your Google account using Gmail, Google will "temporarily associate" information collected during enhanced safe browsing sessions to help protect across Google apps. [Extracted from the article]

Copyright of IT-Governance is the property of dpunkt.verlag GmbH and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the late 1960s, a young physicist was sailing along the coast of California towards Berkeley, where he got a post-doc position in astronomy. But his real goal was not astronomy, at least not immediately. First, John Clauser eagerly wanted to test some predictions of quantum theory that were at odds with a then recent and mostly ignored result by an Irish physicist John Stewart Bell, working at the celebrated CERN near Geneva. [ABSTRACT FROM AUTHOR]

The article focuses on several terms such as post-quantum cryptography, passkeys, and regasification. Topics discussed include weirdness of subatomic realm exploited by quantum computers to do things not done by computers, passkeys supported by technology companies such as Apple and Microsoft, and global trade in natural gas for European countries to reduce reliance on Russian gas delivered by pipelines.

MIT researchers have developed a security protocol that uses quantum properties of light to ensure the security of data during cloud-based deep-learning computations. This protocol encodes data into laser light, making it impossible for attackers to copy or intercept the information without detection. The technique maintains 96 percent accuracy while providing robust security measures. The researchers believe this protocol could be applied to federated learning and quantum operations in the future. [Extracted from the article]

This paper is dedicated to researching the problem of the state estimation for two-time-scale complex networks (TTSCNs) subject to sojourn probabilities (SPs) under channel fadings and false data injection attacks (FDIAs). The network's switching topology is governed by a novel switching law that incorporates time-varying SPs, with the variation of SPs being regulated through a persistent dwell-time (PDT) switching signal. Meanwhile, for the sake of achieving energy savings and mitigating data congestion, the dynamic probabilistic event-triggered weighted try-once-discard (DPEWTOD) policy is innovatively developed by integrating with the major merits of the dynamic probabilistic event-triggered mechanism (DPETM) and WTOD protocol (WTODP) based on hybrid compensation. Different from the traditional communication rules, this DPEWTOD concept not only captures stochastic behavior of the dynamic triggering threshold (DTT), but also enables a compensatory measurement that closely approximates the actual value. Subsequently, we construct time delay-, DTT-, and PDT-dependent Lyapunov functionals to analyze the stability of error dynamic systems in the presence of fading and malicious FDIAs. By employing a separation technique, our proposed solving algorithm transforms non-convex analysis conditions into tractable ones. Eventually, the rationality and effectiveness of the proposed method are demonstrated by an resistance–capacitance (RC) circuit example. • As a first attempt, the nonhomogeneous SPs are governed by a high-level deterministic switching signal using PDT policy and polytope structure set. • A novel DPEWTOD protocol is introduced by absorbing the DPETM and WTODP with hybrid compensation into design. • Taking the channel fadings and FDIAs into account, the sufficient conditions are obtained that the error dynamics are said to achieve H ∞ performance. [ABSTRACT FROM AUTHOR]

• Novel quantum blockchain with proprietary data structure and its implementation. • The block hash value stored as one qubit with parallel computing capability. • Quantum electronic medical records guarantee data security and privacy by resisting quantum attacks. There is a rising need for healthcare as a result of rising public awareness of health issues. Electronic medical records include extremely confidential and sensitive information, and blockchain technology can enable the safe exchange of these records across various medical organizations. The current blockchain system is susceptible to quantum computer attacks, nevertheless, as a result of the advent of quantum computers. This research designs a novel distributed quantum electronic medical record system and suggests a new private quantum blockchain network based on security considerations. The blocks in this quantum blockchain's data structure are linked via entangled states. The time stamp is automatically formed by connecting quantum blocks with controlled activities, which lowers the amount of storage space needed. Each block's hash value is recorded using just one qubit. The quantum information processing is detailed in depth in the quantum electronic medical record protocol. Every medical record can be tracked, and the security and privacy of electronic medical records in Internet of Medical Things systems can be guaranteed. The protocol also ditches the traditional encryption and digital signature algorithms in favor of a quantum authentication system. According to the mathematical analysis, the quantum blockchain network has strong security against attacks from quantum computers since it can withstand External attack, Intercept-Measure-Repeat attack and Entanglement-Measure attack. The quantum circuit diagram for deriving the hash value is provided, along with the correctness and traceability analysis of the quantum block. The comparison between the proposed quantum blockchain model and a few other quantum blockchain models is also included. [ABSTRACT FROM AUTHOR]

Modern NVIDIA GPU architectures offer dot-product instructions (DP2A and DP4A), with the aim of accelerating machine learning and scientific computing applications. These dot-product instructions allow the computation of multiply-and-add instructions in a single clock cycle, effectively achieving higher throughput compared to conventional 32-bit integer units. In this paper, we show that the dot-product instruction can also be used to accelerate matrix-multiplication and polynomial convolution operations, which are widely used in post-quantum lattice-based cryptographic schemes. In particular, we propose a highly optimized implementation of FrodoKEM wherein the matrix-multiplication is accelerated by the dot-product instruction. We also present specially designed data structures that allow an efficient implementation of Saber key-encapsulation mechanism, utilizing the dot-product instruction to speed-up the polynomial convolution. The proposed FrodoKEM implementation achieves $4.37\times $ higher throughput than the state-of-the-art implementation on a V100 GPU. This paper also presents the first implementation of Saber on GPU platforms, achieving 124,418, 120,463, and 31,658 key exchanges per second on RTX3080, V100, and T4 GPUs, respectively. Since matrix-multiplication and polynomial convolution operations are the most time-consuming operations in lattice-based cryptographic schemes, we strongly believe that the proposed methods can be beneficial to other KEM and signatures schemes based on lattices. [ABSTRACT FROM AUTHOR]

Shor’s quantum algorithm and other efficient quantum algorithms can break many public-key cryptographic schemes in polynomial time on a quantum computer. In response, researchers proposed postquantum cryptography to resist quantum computers. The multivariate cryptosystem (MVC) is one of a few options of postquantum cryptography. It is based on the NP-hardness of the computational problem to solve nonlinear equations over a finite field. Recently, Wang et al. (2018) proposed a MVC based on extended clipped hopfield neural networks (eCHNN). Its main security assumption is backed by the discrete logarithm (DL) problem over Matrics. In this brief, we present quantum cryptanalysis of Wang et al. ’s eCHNN-based MVC. We first show that Shor’s quantum algorithm can be modified to solve the DL problem over Matrics. Then we show that Wang et al. ’s construction of eCHNN-based MVC is not secure against quantum computers; this against the original intention of that multivariate cryptography is one of a few options of postquantum cryptography. [ABSTRACT FROM AUTHOR]

Ring learning-with-errors (RLWE)-based encryption scheme is a lattice-based cryptographic algorithm that constitutes one of the most promising candidates for Post-Quantum Cryptography (PQC) standardization due to its efficient implementation and low computational complexity. Binary Ring-LWE (BRLWE) is a new optimized variant of RLWE, which achieves smaller computational complexity and higher efficient hardware implementations. In this paper, two efficient architectures based on Linear-Feedback Shift Register (LFSR) for the arithmetic used in Inverted Binary Ring-LWE (InvBRLWE)-based encryption scheme are presented, namely the operation of $A\cdot B+C$ over the polynomial ring $\mathbb {Z}_{q}/(x^{n}+1)$. The first architecture optimizes the resource usage for major computation and has a novel input processing setup to speed up the overall processing latency with minimized input loading cycles. The second architecture deploys an innovative serial-in serial-out processing format to reduce the involved area usage further yet maintains a regular input loading time-complexity. Experimental results show that the architectures presented here improve the complexities obtained by competing schemes found in the literature, e.g., involving 71.23% less area-delay product than recent designs. Both architectures are highly efficient in terms of area-time complexities and can be extended for deploying in different lightweight application environments. [ABSTRACT FROM AUTHOR]

The environment in which the development of the candidate algorithms submitted to the NIST post-quantum standardization process in late 2017 occurred was substantially different than that of the standard, pre-quantum algorithms, such as RSA in the 1970s. Once such a channel is established between two parties, further communication over the channel typically proceeds using a highly efficient private-key encryption algorithm, such as the Advanced Encryption Standard (AES) block cipher. To facilitate this transition, the U.S. National Institute of Standards and Technology (NIST) initiated a worldwide process in late 2017 to solicit, evaluate, and standardize one or more quantum-resistant public-key cryptographic algorithms. The crucial questions here involve the suitability of the new cryptographic candidates for use in real-world applications, based on the running time of their key generation algorithm, their encryption and decryption algorithms, or their signing and signature verification algorithms. [Extracted from the article]

Those products should have the ability to support quantum-resistant encryption algorithms and the ability to double the key size for their symmetric algorithms. Shor's Algorithm In 1994 Peter Shor developed an algorithm that would quickly determine the prime numbers that went into the large product used to create public and private keys. The NIST Competition Yet again NIST is conducting an open competition to select one or more quantum-resistant encryption algorithms as a national standard. Attorneys with clients who produce products containing encryption algorithms should advise them that if they do not support cryptographic agility, they could be found negligent for not being able to resist attacks using quantum computing in the future. [Extracted from the article]

Quantum computers use bits of data called qubits. PHOTO (COLOR): A quantum computer researcher in northwestern Germany dresses warmly for work, as today's quantum computers must be kept cool. It is possible to encode information into qubits in such a way that this information can be deleted or removed by measuring these qubits. [Extracted from the article]

The article discusses two summer 2017 projects in China which demonstrated the potential use of global quantum key distribution (QKD) networks to overcome the challenge of transmitting private encryption key securely to another user without the risk of it being intercepted.

TECHNOTES Technology won't save us from climate change, but it could help - and if quantum computing would hurry up, the leap forward in processing power could help expand our understanding of our changing world, reveal how to reduce the impact of carbon emissions and spark innovations that make a real-world difference. Quantum technology Mohr notes that the field really should be referred to as quantum technology, as it also takes in quantum sensing and communications - think measurements and networking. Put another way, Ernst says that because of the noise on the system, existing quantum systems can run about 50 gates, similar in principle to logic gates on a classical computer. Quantum supremacy is the point where the qubits outpace the bits, when a quantum computer can solve an classical computer could do in a reasonable amount of time. [Extracted from the article]

Large scale quantum computers will break classical public-key cryptography protocols by quantum algorithms such as Shor’s algorithm. Hence, designing quantum-safe cryptosystems to replace current classical algorithms is crucial. Luckily there are some post-quantum candidates that are assumed to be resistant against future attacks from quantum computers, and NIST is considering standardizing them. Among these candidates, lattice-based cryptography sounds more interesting than others due to the performance results as well as confidence in the security. There are few works in the literature evaluating the performance of lattice-based cryptography in hardware. In this paper, we focus on Cryptographic Suite for Algebraic Lattices (CRYSTALS) key exchange mechanisms known as Kyber and provide an instruction-set hardware architecture and implement on Xilinx Artix-7 FPGA for performance evaluation and testing. Our proposed architecture provides an efficient and high-performance set of components to perform polynomial sampling, number-theoretic transform (NTT), and point-wise multiplication to speed up lattice-based post-quantum cryptography (PQC). This architecture implemented on ASIC outperforms state-of-the-art implementations. [ABSTRACT FROM AUTHOR]

An interview with Association for Computing Machinery (ACM) Computing Prize honoree Scott Aaronson is presented in which he discusses his work in the computer science field of quantum complexity, his work on what is termed the collision problem and settings in cryptography, and his results in quantum supremacy. He also discusses approximate boson sampling.

The article discusses the development of the quantum cryptography device and its relationship with trust, including the device's ability to encrypt data and the physicist Artur Ekert's development of the quantum cryptography device in 1991. The role that photons play in the quantum cryptography device is discussed.

The supersingular isogeny key encapsulation (SIKE) protocol, as one of the post-quantum protocol candidates, is widely regarded as the best alternative for curve-based cryptography. However, the long latency, caused by the serial large-degree isogeny computation which is dominated by modular multiplications, has made it less competitive than most popular post-quantum candidates. In this paper, we propose a high-speed and low-latency architecture for our recently presented optimized SIKE algorithm. Firstly, we design a new field arithmetic logic unit (FALU) with many algorithmic transformations and architectural optimizations. Especially, for the FALU, an extremely low-latency modular multiplier is devised based on a modified algorithm by fully parallelizing and highly optimizing the small-size multipliers and the reduction submodules. Secondly, we develop a compact control logic and update the instructions based on the benchmark provided in the newest SIKE library, fitting well with our design. Thirdly, an efficient memory access method is proposed by scheduling the input and output of the arithmetic logic unit (ALU) in two identical RAMs, which can significantly reduce the latency. Finally, we code the proposed architectures using the Verilog language and integrate them into the SIKE library. The implementation results on a Xilinx Virtex-7 FPGA show that for SIKEp751, our design only costs 9.3 ms with a frequency of 155.8 MHz, about 2× faster than the state-of-the-art, and achieves the best area efficiency among existing works. Particularly, the modular multiplier merely needs 16 clock cycles, reducing the delay by nearly one order of magnitude with a small factor of increase in hardware resource. [ABSTRACT FROM AUTHOR]

The Budapest Business Journal recently interviewed Thomas Strohm, a senior research scientist and expert in quantum technologies at Bosch Research, about the current state of quantum computing and its potential impact on various industries. Strohm explained that quantum computing, which leverages the principles of quantum physics, has the potential to outperform classical computing in tasks such as breaking encryption codes. He also highlighted recent advancements in quantum technology, including Bosch's collaboration with IBM to calculate properties of new materials using quantum computers. Strohm discussed how Bosch plans to integrate quantum computing into its operations, particularly in developing new materials, and emphasized the challenges facing the field, such as handling microscopic systems and securing continuous funding for research. He also mentioned Bosch's collaboration with Hungarian academic institutions and the potential risks and ethical considerations associated with the widespread adoption of quantum technology. Strohm expressed his expectations for the ReAQCT conference, hoping that it would foster collaboration and progress in the global quantum technology community. [Extracted from the article]

A recent study conducted by the Department of Computer Sciences and Engineering in Chennai, India, explores the use of quantum-based privacy-preserving techniques for securing communication channels within the Internet of Medical Things (IoMT) systems. The research provides an in-depth overview of quantum cryptography, highlighting its contribution to resolving the data-intensive and networked nature of IoMT systems. Case studies and experiments demonstrate the practicality and effectiveness of quantum-based privacy-preserving techniques in fortifying data integrity and confidentiality. The study also compares quantum-based approaches with classical cryptography, offering insights for healthcare practitioners and technologists in making informed decisions regarding the adoption of quantum-based techniques in IoMT environments. The research concludes that these insights lay the foundation for understanding and implementing secure healthcare communication through the lens of quantum cryptography. [Extracted from the article]

iMessage, the messaging app developed by Apple, is receiving an upgrade to its security measures to protect against future threats posed by quantum computing. iMessage has already provided end-to-end encryption since its launch in 2011, but Apple is now enhancing its security to safeguard against potential attacks from quantum computers. This upgrade, known as PQ3, will make iMessage the only widely available messaging service to reach Level 3 security. The support for PQ3 will be rolled out in various Apple operating systems throughout the year. [Extracted from the article]

A recent report from the National University of Singapore explores the no-cloning theorem in quantum cryptography. The researchers provide new insights into the maximum achievable fidelity of probabilistic and deterministic cloning machines. The study applies this theorem to various subsets of states relevant to quantum cryptography. The research was supported by the National Research Foundation and the Agency for Science Technology & Research. [Extracted from the article]

McKinsey's third annual Quantum Technology Monitor highlights the progress and opportunities in quantum computing, sensing, and communication. The analysis reveals that the chemicals, life sciences, finance, and mobility sectors are likely to benefit the most from quantum computing, with potential gains of up to $2 trillion by 2035. Private investment in quantum technology start-ups decreased by 27 percent, but public funding increased by over 50 percent, with countries like Germany, the United Kingdom, and South Korea leading the way. Talent development in quantum technology is also growing, with an increase in graduates and universities offering QT programs. Collaboration between industry, academia, and government is crucial for the development and commercialization of quantum technology. [Extracted from the article]

The article examines ongoing developments in quantum computing involving hardware, simulations and error correction, algorithms and applications. Topics discussed include anticipated progress in the quantum computing landscape; increasing number of qubits in quantum devices; and call for proposals to develop post-quantum public key cryptographic protocols.

Aliro Quantum, a start-up based in Boston, has attracted investments from Accenture and Cisco. Aliro Quantum is developing foundational technologies for quantum networks and has filed ten patents. The company offers solutions that enable businesses to automate the orchestration and control of quantum networks for various use cases. Orange and Adtran are collaborating on a lab trial of quantum key distribution technology over an optical network, overcoming data loss and distance constraints. MaxLinear has released its DOCSIS 4.0 cable modem and gateway chipset. [Extracted from the article]

Recently, Zhou et al. proposed a quantum bit commitment (QBC) protocol by using Bell states. In this paper, we propose a cryptanalysis strategy for the protocol and demonstrate that the sender can successfully change her commitment without being detected by the recipient with a probability 1 - (1 / 2) n , where n is the number of rounds in executing the protocol. Hence, the protocol does not meet the binding property which shows its insecurity. In order to overcome the shortcomings, we propose an improved version of the protocol. The analysis illustrates that the improvement meets the security requirements. [ABSTRACT FROM AUTHOR]

The article discusses research to prove quantum theory or the theory of general relativity with artificial satellites. Particular focus is given to the Quantum Science Satellite developed by physicist Jian-Wei Pan and team at the University of Science and Technology of China in Hefei, which will look at the relativistic effects of time and space on quantum cryptographic key transmission, photon entanglement, and wave function using photon beams. Other research topics include the effects of time-stretching on photon pulses, quantum entanglement in Bose-Einstein condensates, and quantum interferometry.

Isogeny-based cryptography is one of the promising post-quantum candidates mainly because of its smaller public key length. Due to its high computational cost, efficient implementations are significantly important. In this paper, we have proposed a high-speed FPGA implementation of the supersingular isogeny Diffie-Hellman (SIDH) and key encapsulation (SIKE). To this end, we have adapted the algorithm of finding optimal large-degree isogeny computation strategy for hardware implementations. Using this algorithm, hardware-suited strategies (HSSs) can be devised. We have also developed a tool to schedule field arithmetic operations efficiently using constraint programming. This tool enables reducing the latency of SIDH and SIKE subroutines by up to 14% at NIST’s highest security level, i.e., using the SIKEp751 parameter set. We have also improved the latency of field inversion, the most costly field operation in SIDH, by 23% using the Montgomery ladder technique. We have provided constant-time implementations of SIDH and SIKE on Virtex-7 using SIKEp751 utilizing 6 and 8 prime field multipliers to resemble the previous work. Experimental results show that using 8 multipliers SIDH and SIKE encapsulation and decapsulation can be performed in 24.66 ms and 24.10 ms, which is 1.37 and 1.12 times faster than the latest corresponding FPGA implementations, respectively. [ABSTRACT FROM AUTHOR]

In this work, we present the first highly-optimized implementation of Supersingular Isogeny Key Encapsulation (SIKE) submitted to NIST’s second round of post quantum standardization process, on 64-bit ARMv8 processors. To the best of our knowledge, this work is the first optimized implementation of SIKE round 2 on 64-bit ARM over SIKEp434 and SIKEp610. The proposed library is explicitly optimized for these two security levels and provides constant-time implementation of the SIKE mechanism on ARMv8-powered embedded devices. We adapt different optimization techniques to reduce the total number of underlying arithmetic operations on the field level. In particular, benchmark results on embedded processors equipped with ARM Cortex-A55@1.766GHz and ARM Cortex-A75@2.803GHz show that the entire SIKE round 2 Key Encapsulation Mechanism (KEM) takes only 98.6 ms and 85.3ms at NIST’s security level 1, respectively. We also evaluated the compressed version of NIST’s security level 1, which requires 134.7 ms and 113.7 ms for Cortex-A55 and Cortex-A75, respectively. Considering SIKE’s extremely small key size in comparison to other post-quantum cryptography candidates, our result implies that SIKE is one of the promising candidates for key encapsulation mechanism on embedded devices in the quantum era. [ABSTRACT FROM AUTHOR]

• We reconsider the use of algebraic geometry codes in cryptography. • Applying list decoding algorithms to get smaller key size. • An algorithm to generate secure elliptic codes which can resist known structure attacks is presented. • An IND-CPA variant of post-quantum McEliece cryptosystem is proposed. Code-based cryptography has aroused wide public concern as one of the main candidates for post quantum cryptography to resist attacks against cryptosystems from quantum computation. However, the large key size becomes a drawback that prevents it from wide practical applications although it performs pretty well on the speed of both encryption and decryption. The use of algebraic geometry codes is considered to be a good solution to reduce the key size, but the special structures of algebraic geometry codes results in lots of attacks including Minder's attack. To cope with the barriers of large key size as well as attacks from the special structures of algebraic codes, we propose a code-based encryption system using elliptic codes. The special structure of elliptic codes helps us to effectively reduce the size of secret key. By choosing the rational points carefully, we build elliptic codes whose minimum weight codeword is hard to sample. Such codes are used in constructing encryption systems such that Minder's attacks can be resisted. More importantly, we apply the list decoding algorithm in the decryption process thus more errors beyond half of the minimum distance of the code could be corrected, which is the key point to resist other known attacks for algebraic geometry codes based cryptosystems. Our implementation shows that the proposed encryption system performs well on the key size and ciphertext expansion rate. [ABSTRACT FROM AUTHOR]

Lattice based cryptography plays an important role in the construction of post-quantum cryptography, including key exchange, public key encryption as well as digital signature schemes. Dating back to 2016, a new key exchange scheme called NewHope was proposed by Alkim, Ducas, Pöppelmann, and Schwabe that based security on the quantum hardness of Ring Learning with Errors (RLWE) problem, and was later submitted to the NIST public competition of standard post-quantum cryptography. The new scheme is attractive as it is designed to achieve high performance. In this work, we concentrate on its performance on hardware platforms and propose an efficient implementation of NewHope on Xilinx Artix-7 7020 FPGA platform that consumes 3158 slices, 10285 LUTs, 6623 registers in the server side, and 3042 slices, 10345 LUTs, 6704 registers in the client side, achieving a 45% reduction in LUT, 30% reduction in FF while the total time utilization also decreases by 16% compared with the up to date and directly related work. Specifically, we can accomplish three phases of the key exchange in 39.8/61.7/ $21.4~\mu \text{s}$ respectively, operating in 153/152 MHz in server/client side. [ABSTRACT FROM AUTHOR]

DigiCert, a global provider of digital trust, has released its 2024 State of Digital Trust Survey, which examines how organizations are managing digital trust. The survey reveals a growing divide between "leaders" and "laggards" in terms of digital trust. The top 33% of organizations, considered leaders, experienced higher revenue, better digital innovation, and higher employee productivity. They were also more prepared for Post Quantum Cryptography and took advantage of the benefits of the Internet of Things. On the other hand, the bottom 33% of organizations, classified as laggards, struggled in these areas and found it harder to benefit from digital innovation. The leaders were more likely to centrally manage their certificates, employ email authentication and encryption technology, and had more mature practices in digital trust management. [Extracted from the article]