CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems

Lattice problems are a class of optimization problems that are notably hard. There are no classical or quantum algorithms known to solve these problems efficiently. Their hardness has made lattices a major cryptographic primitive for post-quantum cryptography. Several different approaches have been...

Full description

Bibliographic Details

Published in:	Proceedings - International Conference on High Performance Computing pp. 42 - 52
Main Authors:	Tateiwa, Nariaki, Shinano, Yuji, Yamamura, Keiichiro, Yoshida, Akihiro, Kaji, Shizuo, Yasuda, Masaya, Fujisawa, Katsuki
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2021
Subjects:	Conferences Cryptography Discrete optimization Generators High performance computing Lattice problem Lattice-based cryptography Lattices Parallel algorithms Quantum algorithm Shortest vector problem Stability analysis Ubiquity Generator Framework
ISSN:	2640-0316
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!