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
• An efficient and robust image encryption scheme for medical applications
• Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
• A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Some observations on the theory of cryptographic hash functions
• A hidden number problem in small subgroups
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0
• Security of a key agreement protocol based on chaotic maps
• An identity-based encryption scheme with compact ciphertexts
• On the power generator and its multivariate analogue
• An improved two-party identity-based authenticated key agreement protocol using pairings
• Parallel modular exponentiation using load balancing without precomputation
• A suite of algorithms for key distribution and authentication in centralized secure multicast environments
• A new identity based encryption (IBE) scheme using extended Chebyshev polynomial over finite fields \(Z_p\)
• Pseudorandom number generators based on random covers for finite groups
• Security of message authentication codes in the presence of key-dependent messages
• Security proofs for identity-based identification and signature schemes
• On linear complexity of sequences over \(\text{GF}(2^n)\)
• Using Semidirect Product of (Semi)groups in Public Key Cryptography
• On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
• The cost of false alarms in Hellman and rainbow tradeoffs
• A construction ofp-ary balanced sequence with largek-error linear complexity
• Pseudo-Random Bit Generation Based on 2D Chaotic Maps of Logistic Type and Its Applications in Chaotic Cryptography
• On random walks for Pollard's rho method
• Sanitizable signatures
• True random number generation from bioelectrical and physical signals
• The trace of an optimal normal element and low complexity normal bases
• High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
• Private authentication
• A simple stream cipher with proven properties
• On the distribution of the Diffie-Hellman pairs
• A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
• A revised key agreement protocol based on chaotic maps
• Hierarchical combination of intruder theories
• Secure communication systems based on the synchronization of chaotic systems
• Quantum proxy signature with provable security
• RFID authentication efficient proactive information security within computational security
• A family of elliptic curve pseudorandom binary sequences
• Title not available (Why is that?)
• Pseudo-random bit generator based on multi-modal maps
• Bit-oriented quantum public-key encryption based on quantum perfect encryption
• A novel method of S-box design based on chaotic map and composition method

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)