Public-key cryptography provides security for digital systems and communication. Traditional cryptographic solutions are constantly improved, e.g., to suppress brute-force attacks. However, Shor’s algorithm suited for quantum computers can break the bedrock of most currently used systems, i.e., the RSA problem and discrete logarithm problem. Post-quantum cryptography can withstand attacks carried out by quantum computers. Several families of post-quantum systems exist; one of them is isogeny-based cryptography. As a main contribution, in this paper, we provide a survey of chosen, fundamental isogeny-based schemes. The target audience of this review is researchers interested in practical aspects of this field of cryptography; therefore the survey contains exemplary implementations. Our goal was not to develop an efficient implementation, but to provide materials that make it easier to analyze isogeny-based cryptography.
Businesses are slowly replacing Universal Product Code (barcodes used for tracking items) with radio-frequency identification (RFID). Unlike a barcode, RFID tag does not need to be within the line of sight of the reader, and can be interrogated from up to hundreds of meters from the reader in the case of active tag. Some readers are designed to read multiple RFID tags concurrently, which is useful in, e.g., warehouses. We address the problem of efficient methods for simultaneous authentication of multiple RFID tags – batch tag authentication. We provide a general design to build a provable secure batch tag authentication protocol from a single-tag authentication scheme using some aggregation function. Our main goal is to build a computationally-efficient batch tag authentication method that provides a reasonable level of anonymity in a model with an untrusted RFID reader. We provide an efficiency analysis of a protocol where the Bloom filter is used as the aggregation function together with a brief comparison with alternative data structures.