scientific article; zbMATH DE number 954401
From MaRDI portal
Publication:4718481
Recommendations
Cited in
(only showing first 100 items - show all)- A Scheme to Base a Hash Function on a Block Cipher
- Cryptanalysis of the public key encryption based on multiple chaotic systems
- Collision analysis of one kind of chaos-based hash function
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
- Chaos synchronization for a class of discrete dynamical systems on the \(N\)-dimensional torus
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Unlinkable Randomizable Signature and Its Application in Group Signature
- Quantum computation and quantum information
- Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
- Quantum identification protocol with technologically bounded parties
- 3D: A Three-Dimensional Block Cipher
- One-way hash function construction based on 2D coupled map lattices
- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- Post-quantum no-key protocol
- Asymptotic normality associated with generalized occupancy problems
- Solving discrete logarithm problems faster with the aid of pre-computation
- Cryptanalysis of and improvement on the Hwang-Chen multi-proxy multi-signature schemes
- Finding shortest lattice vectors faster using quantum search
- An efficient and robust image encryption scheme for medical applications
- Secrets of linear feedback shift registers
- Unbiased quantum random number generation based on squeezed vacuum state
- On Random Number Generation for Kernel Applications
- New Constructions for Secure Hash Functions
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- A generic solution to realize public verifiability of signcryption
- An efficient ECDSA-based signature scheme for wireless networks
- Public key cryptography based on ergodic matrices over finite field
- Efficient generation of shortest addition-multiplication chains
- An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- A new type of attacks on block ciphers
- Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences
- DiscreteZOO: a fingerprint database of discrete objects
- On the security of a spatiotemporal chaotic cryptosystem
- Divisible On-Line/Off-Line Signatures
- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
- An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
- A new cryptosystem using generalized Mersenne primes
- Polyadic integer numbers and finite (m,n)-fields
- The mathematical art of concentrating information
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- Companion matrix and recognition of primitive polynomial
- Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
- Breaking RSA may be as difficult as factoring
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- On a generalization of addition chains: addition-multiplication chains
- Algebraic attacks on grain-like keystream generators
- Cryptographic one-way function based on boson sampling
- 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 novel color image encryption algorithm based on spatial permutation and quantum chaotic map
- Lifting and Elliptic Curve Discrete Logarithms
- The challenging problem of industrial applications of multicore-generated iterates of nonlinear mappings
- Cryptography in C and C++. Transl. from the German by David Kramer. Incl. 1 CD-ROM.
- On the uniformity of distribution of the elliptic curve ElGamal signature.
- How to Fill Up Merkle-Damgård Hash Functions
- One private-key for all DL-based cryptosystems
- The GN-authenticated key agreement
- Efficient proxy signature schemes using self-certified public keys
- An efficient certificateless multi-receiver threshold decryption scheme
- Some observations on the theory of cryptographic hash functions
- Computation of edit probabilities and edit distances for the A5-type keystream generator
- Deterministic secure quantum communication against collective noise
- A construction of a key exchange protocol
- Reduced Complexity Attacks on the Alternating Step Generator
- A probabilistic cryptanalytic method for a time-variant permutation generator
- A comparison of two approaches to pseudorandomness
- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Tropical cryptography II: Extensions by homomorphisms
- Hardware optimizations of stream cipher Rabbit
- Hardened bloom filters, with an application to unobservability
- Flatness and structural analysis as a constructive framework for private communication
- 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
- Quantum key agreement against collective decoherence
- 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 Integrated ECC-MAC Based on RS Code
- Correlation (Fast) Attack against Nonlinear Combination Generator
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
- A low-complexity LUT-based squaring algorithm
- On the number of sparse RSA exponents
- Provably secure arbitrated-quantum signature
- Keyed/Unkeyed SHA-2
- Security of a key agreement protocol based on chaotic maps
- A hidden number problem in small subgroups
- Byzantine-resilient distributed state estimation: a min-switching approach
- Public-key quantum digital signature scheme with one-time pad private-key
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
- A simple model of secure public communication
- 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
- Quantum computation and cryptography: An overview
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)
