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
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)
- New Constructions for Secure Hash Functions
- Efficient generation of shortest addition-multiplication chains
- On the security of a spatiotemporal chaotic cryptosystem
- A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- An efficient multi-round anonymous auction protocol
- Public-key quantum digital signature scheme with one-time pad private-key
- On the number of sparse RSA exponents
- Design and Analysis on a Parallel Chaos-Based Hash Function
- Self-generated-certificate public key encryption without pairing and its application
- Cryptanalysis and improvements on some graph-based authentication schemes
- Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
- Multi-party authenticated key agreement protocols from multi-linear forms
- The generalized XOR lemma
- The design of a secure and fair sealed-bid auction service
- Increasing the security of hash functions
- Secure fragile watermarking method for image authentication with improved tampering localisation and self-recovery capabilities
- Approximation of a chaotic orbit as a cryptanalytical method on Baptista's cipher
- Steganalytic method based on short and repeated sequence distance statistics
- Authenticated group key agreement protocol based on twist conjugacy problem in near-rings
- Approximations of Dynamical Systems and Their Applications to Cryptography
- Finite automata in cryptography
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- A method for symbolic analysis of security protocols
- Blind one-time signature and its applications
- A secret sharing scheme based on cellular automata
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density
- Implementation and performance evaluation of a payment protocol for vehicular ad hoc networks
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
- Asymptotically optimal perfect steganographic systems
- Cryptography with chaos and shadowing
- An analysis of the blockcipher-based hash functions from PGV
- Secure electronic bills of lading: Blind counts and digital signatures
- Polynomial representations of the Lucas logarithm
- Encyclopedia of Cryptography and Security
- Secure implementation of channel abstractions
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Provably secure Rabin-\(p\) cryptosystem in hybrid setting
- On asymptotic expansion in the random allocation of particles by sets
- A secure scheme to share secret color images
- On the impossibility of highly-efficient blockcipher-based hash functions
- Shrinking generators based on \(\sigma \)-LFSRs
- Random Gray code and its performance analysis for image hashing
- Zero-knowledge identification scheme based on Weil pairing
- Breaking an orbit-based symmetric cryptosystem
- Fault-based attack on Montgomery's ladder algorithm
- A chaotic stream cipher and the usage in video protection
- A stream cipher based on a spatiotemporal chaotic system
- Efficient \(p\)th root computations in finite fields of characteristic \(p\)
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- Memoryless near-collisions via coding theory
- The square root Diffie-Hellman problem
- Novel orbit based symmetric cryptosystems
- Koblitz curve cryptosystems
- Security risk during the transient in a key exchange protocol using random signals and feedback
- Multiple point compression on elliptic curves
- Selling multiple secrets to a single buyer
- A novel image hash algorithm resistant to print-scan
- Modification tolerant signature schemes: location and correction
- Permutation and sampling with maximum length CA or pseudorandom number generation
- 3D: A Three-Dimensional Block Cipher
- Chaos synchronization for a class of discrete dynamical systems on the \(N\)-dimensional torus
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
- Secrets of linear feedback shift registers
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- Lifting and Elliptic Curve Discrete Logarithms
- Reduced Complexity Attacks on the Alternating Step Generator
- Computation of edit probabilities and edit distances for the A5-type keystream generator
- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- Correlation (Fast) Attack against Nonlinear Combination Generator
- A probabilistic cryptanalytic method for a time-variant permutation generator
- A comparison of two approaches to pseudorandomness
- A low-complexity LUT-based squaring algorithm
- Distinguishing Multiplications from Squaring Operations
- Formal analysis of security protocols for wireless sensor networks
- Improved low-computation partially blind signatures.
- Multi-party key agreement protocols with cheater identification
- Improved authenticated multiple-key agreement protocol without using conventional one-way function.
- On the probability of generating a lattice
- Decoding interleaved Reed-Solomon codes over noisy channels
- A deterministic algorithm for the discrete logarithm problem in a semigroup
- Attack on a concast signature scheme
- Algorithm for factoring some RSA and Rabin moduli
- On hiding messages in the oversampled Fourier coefficients
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- Multiparty authentication services and key agreement protocols with semi-trusted third party.
- Cryptography and cryptographic protocols
- Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces
- New algorithms and protocols for information authentication in automatic control systems
- Montgomery exponent architecture based on programmable cellular automata
- Attacks on a double length blockcipher-based hash proposal
- An improvement of a cryptanalysis algorithm
- A self-pairing map and its applications to cryptography
- On the security of cryptosystem using automorphism groups
- Breaking an ID-based encryption based on discrete logarithm and factorization problems
- Collision attack on \({\mathtt Grindahl}\)
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
- Properties of certain semigroups and their potential as platforms for cryptosystems
- Information authentication in automated control systems based on finite groups with multidimensional cyclicity
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)