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
• One-way hash function construction based on 2D coupled map lattices
• Quantum computation and quantum information
• DiscreteZOO: a fingerprint database of discrete objects
• A new cryptosystem using generalized Mersenne primes
• The mathematical art of concentrating information
• Attacks on quantum key distribution protocols that employ non-ITS authentication
• Breaking RSA may be as difficult as factoring
• A novel color image encryption algorithm based on spatial permutation and quantum chaotic map
• Quantum key agreement against collective decoherence
• On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
• On various nonlinearity measures for Boolean functions
• Construction of a class of quantum Boolean functions based on the Hadamard matrix
• Walsh transforms and cryptographic applications in bias computing
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
• On the typical values of the cross-correlation measure
• Security Analysis of the Strong Diffie-Hellman Problem
• Bug Attacks
• Finding Preimages in Full MD5 Faster Than Exhaustive Search
• Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others
• Preimage Attacks on One-Block MD4, 63-Step MD5 and More
• Some lattice attacks on DSA and ECDSA
• Title not available (Why is that?)
• On modes of operations of a block cipher for authentication and authenticated encryption
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Cryptanalysis of an E0-like combiner with memory
• Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers
• Secure proxy signature schemes for delegation of signing rights
• How to construct efficient signcryption schemes on elliptic curves
• New lattice attacks on DSA schemes
• Linear complexity of the Naor-Reingold pseudo-random function
• Title not available (Why is that?)
• Highly nonlinear mappings
• A new look at the classical key exchange system based on amplified Johnson noise
• Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations
• The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
• Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers
• Practical cryptanalysis of ISO 9796-2 and EMV signatures
• On the correlation of binary sequences
• Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
• Title not available (Why is that?)
• Secure two-party computation via cut-and-choose oblivious transfer
• Bug attacks

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)