scientific article; zbMATH DE number 954401

zbMATH Open0868.94001MaRDI QIDQ4718481FDOQ4718481

Authors: Scott A. Vanstone, Alfred Menezes, P. C. Van Oorschot 

Publication date: 8 December 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 774344
• Understanding Cryptography
• Fundamentals of cryptology. A professional reference and interactive tutorial. Incl. 1 CD-ROM

zbMATH Keywords

identificationauthenticationcryptographydigital signatureshash functionspseudorandom sequencesstream ciphersblock ciphersprimality testingkey managementpublic key systemsmulti-precision integer arithmetic

Mathematics Subject Classification ID

Cryptography (94A60) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)

Cited In (only showing first 100 items - show all)

• Finding shortest lattice vectors faster using quantum search
• An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
• How to Fill Up Merkle-Damgård Hash Functions
• Improvements to quantum search techniques for block-ciphers, with applications to AES
• On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
• Optimal strong primes
• A simple model of secure public communication
• A novel image-hiding scheme based on block difference
• Jebelean-Weber's algorithm without spurious factors
• Large decryption exponents in RSA
• Brute force attacks on hash functions
• CCA-secure inner-product functional encryption from projective hash functions
• Quantum reversible circuit of AES-128
• Efficient software-implementation of finite fields with applications to cryptography
• On the use of cellular automata in symmetric cryptography
• Multi-key security: the Even-Mansour construction revisited
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• 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
• A key exchange protocol using matrices over group ring
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• Inequalities in Statistics and Information Measures
• Exploring confusion in product ciphers through regression analysis
• Synthesis of cryptographic interleaved sequences by means of linear cellular automata
• An efficient algorithm to generate binary sequences for cryptographic purposes
• Generalized hyper-bent functions over \(GF(p)\)
• On the cryptanalysis of two cryptographic algorithms that utilize chaotic neural networks
• Guest editorial: Special issue in honor of Scott A. Vanstone
• Power map permutations and the discrete log problem
• The random oracle model: a twenty-year retrospective
• A generic framework for anonymous authentication in mobile networks
• The twin Diffie-Hellman problem and applications
• Pursuit and synchronization in hydrodynamic dipoles
• Secure distributed constraint satisfaction: reaching agreement without revealing private information
• A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
• Attacking triple encryption
• A construction of primitive polynomials over finite fields
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• A Commitment-Consistent Proof of a Shuffle
• Landau-Ramanujan keyed hash functions for message authentication
• Run distribution in nonlinear binary generators.
• Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)
• Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
• Analysis and design of a secure key exchange scheme
• Title not available (Why is that?)
• Partial-collision attack on the round-reduced compression function of Skein-256
• Title not available (Why is that?)
• Reversible data-hiding in encrypted images by redundant space transfer
• Implementing a chaotic cryptosystem in a 64-bit embedded system by using multiple-precision arithmetic
• Binomial representation of cryptographic binary sequences and its relation to cellular automata
• Efficient Finite Fields in the Maxima Computer Algebra System
• Concealment and its applications to authenticated encryption
• Security analysis of a password-based authentication protocol proposed to IEEE 1363
• Image encryption: generating visually meaningful encrypted images
• New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
• Quantum identification protocol with technologically bounded parties
• Asymptotic normality associated with generalized occupancy problems
• Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
• On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
• Secure and Efficient Group Key Agreements for Cluster Based Networks
• Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL
• The Twin Diffie-Hellman Problem and Applications
• A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs
• Preimage Attacks on 3, 4, and 5-Pass HAVAL
• Accelerating Pollard's rho algorithm on finite fields
• Certifying assembly with formal security proofs: the case of BBS
• Revisiting Correlation-Immunity in Filter Generators
• Critique of the related-key attack concept
• Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
• Convertible multi-authenticated encryption scheme
• Cryptanalysis of Grindahl
• Linear Cryptanalysis of Non Binary Ciphers
• Chaotic map based key agreement with/out clock synchronization
• An efficient and secure Diffie-Hellman key agreement protocol based on Chebyshev chaotic map
• A variant of digital signature algorithm
• A random encoding method for secure data communication: An extension of sequential coding
• The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
• One-time pad as a nonlinear dynamical system
• Tweakable block ciphers
• Computing elliptic curve discrete logarithms with the negation map
• Irreducible trinomials over finite fields
• Discrete logarithm problems with auxiliary inputs
• Cryptanalysis of MDC-2
• Comment on ``Quantum signature scheme with weak arbitrator
• A note on quantum related-key attacks
• Combating online in-auction fraud: clues, techniques and challenges
• Multi-recastable e-bidding game with dual-blindness
• Title not available (Why is that?)
• A verifiable multi-secret sharing scheme based on cellular automata
• A simple variant of the Merkle-Damgård scheme with a permutation
• Computing discrete logarithms with the parallelized kangaroo method.
• From orthogonal projections to a generalized quantum search
• A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography
• Cryptography using multiple one-dimensional chaotic maps
• Discrete chaotic cryptography using external key
• A secure and scalable group key exchange system
• A novel elliptic curve scalar multiplication algorithm against power analysis
• Public-key cryptography based on bounded quantum reference frames

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 Q4718481)