Compact and Simple RLWE Based Key Encapsulation Mechanism

2019-01-01
Alkim, Erdem
Bilgin, Yusuf Alper
Cenk, Murat
n this paper, we propose a key encapsulation scheme based on NewHope and Kyber, two NIST post-quantum standardization project candidates. Our scheme is based on NewHope, thus it is simple and has fast implementation while it is making use of smaller key sizes and easily changeable security level advantages of Kyber. The scheme heavily use recent advances on Number Theoretic Transform (NTT) in a way that transformation from one degree polynomial to another is easy. To make it possible, we changed the definition of component in component-wise multiplication during polynomial multiplication and show that changing security level only requires to change the size of polynomial and the definition of component. Our scheme has 11.5% smaller communication cost for the same security level comparing with NewHope. In addition, it is at least 17% faster C implementation comparing with non-optimized Kyber implementation from the first round of the NIST standardization process.
6th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT)

Suggestions

Design and performance evaluation of a flexible and efficient server assisted signature protocol
Bicakci, K; Baykal, Nazife (2003-07-03)
One method to reduce the computational costs of generating public key signatures on constrained devices is to get help from a verifiable server In this paper, we propose a (verifiable) server assisted signature protocol which is the first one that totally elliminates public key operations for the ordinary user Our protocol is also more efficient and flexible in terms of storage since unlike previous ones the user does not need to save the server's signatures to prove its cheating.
Efficient interleaved Montgomery modular multiplication for lattice-based cryptography
AKLEYLEK, SEDAT; Tok, Zaliha Yuce (2014-01-01)
In this paper, we give modified version of interleaved Montgomery modular multiplication method for lattice-based cryptography. With the proposed algorithms, we improve the multiplication complexity and embed the conversion operation into the algorithm with almost free cost. We implement the proposed methods for the quotient ring (Z/qZ)[x]/(x(n) - 1) and (Z/pZ)[x]/(x(n) + 1) on the GPU (NVIDIA Quadro 600) using the CUDA platform. NTRUEncrypt is accelerated approximately 35% on the GPU by using the proposed ...
DISTRIBUTED 3D DYNAMIC MESH CODING
Bici, M. Oguz; Akar, Gözde (2008-10-15)
In this paper, we propose a distributed 3D dynamic mesh coding system. The system is based on Slepian and Wolf's and Wyner and Ziv's information-theoretic results. Our system extends the ideas in distributed video coding to 3D dynamic meshes with constant connectivity. The connectivity of the sequence and key frames are encoded and decoded by a conventional static mesh coder. The Wyner-Ziv frames are encoded independent of key frames but decoded jointly with decoded key frames. The joint decoding is perform...
An On-chip Switch Architecture for Hardware Accelerated Cloud Computing Systems Donanim Hizlandiricili Bulut Bilisim Sistemleri icin Yonga-ustu Anahtar Mimarisi
Yazıcı, Fatih; Yildiz, Ayhan Sefa; Yazar, Alper; Schmidt, Şenan Ece (2020-10-05)
© 2020 IEEE.In this paper, we propose a scalable on-chip packet switch architecture for hardware accelerated cloud computing systems. Our proposed switch architecture is implemented on the FPGA and interconnects reconfigurable regions, 40 Gbps Ethernet interfaces and a PCIe interface. The switch fabric operates at line speed to achieve scalability. We propose a new algorithm that grants access to the fabric according to the allocated prioritization to input-output port pairs. The switch is implemented on Xi...
New methods for public key cryptosystems based on XTR
AKLEYLEK, SEDAT; KIRLAR, Barış Bülent (2015-12-01)
In this paper, we propose novel deterministic and probabilistic public key cryptographic schemes based on an effective and compact subgroup trace representation cryptosystem to handle with the problem of secure and efficient communication between the server and resource-constrained device. The proposed schemes use the hardness of the Trace-discrete logarithmic like problem. We also show that the deterministic version of the proposed scheme is a one-way trapdoor, and the probabilistic version of the proposed...
Citation Formats
E. Alkim, Y. A. Bilgin, and M. Cenk, “Compact and Simple RLWE Based Key Encapsulation Mechanism,” Santiago de Chile, CHILE, 2019, vol. 11774, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30010.