London Lattice Coding and Crypto Meeting

Add to your list(s) Download to your calendar using vCal

• Multiple speakers
• Wednesday 18 September 2019, 10:30-18:00
• EEE CAP seminar room 1109.

If you have a question about this talk, please contact Cong Ling.

Lattice-based approaches are emerging as a common theme in modern cryptography and coding theory. In communications, they are useful mathematical tools to construct powerful error-correction codes achieving the capacity of wireless channels. In cryptography, they are used to building lattice-based schemes with provable security, better asymptotic efficiency, resilience against quantum attacks and new functionalities such as fully homomorphic encryption.

This meeting — on Wednesday 18 September 2019 — is aimed at connecting the two communities with a common interest in lattices. It will consist of several talks on related topics, with a format aimed at encouraging interaction.

Programme

10:30 – 12:00 | Thomas Debris: Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes

We present here a new family of trapdoor one-way functions that are Preimage Sampleable on Average (PSA) based on codes: the Wave-PSA family. Our trapdoor function is one-way under two computational assumptions: the hardness of generic decoding for high weights and the indistinguishability of generalized (U, U V)-codes. Our proof follows the GPV strategy [GPV08]. By including rejection sampling, we ensure the proper distribution for the trapdoor inverse output. The domain sampling property of our family is ensured by using and proving a variant of the left-over hash lemma. We instantiate the new Wave-PSA family with ternary generalized (U, U V)-codes to design a “hash-and-sign” signature scheme which achieves existential unforgeability under adaptive chosen message attacks (EUF-CMA) in the random oracle model. For 128 bits of classical security, signature sizes are in the order of 13 thousand bits, the public key size in the order of 3 megabytes, and the rejection rate is limited to one rejection every 10 to 12 signatures.

13:00 – 14:30 | Sebastian Stern: Complex and Quaternion-Valued Lattices for Digital Transmission

In digital communications, lattices can be utilized to design powerful coding and modulation schemes. Moreover, in recent years, lattice-reduction-aided equalization approaches have become very popular since they enable high-quality multiple-input/multiple-output (MIMO) transmission, particularly in multi-user/multi-antenna scenarios. Unfortunately, in (mathematical) lattice theory, real-valued lattices are most often considered, i.e., lattices over the (real-valued) integers. In contrast, in the field of radio-frequency communication, equivalent baseband transmit and receive signals are usually represented using complex numbers (single-polarized electromagnetic waves) or quaternions (dual-polarized electromagnetic waves).

Hence, in the first part of the talk, complex-valued lattices are discussed. In particular, lattices over the Gaussian integers (complex integer lattice) as well as the Eisenstein integers (complex hexagonal lattice; densest 2D packing) and related coded-modulation schemes are considered. It is shown how criteria and algorithms for lattice basis reduction can be generalized to the complex-valued case. Besides, for the MIMO setting, the constraints on the channel code and the modulation approach are worked out.

In the second part of the presentation, quaternion-valued lattices are focused. This concerns lattices over the Lipschitz integers (quaternion-valued integer lattice) and the Hurwitz integers (isomorphic to D4 lattice; densest 4D packing). The similarities and differences to complex lattices are enlightened and related coded-modulation strategies are presented.

15:00 – 16:00 | Ayush Bhandari: The Unlimited Sensing Framework: Sampling and Reconstruction using Modulo Non-linearities

Almost all forms of data are captured using digital sensors or analog-to-digital converters (ADCs) which are inherently limited by dynamic range. Consequently, whenever a physical signal exceeds the maximum recordable voltage, the digital sensor saturates and results in clipped measurements. For example, a camera pointed towards the sun leads to an all-white photograph. Motivated by a variety of applications including scientific imaging, communication theory and digital sensing, a natural question that arises is: Can we capture a signal with arbitrary dynamic range?

In this work, we introduce the Unlimited Sensing framework which is a novel, non-linear sensing architecture that allows for recovery of an arbitrarily high dynamic range, continuous-time signal from its low dynamic range, digital measurements. Our work is based on a radically different ADC design, which allows for the ADC to reset rather than to saturate, thus producing modulo or folded samples.

In the first part of this talk, we discuss a recovery guarantee akin to Shannon’s sampling theorem which, remarkably, is independent of the maximum recordable ADC voltage. Our theory is complemented with a stable recovery algorithm. Moving further, we reinterpret the unlimited sensing framework as a generalized linear model and discuss the recovery of structured signals such as continuous-time sparse signals. This new sensing paradigm that is based on a co-design of hardware and algorithms leads to several interesting future research directions. On the theoretical front, a fundamental interplay of sampling theory and inverse problems raises new standalone questions. On the practical front, the benefits of a new way to sense the world (without dynamic range limitations) are clearly visible. We conclude this talk with a discussion on future directions and relevant applications.

16:30 – 18:00 | Subhayan Roy Moulik: Quantum Algorithms for Lattice Sieving

The Shortest Vector Problem (SVP) is one of the central problems in the theory of lattices. For a given d-dimensional Euclidean lattice, usually described by a basis, to solve SVP is to find the shortest non-zero vector in the lattice. This talk will be about discussing new algorithms and design techniques to solve SVP on a quantum computer, that is equipped with Hadamard, CNOT and pi/8 gates; and comparing it with the best known quantum algorithm, that solves SVP in exp(0.2653d o(d)) time steps, needs exp(0.2653d o(d)) classical memory, and is set in the QRAM model.

In the first part of the talk I will formulate the quantum analogue of the classical k-Sieve Algorithm, due to Herold-Kirshanova-Laarhoven in the QRAM model and show how to find the short(est) vector with exp(0.1395d o(d)) classical memory, in exp(0.2989d o(d)) time steps. Following that, I will a rephrase and discuss k-Sieve as k-Clique listing problem.

In the second part of the talk, I want to reflect on the issues of QRAM model of quantum computation and then go on to present a distributed quantum algorithm in the circuit model that heuristically solves SVP in exp(0.1037d o(d)) time steps and needs exp(0.2075d o(d)) quantum memory. Time permitting I will discuss a classical counterpart of this distributed quantum algorithm.

All exponents are base 2. This talk will be based on results from a joint work with Elena Kirshanova, Erik Mårtensson, and Eamonn Postlethwaite.

18:30 – | Workshop Dinner

This talk is part of the COMMSP Seminar series.

This talk is included in these lists:

• COMMSP & CP list
• COMMSP Seminar
• EEE CAP seminar room 1109
• SAP Talks

Note that ex-directory lists are not shown.