Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Verifier-Key-Flexible Universal Designated-Verifier Signatures: Label: en
Multi-key Hierarchical Identity-Based Signatures: Label: en
Toward Acceleration of RSA Using 3D Graphics Hardware: Label: en
Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic: Label: en
Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction: Label: en
Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic: Label: en
Optimised Versions of the Ate and Twisted Ate Pairings: Label: en
On the Connection Between Signcryption and One-Pass Key Establishment: Label: en
Randomness Reuse: Extensions and Improvements: Label: en
Efficient KEMs with Partial Message Recovery: Label: en
Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences: Label: en
Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity: Label: en
New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures: Label: en
Cryptographic Side-Channels from Low-Power Cache Memory: Label: en
Algebraic Cryptanalysis of the Data Encryption Standard: Label: en
Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption: Label: en
Cryptanalysis of the EPBC Authenticated Encryption Mode: Label: en
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes: Label: en
On the Walsh Spectrum of a New APN Function: Label: en
Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions: Label: en
How to Forge a Time-Stamp Which Adobe’s Acrobat Accepts: Label: en
Finding Invalid Signatures in Pairing-Based Batches: Label: en
Galois Rings and Pseudo-random Sequences: Label: en
Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise: Label: en
Soft decision decoding of Reed Solomon codes using the Dorsch algorithm: Label: en
A storage complexity based analogue of Maurer key establishment using public channels: Label: en
Computation of low-weight parity checks for correlation attacks on stream ciphers: Label: en
The synthesis of perfect sequences: Label: en
Some decoding applications of minimal realization: Label: en
The main conjecture for MDS codes: Label: en
Minimal weight k-SR representations: Label: en
Linear Span analysis of a set of periodic sequence generators: Label: en
Sequential decoding for a subcode of Reed Solomon Codes: Label: en
Minimal supports in linear codes: Label: en
A broadcast key distribution scheme based on block designs: Label: en
Constructions for variable-length error-correcting codes: Label: en
Analysis of sequence segment keying as a method of CDMA transmission: Label: en
Cryptanalysis of Harari's identification scheme: Label: en
A note on the hash function of Tillich and Zémor: Label: en
Some constructions of generalised concatenated codes based on unit memory codes: Label: en
Coding and cryptography for speech and vision: Label: en
A new algorithm for finding minimum-weight words in large linear codes: Label: en
Church-Rosser codes: Label: en
On-line secret sharing: Label: en
Distribution of recurrent sequences modulo prime powers: Label: en
Efficient generation of binary words of given weight: Label: en
Authentication codes: An area where coding and cryptology meet: Label: en
Multi-dimensional ring TCM codes for fading channels: Label: en
An elliptic curve analogue of McCurley's key agreement scheme: Label: en
How traveling salespersons prove their identity: Label: en