Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
3,085
result(s) for
"Public key cryptography"
Sort by:
Asymmetric cryptography : primitives and protocols
\"Public key cryptography was introduced by Diffie and Hellman in 1976, and it was soon followed by concrete instantiations of public-key encryption and signatures; these led to an entirely new field of research with formal definitions and security models. Since then, impressive tools have been developed with seemingly magical properties, including those that exploit the rich structure of pairings on elliptic curves. Asymmetric Cryptography starts by presenting encryption and signatures, the basic primitives in public-key cryptography. It goes on to explain the notion of provable security, which formally defines what \"secure\" means in terms of a cryptographic scheme. A selection of famous families of protocols are then described, including zero-knowledge proofs, multi-party computation and key exchange. After a general introduction to pairing-based cryptography, this book presents advanced cryptographic schemes for confidentiality and authentication with additional properties such as anonymous signatures and multi-recipient encryption schemes. Finally, it details the more recent topic of verifiable computation.\"-- Page 4 of cover.
Book
Low-Cost Area-Efficient FPGA-Based Multi-Functional ECDSA/EdDSA
In cryptography, elliptic curve cryptography (ECC) is considered an efficient and secure method to implement digital signature algorithms (DSAs). ECC plays an essential role in many security applications, such as transport layer security (TLS), internet protocol security (IPsec), and wireless sensor networks (WSNs). The proposed designs of ECC hardware implementation only focus on a single ECC variant and use many resources. These proposals cannot be used for resource-constrained applications or for the devices that need to provide multiple levels of security. This work provides a multi-functional elliptic curve digital signature algorithm (ECDSA) and Edwards-curve digital signature algorithm (EdDSA) hardware implementation. The core can run multiple ECDSA/EdDSA algorithms in a single design. The design consumes fewer resources than the other single-functional design, and is not based on digital signal processors (DSP). The experiments show that the proposed core could run up to 112.2 megahertz with Virtex-7 devices while consuming only 10,259 slices in total.
Journal Article
The manga guide to cryptography
\"A manga comic-based introduction to cryptography, including ciphers, symmetric-key algorithms, and public key encryption. An English translation of the Japanese original\"-- Provided by publisher.
Book
Mathematics of Public Key Cryptography
Public key cryptography is a major interdisciplinary subject with many real-world applications, such as digital signatures. A strong background in the mathematics underlying public key cryptography is essential for a deep understanding of the subject, and this book provides exactly that for students and researchers in mathematics, computer science and electrical engineering. Carefully written to communicate the major ideas and techniques of public key cryptography to a wide readership, this text is enlivened throughout with historical remarks and insightful perspectives on the development of the subject. Numerous examples, proofs and exercises make it suitable as a textbook for an advanced course, as well as for self-study. For more experienced researchers it serves as a convenient reference for many important topics: the Pollard algorithms, Maurer reduction, isogenies, algebraic tori, hyperelliptic curves and many more.
eBook
Non-Restoring Array Divider Using Optimized CAS Cells Based on Quantum-Dot Cellular Automata with Minimized Latency and Power Dissipation for Quantum Computing
Many studies have addressed the physical limitations of complementary metal-oxide semi-conductor (CMOS) technology and the need for next-generation technologies, and quantum-dot cellular automata (QCA) are emerging as a replacement for nanotechnology. Meanwhile, the divider is the most-used circuit in arithmetic operations with squares and multipliers, and the development of effective dividers is crucial for improving the efficiency of inversion and exponentiation, which is known as the most complex operation. In most public-key cryptography systems, the corresponding operations are used by applying algebraic structures such as fields or groups. In this paper, an improved design of a non-restoring array divider (N-RAD) is proposed based on the promising technology of QCA. Our QCA design is focused on the optimization of dividers using controlled add/subtract (CAS) cells composed of an XOR and full adder. We propose a new CAS cell using a full adder that is designed to be very stable and compact so that power dissipation is minimized. The proposed design is considerably improved in many ways compared with the best existing N-RADs and is verified through simulations using QCADesigner and QCAPro. The proposed full adder reduces the energy loss rate by at least 25% compared to the existing structures, and the divider has about 23%~4.5% lower latency compared to the latest coplanar and multilayer structures.
Journal Article
New certificateless short signature scheme
The certificateless public key cryptography has attracted wide attention since it could solve the certificate management problem in the traditional public key cryptography and the key escrow problem in the identity-based public key cryptography. Recently, several certificateless short signature schemes, which could satisfy the requirement of low-bandwidth communication environments, have been proposed. However, most of them are not secure against either the Type I adversary or the Type II adversary. In this study, the authors propose a new efficient certificateless short signature scheme. The analysis shows the authors' scheme has better performance than the related schemes and is secure against both of the super Type I and the super Type II adversaries.
Journal Article
Public-Key Cryptography and Computational Number Theory
The Proceedings contain twenty selected, refereed contributions arising from the International Conference on Public-Key Cryptography and Computational Number Theory held in Warsaw, Poland, on September 11-15, 2000.
The conference, attended by eightyfive mathematicians from eleven countries, was organized by the Stefan Banach International Mathematical Center.
This volume contains articles from leading experts in the world on cryptography and computational number theory, providing an account of the state of research in a wide variety of topics related to the conference theme. It is dedicated to the memory of the Polish mathematicians Marian Rejewski (1905-1980), Jerzy Róøycki (1909-1942) and Henryk Zygalski (1907-1978), who deciphered the military version of the famous Enigma in December 1932 – January 1933. A noteworthy feature of the volume is a foreword written by Andrew Odlyzko on the progress in cryptography from Enigma time until now.
eBook
Public-Key Cryptography and Computational Number Theory
The series is aimed specifically at publishing peer reviewed reviews and contributions presented at workshops and conferences. Each volume is associated with a particular conference, symposium or workshop. These events cover various topics within pure and applied mathematics and provide up-to-date coverage of new developments, methods and applications.
eBook
公钥密码安全强度刻画概述
安全强度是对密码方案安全性的量化指标,代表了攻破某密码方案所需的计算开销.公钥密码方案的安全强度与构建该方案所依赖的困难问题和具体的参数有关.随着后量子密码学的发展,原先单一的安全强度评估标准产生了变化和扩充.因此,系统性总结数论体系下的经典公钥密码和抗量子攻击的后量子公钥密码的安全强度具有重要意义.本文首先介绍了经典公钥密码和后量子公钥密码的安全强度定义.然后给出了一些经典公钥密码方案的安全强度和后量子公钥密码方案的安全强度级别.接着从常见密码方案的现实应用出发,介绍若干在商用安全服务中使用的公钥密码方案及其安全强度分析.最后,给出本文的总结,并根据目前公钥密码安全性研究和应用的不足,对未来的研究和应用提出了展望.
Journal Article
First end‐to‐end PQC protected DPU‐to‐DPU communications
The appearance of quantum computing in the short foreseeable future and its capability to break conventional cryptographic algorithms forces to change the paradigm of secure real‐time communications. Thus, government organizations, data centers, and enterprises among others are migrating their public key infrastructure towards using post‐quantum cryptography (PQC) algorithms in order to mitigate the security threats posed by quantum computers. This letter presents the first quantum resilient secure end‐to‐end communication link based on PQC algorithms operating between two data‐processing units DPU. Both data‐processing units employ on‐board ARM processors to perform the computationally expensive cryptographic building blocks—in that case CRYSTALS‐Kyber as a key encapsulation mechanism and CRYSTALS‐Dilithium for digital signature scheme in combination with advanced encryption standard with 256‐bit key.
Journal Article