scientific article; zbMATH DE number 54007
From MaRDI portal
Publication:4004196
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) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Recommendations
Cited in
(81)- Linear connectivity problems in directed hypergraphs
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
- Strongly ideal secret sharing schemes
- Advances in cryptology 1981-1997. Electronic proceedings and index of the CRYPTO and EUROCRYPT conferences 1981-1997. Incl. CD-ROM
- Reliable communication over partially authenticated networks
- The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key
- Advances in cryptology -- EUROCRYPT `97. Proceedings of the 16th International conference on the Theory and application of cryptographic techniques, Konstanz, Germany, May 11--15, 1997.
- The expected value of the joint linear complexity of periodic multisequences
- Cartesian authentication codes from functions with optimal nonlinearity.
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
- A new key authentication scheme based on discrete logarithms
- Improved low-computation partially blind signatures.
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Counting functions and expected values for the \(k\)-error linear complexity
- Preimage selective trapdoor function: how to repair an easy problem
- 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
- On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation
- Key distribution patterns using Minkowski planes
- Shrinking generators and statistical leakage
- On the linear complexity profile of some new explicit inversive pseudorandom numbers
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- Further results on asymmetric authentication schemes
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Cryptology: A new application of mathematics
- Anzahl formulas of subspaces in symplectic spaces and their applications
- An efficient key authentication procedure for IND-CCA2 secure Paillier-based cryptosystem
- New generalized secret-sharing schemes with points on a hyperplane using a Wronskian matrix
- Two secret sharing schemes based on Boolean operations
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
- A new digital signature scheme based on chaotic maps
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Chaos synchronization for a class of discrete dynamical systems on the \(N\)-dimensional torus
- Counting functions and expected values for the lattice profile at \(n\)
- The expectation and variance of the joint linear complexity of random periodic multisequences
- Combinational constructions of splitting authentication codes with perfect secrecy
- Improving bounds for the number of correlation immune Boolean functions
- An attack on a recursive authentication protocol. A cautionary tale
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Linear complexity of the Naor-Reingold pseudo-random function
- scientific article; zbMATH DE number 5832958 (Why is no real title available?)
- Hardware optimizations of stream cipher Rabbit
- scientific article; zbMATH DE number 3875137 (Why is no real title available?)
- Generalized Joint Linear Complexity of Linear Recurring Multisequences
- scientific article; zbMATH DE number 4041784 (Why is no real title available?)
- scientific article; zbMATH DE number 52377 (Why is no real title available?)
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
- The independence of two randomness properties of sequences over finite fields
- One-time pad as a nonlinear dynamical system
- Linear span analysis of a set of periodic sequence generators
- Authentication codes: an area where coding and cryptology meet
- Linear algebra approach to secret sharing schemes
- On nonlinear filter generators
- Fast message authentication using efficient polynomial evaluation
- Predicting nonlinear pseudorandom number generators
- Encyclopedia of Cryptography and Security
- scientific article; zbMATH DE number 810755 (Why is no real title available?)
- scientific article; zbMATH DE number 813995 (Why is no real title available?)
- Integer algorithms in cryptology and information assurance
- Randomness measures related to subset occurrence
- Multisequences with almost perfect linear complexity profile and function fields over finite fields
- Use of chaotic dynamical systems in cryptography
- An efficient algorithm to generate binary sequences for cryptographic purposes
- Broadcast authentication for group communication
- 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
- Construction of sequences with high nonlinear complexity from a generalization of the Hermitian function field
- Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity
- New bound for affine resolvable designs and its application to authentication codes
- Fixed points of the subset sum pseudorandom number generators
- Analysis, Cryptography and Information Science
- Cryptographic protocols and voting
- A generalization of the formulas for intersection numbers of dual polar association schemes and their applications
- Singular linear space and its applications
- A faster cryptanalysis of the self-shrinking generator
- Linear secret sharing schemes and rearrangements of access structures
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Modelling nonlinear sequence generators in terms of linear cellular automata
- On the linear complexity of Sidel'nikov sequences over nonprime fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004196)
