scientific article

No author found.

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

cryptography cryptanalysis cryptology authentication protocols

Cryptography (94A60) Collections of articles of miscellaneous specific interest (00B15) Data encryption (aspects in computer science) (68P25) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Authentication, digital signatures and secret sharing (94A62)

Related Items (68)

Improving bounds for the number of correlation immune Boolean functions ⋮ An attack on a recursive authentication protocol. A cautionary tale ⋮ Linear complexity of the Naor-Reingold pseudo-random function ⋮ Two secret sharing schemes based on Boolean operations ⋮ The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key ⋮ An efficient key authentication procedure for IND-CCA2 secure Paillier-based cryptosystem ⋮ An efficient multi-receipt mechanism for uncoercible anonymous electronic voting ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Hash function based on piecewise nonlinear chaotic map ⋮ The use of mathematical linguistic methods in creating secret sharing threshold algorithms ⋮ Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ The expected value of the joint linear complexity of periodic multisequences ⋮ Construction of sequences with high nonlinear complexity from a generalization of the Hermitian function field ⋮ New bound for affine resolvable designs and its application to authentication codes ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ A generalization of the formulas for intersection numbers of dual polar association schemes and their applications ⋮ The independence of two randomness properties of sequences over finite fields ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ A new key authentication scheme based on discrete logarithms ⋮ Cryptographic protocols and voting ⋮ Anzahl formulas of subspaces in symplectic spaces and their applications ⋮ Improved low-computation partially blind signatures. ⋮ Linear Span analysis of a set of periodic sequence generators ⋮ Authentication codes: An area where coding and cryptology meet ⋮ Singular linear space and its applications ⋮ One-time pad as a nonlinear dynamical system ⋮ A new digital signature scheme based on chaotic maps ⋮ Preimage selective trapdoor function: how to repair an easy problem ⋮ Modelling nonlinear sequence generators in terms of linear cellular automata ⋮ Linear algebra approach to secret sharing schemes ⋮ On nonlinear filter generators ⋮ Fast message authentication using efficient polynomial evaluation ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ Multisequences with almost perfect linear complexity profile and function fields over finite fields ⋮ Strongly ideal secret sharing schemes ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ A novel key management scheme for dynamic access control in a user hierarchy ⋮ Efficient on-line electronic checks ⋮ Improvement of Tseng et al.'s authenticated encryption scheme with message linkages ⋮ Use of chaotic dynamical systems in cryptography ⋮ Linear secret sharing schemes and rearrangements of access structures ⋮ An efficient algorithm to generate binary sequences for cryptographic purposes ⋮ Predicting nonlinear pseudorandom number generators ⋮ Generalized Joint Linear Complexity of Linear Recurring Multisequences ⋮ Chaos synchronization for a class of discrete dynamical systems on the \(N\)-dimensional torus ⋮ On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation ⋮ Broadcast authentication for group communication ⋮ Key distribution patterns using Minkowski planes ⋮ Shrinking generators and statistical leakage ⋮ New generalized secret-sharing schemes with points on a hyperplane using a Wronskian matrix ⋮ Linear connectivity problems in directed hypergraphs ⋮ Randomness measures related to subset occurrence ⋮ On the linear complexity profile of some new explicit inversive pseudorandom numbers ⋮ Reliable communication over partially authenticated networks ⋮ Hardware optimizations of stream cipher rabbit ⋮ Counting functions and expected values for the lattice profile at \(n\) ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences ⋮ On the linear complexity profile of explicit nonlinear pseudorandom numbers. ⋮ Further results on asymmetric authentication schemes ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions ⋮ Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform ⋮ Counting functions and expected values for the \(k\)-error linear complexity

This page was built for publication: