scientific article; zbMATH DE number 954401
From MaRDI portal
Publication:4718481
zbMath0868.94001MaRDI QIDQ4718481
Scott A. Vanstone, Alfred J. Menezes, Paul C. van Oorschot
Publication date: 8 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
identificationcryptographystream ciphersblock ciphersauthenticationdigital signatureshash functionspseudorandom sequencesprimality testingkey managementpublic key systemsmulti-precision integer arithmetic
Cryptography (94A60) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)
Related Items (only showing first 100 items - show all)
Security analysis of a password-based authentication protocol proposed to IEEE 1363 ⋮ On linear complexity of sequences over \(\text{GF}(2^n)\) ⋮ Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator ⋮ Improvements to quantum search techniques for block-ciphers, with applications to AES ⋮ Selling multiple secrets to a single buyer ⋮ On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA ⋮ Optimal strong primes ⋮ A simple model of secure public communication ⋮ Jebelean-Weber's algorithm without spurious factors ⋮ On the use of cellular automata in symmetric cryptography ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Efficient software-implementation of finite fields with applications to cryptography ⋮ Polynomial basis multiplication over \(\text{GF}(2^m)\) ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) ⋮ Studying the performance of artificial neural networks on problems related to cryptography ⋮ Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers ⋮ An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques ⋮ Permutation and sampling with maximum length CA or pseudorandom number generation ⋮ Generalized hyper-bent functions over \(GF(p)\) ⋮ Exploring confusion in product ciphers through regression analysis ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Finding shortest lattice vectors faster using quantum search ⋮ The random oracle model: a twenty-year retrospective ⋮ Open problems in hash function security ⋮ Power map permutations and the discrete log problem ⋮ Attacks on a double length blockcipher-based hash proposal ⋮ Breaking an ID-based encryption based on discrete logarithm and factorization problems ⋮ An improvement of a cryptanalysis algorithm ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ Statistical properties and implementation of aperiodic pseudorandom number generators ⋮ Random small Hamming weight products with applications to cryptography ⋮ Computing discrete logarithms with the parallelized kangaroo method. ⋮ Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations. ⋮ Multi-party key agreement protocols with cheater identification ⋮ Improved low-computation partially blind signatures. ⋮ Improved authenticated multiple-key agreement protocol without using conventional one-way function. ⋮ A practical anonymous multi-authority e-cash scheme. ⋮ Modelling nonlinear sequence generators in terms of linear cellular automata ⋮ Large decryption exponents in RSA ⋮ Multiparty authentication services and key agreement protocols with semi-trusted third party. ⋮ Error-correcting codes and cryptography ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ Security of a key agreement protocol based on chaotic maps ⋮ Steganalytic method based on short and repeated sequence distance statistics ⋮ A multisecret sharing scheme for color images based on cellular automata ⋮ Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\) ⋮ A low-complexity LUT-based squaring algorithm ⋮ Multi-party authenticated key agreement protocols from multi-linear forms ⋮ The generalized XOR lemma ⋮ A secure scheme to share secret color images ⋮ Chaotic map based key agreement with/out clock synchronization ⋮ Novel orbit based symmetric cryptosystems ⋮ Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations ⋮ Parallel keyed hash function construction based on chaotic maps ⋮ An anonymous key agreement protocol based on chaotic maps ⋮ An efficient and secure Diffie-Hellman key agreement protocol based on Chebyshev chaotic map ⋮ Parallel hash function construction based on coupled map lattices ⋮ Asymptotic granularity reduction and its application ⋮ An improved key agreement protocol based on chaos ⋮ A verifiable multi-secret sharing scheme based on cellular automata ⋮ Problems of cryptography as discrete optimization tasks ⋮ Asymptotically optimal perfect steganographic systems ⋮ Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces ⋮ Synthesis of cryptographic interleaved sequences by means of linear cellular automata ⋮ Group theoretic properties of Rijndael-like ciphers ⋮ A non-interactive deniable authentication scheme based on designated verifier proofs ⋮ Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS ⋮ The trace of an optimal normal element and low complexity normal bases ⋮ Efficient \(p\)th root computations in finite fields of characteristic \(p\) ⋮ A variant of digital signature algorithm ⋮ Montgomery exponent architecture based on programmable cellular automata ⋮ The linear complexity of generalized cyclotomic sequences with period \(2p^n\) ⋮ A generic framework for anonymous authentication in mobile networks ⋮ Pursuit and synchronization in hydrodynamic dipoles ⋮ Decrypting classical cipher text using Markov chain Monte Carlo ⋮ New algorithms and protocols for information authentication in automatic control systems ⋮ Cryptanalysis of an E0-like combiner with memory ⋮ Security proofs for identity-based identification and signature schemes ⋮ On the impossibility of highly-efficient blockcipher-based hash functions ⋮ On the security of cryptosystem using automorphism groups ⋮ Collisions for variants of the BLAKE hash function ⋮ An overview of distinguishing attacks on stream ciphers ⋮ The twin Diffie-Hellman problem and applications ⋮ High-performance hardware of the sliding-window method for parallel computation of modular exponentiations ⋮ Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization ⋮ Information authentication in automated control systems based on finite groups with multidimensional cyclicity ⋮ A secure and scalable group key exchange system ⋮ Reversible data-hiding in encrypted images by redundant space transfer ⋮ Improvement in new three-party-authenticated key agreement scheme based on chaotic maps without password table ⋮ Implementing a chaotic cryptosystem in a 64-bit embedded system by using multiple-precision arithmetic ⋮ Self-certified multi-proxy signature schemes with message recovery ⋮ Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme ⋮ An application of index forms in cryptography ⋮ Computation of edit probabilities and edit distances for the A5-type keystream generator ⋮ A probabilistic cryptanalytic method for a time-variant permutation generator ⋮ A fast correlation attack on LILI-128 ⋮ A comparison of two approaches to pseudorandomness ⋮ The design of a secure and fair sealed-bid auction service ⋮ On the distribution of the Diffie-Hellman pairs
This page was built for publication:
