scientific article; zbMATH DE number 954401
From MaRDI portal
Publication:4718481
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Reduced Complexity Attacks on the Alternating Step Generator
- Error-correcting codes and cryptography
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
- 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.
- Modelling nonlinear sequence generators in terms of linear cellular automata
- On the correlation of binary sequences
- Technology for translating combinatorial problems into Boolean equations
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
- Statistical properties and implementation of aperiodic pseudorandom number generators
- Secure two-party computation via cut-and-choose oblivious transfer
- Highly nonlinear mappings
- One-way hash function construction based on 2D coupled map lattices
- 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
- Cryptanalysis of an E0-like combiner with memory
- A block cipher based on a suitable use of the chaotic standard map
- Cryptanalysis of ISO/IEC 9796-1
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
- Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers
- Security analysis of randomize-hash-then-sign digital signatures
- A new post-quantum voting protocol based on physical laws
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Short signatures without random oracles and the SDH assumption in bilinear groups
- DiscreteZOO: a fingerprint database of discrete objects
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- On the typical values of the cross-correlation measure
- Design of secure digital communication systems using chaotic modulation, cryptography and chaotic synchronization
- A novel color image encryption algorithm based on spatial permutation and quantum chaotic map
- Some lattice attacks on DSA and ECDSA
- Lessons learnt from the cryptanalysis of chaos-based ciphers
- On modes of operations of a block cipher for authentication and authenticated encryption
- Quantum key agreement against collective decoherence
- SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
- A new look at the classical key exchange system based on amplified Johnson noise
- Security Analysis of the Strong Diffie-Hellman Problem
- Anonymity and one-way authentication in key exchange protocols
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- scientific article; zbMATH DE number 54007 (Why is no real title available?)
- Bug Attacks
- Keyed hash function based on a chaotic map
- Quantum computation and quantum information
- 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
- Quantum permutation pad for universal quantum-safe cryptography
- A novel image encryption algorithm based on a 3D chaotic map
- An improved key agreement protocol based on chaos
- Timing-sensitive information flow analysis for synchronous systems
- Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
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)
