Generic Certificateless Key Encapsulation Mechanism

2007 ◽  
pp. 215-229 ◽  
Author(s):  
Qiong Huang ◽  
Duncan S. Wong
Keyword(s):  
Key Encapsulation Mechanism

LizarMong: Excellent Key Encapsulation Mechanism Based on RLWE and RLWR

2020 ◽  
pp. 208-224
Author(s):  
Chi-Gon Jung ◽  
JongHyeok Lee ◽  
Youngjin Ju ◽  
Yong-Been Kwon ◽  
Seong-Woo Kim ◽  
...  
Keyword(s):  
Key Encapsulation Mechanism

scholarly journals From Key Encapsulation to Authenticated Group Key Establishment—A Compiler for Post-Quantum Primitives †

Entropy ◽  
2019 ◽  
Vol 21 (12) ◽  
pp. 1183 ◽  
Author(s):  
Edoardo Persichetti ◽  
Rainer Steinwandt ◽  
Adriana Suárez Corona
Keyword(s):  
Quantum Cryptography ◽  
Signature Scheme ◽  
Key Establishment ◽  
Group Key ◽  
Generic Construction ◽  
Key Encapsulation Mechanism ◽  
Authenticated Group Key ◽  
Post Quantum Cryptography ◽  
Group Key Establishment

Assuming the availability of an existentially unforgeable signature scheme and an (IND- CCA secure) key encapsulation mechanism, we present a generic construction for group key establishment. The construction is designed with existing proposals for post-quantum cryptography in mind. Applied with such existing proposals and assuming their security, we obtain a quantum-safe three-round protocol for authenticated group key establishment that requires only one signature per protocol participant.

scholarly journals Improving the Performance of RLizard on Memory-Constraint IoT Devices with 8-Bit ATmega MCU

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1549
Author(s):  
Jin-Kwan Jeon ◽  
In-Won Hwang ◽  
Hyun-Jun Lee ◽  
Younho Lee
Keyword(s):  
Internet Of Things ◽  
Flash Memory ◽  
Clock Cycle ◽  
Special Property ◽  
Multiplication Process ◽  
Key Encapsulation Mechanism ◽  
Implementation Method ◽  
Read Only Memory ◽  
Iot Devices ◽  
Micro Controller Unit

We propose an improved RLizard implementation method that enables the RLizard key encapsulation mechanism (KEM) to run in a resource-constrained Internet of Things (IoT) environment with an 8-bit micro controller unit (MCU) and 8–16 KB of SRAM. Existing research has shown that the proposed method can function in a relatively high-end IoT environment, but there is a limitation when applying the existing implementation to our environment because of the insufficient SRAM space. We improve the implementation of the RLizard KEM by utilizing electrically erasable, programmable, read-only memory (EEPROM) and flash memory, which is possessed by all 8-bit ATmega MCUs. In addition, in order to prevent a decrease in execution time related to their use, we improve the multiplication process between polynomials utilizing the special property of the second multiplicand in each algorithm of the RLizard KEM. Thus, we reduce the required MCU clock cycle consumption. The results show that, compared to the existing code submitted to the National Institute of Standard and Technology (NIST) PQC standardization competition, the required MCU clock cycle is reduced by an average of 52%, and the memory used is reduced by approximately 77%. In this way, we verified that the RLizard KEM works well in our low-end IoT environments.

scholarly journals Efficient Hierarchical Identity-Based Encryption for Mobile Ad Hoc Networks

2014 ◽  
Vol 10 (4) ◽  
pp. 407-425 ◽  
Author(s):  
Kai He ◽  
Min-Rong Chen ◽  
Yijun Mao ◽  
Xi Zhang ◽  
Yiju Zhan
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Computational Cost ◽  
Communication Overhead ◽  
Wired Networks ◽  
Identity Based Encryption ◽  
Key Encapsulation Mechanism ◽  
Identity Based ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-hoc Network (MANET) is a collection of wireless nodes that can dynamically form a network to exchange information without using any pre-existing fixed network infrastructure. Such networks are more vulnerable to security attacks than conventional wired networks, and hence cryptographic schemes are usually used to ensure security for them. It is worth noting that the nodes in MANETs are with low computational power and communicate over relatively bandwidth constrained wireless links, and thus the deployed cryptographic schemes should usually be highly efficient in term of both computational cost and communication overhead. To ensure the data confidentiality for MANETs, in this paper, we present a new hierarchical identity-based encryption (HIBE) scheme, which enjoys the advantages of low computational cost and light communication overhead. We further propose a new hierarchical identity-based key encapsulation mechanism (HIBKEM) based on our HIBE scheme. The proposed HIBKEM scheme is fully secure against adaptive chosen-ciphertext attack, and has a tight security reduction in the standard model.

scholarly journals Polynomial multiplication on embedded vector architectures

2021 ◽  
pp. 482-505
Author(s):  
Hanno Becker ◽  
Jose Maria Bermudo Mera ◽  
Angshuman Karmakar ◽  
Joseph Yiu ◽  
Ingrid Verbauwhede
Keyword(s):  
Instruction Scheduling ◽  
Polynomial Multiplication ◽  
Performance Improvements ◽  
Low Area ◽  
Memory Efficiency ◽  
Key Encapsulation Mechanism ◽  
Profile Vector ◽  
And Performance ◽  
Lattice Based Cryptography ◽  
High Degree

High-degree, low-precision polynomial arithmetic is a fundamental computational primitive underlying structured lattice based cryptography. Its algorithmic properties and suitability for implementation on different compute platforms is an active area of research, and this article contributes to this line of work: Firstly, we present memory-efficiency and performance improvements for the Toom-Cook/Karatsuba polynomial multiplication strategy. Secondly, we provide implementations of those improvements on Arm® Cortex®-M4 CPU, as well as the newer Cortex-M55 processor, the first M-profile core implementing the M-profile Vector Extension (MVE), also known as Arm® Helium™ technology. We also implement the Number Theoretic Transform (NTT) on the Cortex-M55 processor. We show that despite being singleissue, in-order and offering only 8 vector registers compared to 32 on A-profile SIMD architectures like Arm® Neon™ technology and the Scalable Vector Extension (SVE), by careful register management and instruction scheduling, we can obtain a 3× to 5× performance improvement over already highly optimized implementations on Cortex-M4, while maintaining a low area and energy profile necessary for use in embedded market. Finally, as a real-world application we integrate our multiplication techniques to post-quantum key-encapsulation mechanism Saber

scholarly journals Cca-Secure Key Encapsulation Mechanism Based on Factoring Assumption

2012 ◽  
Vol 53 (1) ◽  
pp. 137-146
Author(s):  
Márton Gyöngyvér
Keyword(s):  
Quadratic Residue ◽  
Key Encapsulation Mechanism ◽  
Input Element

ABSTRACT In this article a key encapsulation mechanism is presented which is based on squaring function, where the input element is from QR+N, where QR+N denotes the signed quadratic residue group, and N is a Blum integer. The article presents the soundness, the efficiency and the proof of CCA security of the proposed mechanism

Sign in / Sign up

Export Citation Format

Share Document