The following pages link to (Q4718481):
Displaying 50 items.
- Quantum computation and quantum information (Q252779) (← links)
- A new cryptosystem using generalized Mersenne primes (Q258874) (← links)
- The mathematical art of concentrating information (Q262598) (← links)
- Attacks on quantum key distribution protocols that employ non-ITS authentication (Q265393) (← links)
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields (Q268465) (← links)
- Breaking RSA may be as difficult as factoring (Q271594) (← links)
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- Walsh transforms and cryptographic applications in bias computing (Q276565) (← links)
- Construction of a class of quantum Boolean functions based on the Hadamard matrix (Q277083) (← links)
- On the typical values of the cross-correlation measure (Q284078) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers (Q290791) (← links)
- How to construct efficient signcryption schemes on elliptic curves (Q293455) (← links)
- New lattice attacks on DSA schemes (Q293717) (← links)
- Linear complexity of the Naor-Reingold pseudo-random function (Q294859) (← links)
- On modes of operations of a block cipher for authentication and authenticated encryption (Q301626) (← links)
- Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers (Q310312) (← links)
- Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
- New second-preimage attacks on hash functions (Q321303) (← links)
- Bug attacks (Q321310) (← links)
- A structure-based chaotic hashing scheme (Q327795) (← links)
- A novel color image encryption algorithm based on spatial permutation and quantum chaotic map (Q327882) (← links)
- Pseudo-random bit generator based on multi-modal maps (Q331010) (← links)
- Bit-oriented quantum public-key encryption based on quantum perfect encryption (Q331901) (← links)
- A novel method of S-box design based on chaotic map and composition method (Q336208) (← links)
- Compositions of linear functions and applications to hashing (Q338839) (← links)
- Modelling the shrinking generator in terms of linear CA (Q340171) (← links)
- Public key protocols over the ring \(E_{p}^{(m)}\) (Q340183) (← links)
- A provably secure non-iterative hash function resisting birthday attack (Q344781) (← links)
- Improved Markov chain Monte Carlo method for cryptanalysis substitution-transposition cipher (Q350295) (← links)
- Improved multi-pass fast correlation attacks with applications (Q350926) (← links)
- A chaotic maps-based authenticated key agreement protocol with strong anonymity (Q355005) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- A comparison of cryptanalytic tradeoff algorithms (Q380959) (← links)
- Signal-flow-based analysis of wireless security protocols (Q385716) (← links)
- On the linear complexity of binary lattices (Q386502) (← links)
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions (Q396606) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0 (Q411481) (← links)
- On the power generator and its multivariate analogue (Q413475) (← links)
- An improved two-party identity-based authenticated key agreement protocol using pairings (Q414861) (← links)
- Parallel modular exponentiation using load balancing without precomputation (Q414922) (← links)
- A suite of algorithms for key distribution and authentication in centralized secure multicast environments (Q415239) (← links)
- A new identity based encryption (IBE) scheme using extended Chebyshev polynomial over finite fields \(Z_p\) (Q418620) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Security of message authentication codes in the presence of key-dependent messages (Q420612) (← links)
- Pseudorandom number generators based on random covers for finite groups (Q420634) (← links)
- Secure proxy signature schemes for delegation of signing rights (Q421030) (← links)
- Keyed hash function based on a chaotic map (Q425540) (← links)
- Some lattice attacks on DSA and ECDSA (Q429782) (← links)
