Applications of Codes and Lattices in Cryptography and Wireless Communications

Dear Colleagues,

Modern digital communication is widely used today in all kinds of online e-communications, including secure WWW communications, credit-card and EFTPOS transactions, Internet banking, smartphone and wireless networking, satellite communication, and many others.

Random and structured codes and lattices form effective building blocks for various cryptographic and wireless communications designs and analyses. For example, Euclidean lattice reduction techniques, such as the celebrated LLL and BKZ algorithms, have been used to evaluate the best known attacks on lattice-based cryptographic primitives and set concrete parameters for such constructions. The abovementioned lattice reduction tools have also been used to design, analyze, and efficiently implement transmitting and receiving communication schemes in multiple-input multiple-output (MIMO) channels and physical layer network coding.

Hard lattice-based and code-based problems, e.g., finding (within some approximation factor) the shortest nonzero lattice vector (approximate shortest vector problem (Approx-SVP)) or a lattice vector close to a given target vector (approximate bounded distance decoding (Approx-BDD)), are now considered the most likely candidates to thwart the threat presented to Internet security from the rise of quantum computers. For example, the US National Institute of Standards and Technology (NIST) initiated a 5–10 year standardization process at the end of 2017 for quantum-resistant cryptographic algorithms to be evaluated for selecting the new public-key cryptography standards. Beyond that, lattices and codes have been the main building block of the efficient and secure traditional and advanced cryptographic primitives.

Wireless communication engineers and particularly coding and information theorists are interested in employing Euclidean lattices for quantization and modulation and lattice reduction techniques for receiver designs. The goodness of lattices for these problems scales with the lattice dimension.

This Special Issue aims to be a forum for the presentation of novel techniques and application of codes and lattices in wireless communications and cryptography. In particular, the design, analysis, and implementation of real-world wireless communication and cryptographic problems with the help of algebraic number theory tools based on algebraic codes and (structured) Euclidean lattices fall within the scope of this Special Issue.

Dr. Amin Sakzad
Dr. Khoa Nguyen
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.