scientific article; zbMATH DE number 954401
From MaRDI portal
Publication:4718481
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
identificationauthenticationcryptographydigital signatureshash functionspseudorandom sequencesstream ciphersblock ciphersprimality testingkey managementpublic key systemsmulti-precision integer arithmetic
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)
- 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
- New second-preimage attacks on hash functions
- A structure-based chaotic hashing scheme
- On the security of RSA with primes sharing least-significant bits
- Keyed hash function based on a chaotic map
- Quantum permutation pad for universal quantum-safe cryptography
- A novel image encryption algorithm based on a 3D chaotic map
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
- Security analysis of randomize-hash-then-sign digital signatures
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Timing-sensitive information flow analysis for synchronous systems
- Chaotic keyed hash function based on feedforward-feedback nonlinear digital filter
- Hash function based on piecewise nonlinear chaotic map
- ERINDALE: A Polynomial Based Hashing Algorithm
- An anonymous key agreement protocol based on chaotic maps
- Parallel keyed hash function construction based on chaotic maps
- Parallel hash function construction based on coupled map lattices
- An improved key agreement protocol based on chaos
- Zero-knowledge argument for simultaneous discrete logarithms
- On the nonlinearity of maximum-length NFSR feedbacks
- Statistical properties and implementation of aperiodic pseudorandom number generators
- On the linear complexity profile of some new explicit inversive pseudorandom numbers
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- A new post-quantum voting protocol based on physical laws
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
- Lessons learnt from the cryptanalysis of chaos-based ciphers
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- Design of secure digital communication systems using chaotic modulation, cryptography and chaotic synchronization
- Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Anonymity and one-way authentication in key exchange protocols
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Technology for translating combinatorial problems into Boolean equations
- A block cipher based on a suitable use of the chaotic standard map
- Cryptanalysis of ISO/IEC 9796-1
- Cryptanalysis of the public key encryption based on multiple chaotic systems
- Collision analysis of one kind of chaos-based hash function
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
- Polyadic integer numbers and finite \((m,n)\)-fields
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- Flatness and structural analysis as a constructive framework for private communication
- Digital image scrambling based on a new one-dimensional coupled sine map
- Secure and efficient quantum designated verifier signature scheme
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Safer parameters for the Chor-Rivest cryptosystem
- Security weaknesses of a signature scheme and authenticated key agreement protocols
- Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
- Preventing scaling of successful attacks: a cross-layer security architecture for resource-constrained platforms
- Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
- Improving two novel three-party encrypted key exchange protocols with perfect forward secrecy
- Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs
- Quantum binary search algorithm
- An efficient algorithm for software generation of binary linear recurrences
- Identity oriented signature scheme based on quadratic residues
- Cryptanalysis of a classical chaos-based cryptosystem with some quantum cryptography features
- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
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)
