scientific article; zbMATH DE number 954401
From MaRDI portal
Publication:4718481
Recommendations
Cited in
(only showing first 100 items - show all)- An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
- Landau-Ramanujan keyed hash functions for message authentication
- Inequalities in Statistics and Information Measures
- Run distribution in nonlinear binary generators.
- Efficient Finite Fields in the Maxima Computer Algebra System
- Guest editorial: Special issue in honor of Scott A. Vanstone
- Power map permutations and the discrete log problem
- Secure distributed constraint satisfaction: reaching agreement without revealing private information
- The random oracle model: a twenty-year retrospective
- Attacking triple encryption
- Large decryption exponents in RSA
- Improvements to quantum search techniques for block-ciphers, with applications to AES
- scientific article; zbMATH DE number 3957197 (Why is no real title available?)
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
- Optimal strong primes
- Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
- A construction of primitive polynomials over finite fields
- CCA-secure inner-product functional encryption from projective hash functions
- Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)
- Quantum reversible circuit of AES-128
- 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
- Exploring confusion in product ciphers through regression analysis
- Generalized hyper-bent functions over \(GF(p)\)
- Synthesis of cryptographic interleaved sequences by means of linear cellular automata
- A generic framework for anonymous authentication in mobile networks
- Security analysis of a password-based authentication protocol proposed to IEEE 1363
- The twin Diffie-Hellman problem and applications
- Pursuit and synchronization in hydrodynamic dipoles
- Analysis and design of a secure key exchange scheme
- Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
- Efficient software-implementation of finite fields with applications to cryptography
- On the use of cellular automata in symmetric cryptography
- scientific article; zbMATH DE number 177272 (Why is no real title available?)
- Image encryption: generating visually meaningful encrypted images
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\)
- A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
- Brute force attacks on hash functions
- On the cryptanalysis of two cryptographic algorithms that utilize chaotic neural networks
- Studying the performance of artificial neural networks on problems related to cryptography
- A key exchange protocol using matrices over group ring
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Partial-collision attack on the round-reduced compression function of Skein-256
- Binomial representation of cryptographic binary sequences and its relation to cellular automata
- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- A novel image-hiding scheme based on block difference
- Jebelean-Weber's algorithm without spurious factors
- A Commitment-Consistent Proof of a Shuffle
- Concealment and its applications to authenticated encryption
- An efficient algorithm to generate binary sequences for cryptographic purposes
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
- Multi-key security: the Even-Mansour construction revisited
- Finding shortest lattice vectors faster using quantum search
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- A simple model of secure public communication
- How to Fill Up Merkle-Damgård Hash Functions
- Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces
- Information authentication in automated control systems based on finite groups with multidimensional cyclicity
- Distinguishing Multiplications from Squaring Operations
- Attack on a concast signature scheme
- Modular exponentiation via the explicit Chinese remainder theorem
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
- New algorithms and protocols for information authentication in automatic control systems
- Formal analysis of security protocols for wireless sensor networks
- On the probability of generating a lattice
- Secrets of linear feedback shift registers
- Attacks on a double length blockcipher-based hash proposal
- Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
- Multiparty authentication services and key agreement protocols with semi-trusted third party.
- Self-certified multi-proxy signature schemes with message recovery
- An application of index forms in cryptography
- Algorithm for factoring some RSA and Rabin moduli
- An improvement of a cryptanalysis algorithm
- A note on ``New quantum key agreement protocols based on Bell states
- Collision attack on \({\mathtt Grindahl}\)
- A self-pairing map and its applications to cryptography
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
- On the security of cryptosystem using automorphism groups
- A new non-Merkle-Damgård structural hash function with provable security
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
- Properties of certain semigroups and their potential as platforms for cryptosystems
- Computation of edit probabilities and edit distances for the A5-type keystream generator
- Cryptography and cryptographic protocols
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- Decoding interleaved Reed-Solomon codes over noisy channels
- An efficient binary sequence generator with cryptographic applications
- THE EULER TOTIENT FUNCTION ON QUADRATIC FIELDS
- On hiding messages in the oversampled Fourier coefficients
- Breaking an ID-based encryption based on discrete logarithm and factorization problems
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- A low-complexity LUT-based squaring algorithm
- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- A probabilistic cryptanalytic method for a time-variant permutation generator
- Lifting and Elliptic Curve Discrete Logarithms
- A comparison of two approaches to pseudorandomness
- Correlation (Fast) Attack against Nonlinear Combination Generator
- A deterministic algorithm for the discrete logarithm problem in a semigroup
- On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation
- Montgomery exponent architecture based on programmable cellular automata
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)
