scientific article; zbMATH DE number 1006115
From MaRDI portal
Publication:4335813
zbMath0883.94001MaRDI QIDQ4335813
Publication date: 4 May 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (40)
Quantum bit-commitment for small storage based on quantum one-way permutations ⋮ Bisplitting an arbitrary \(N\)-qubit state with a class of asymmetric three-qubit W states ⋮ An N-D cryptoscheme ⋮ The Multics encipher_Algorithm ⋮ A Simplified IDEA Algorithm ⋮ Comments on e-mail protocols providing forward secrecy ⋮ A Modified Technique for Reliable Image Encryption Method using Merkle-Hellman Cryptosystem and Rsa Algorithm ⋮ Unnamed Item ⋮ Evolutionary ciphers against differential power analysis and differential fault analysis ⋮ Quantum secret sharing of secure direct communication using one-time pad ⋮ Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer ⋮ On min-max \(r\)-gatherings ⋮ Cryptanalysis of quantum blind signature scheme ⋮ Decidability of equivalence of symbolic derivations ⋮ A note on chaotic unimodal maps and applications ⋮ Generation of pseudorandom sequence over elliptic curve group and their properties ⋮ Applying LU decomposition of matrices to design anonymity bilateral remote user authentication scheme ⋮ Protocol completion incentive problems in cryptographic Vickrey auctions ⋮ The concept of decentralized and secure electronic marketplace ⋮ Generalization of the Self-Shrinking Generator in the Galois Field ⋮ Key exchange protocols over noncommutative rings. The case of ⋮ Identification scheme for romanized Indian languages from their plain and ciphered bit stream ⋮ On multiple transitivity for products of sets of permutations. ⋮ Proved Random Numbers Obtained from Hardware Devices ⋮ A fair and efficient solution to the socialist millionaires' problem ⋮ Agent based scientific simulation and modeling ⋮ A secure and robust hash-based scheme for image authentication ⋮ How to Fill Up Merkle-Damgård Hash Functions ⋮ Unnamed Item ⋮ On Min-Max r-Gatherings ⋮ Knowledge condition games ⋮ On a family of preimage-resistant functions ⋮ A generic framework for anonymous authentication in mobile networks ⋮ The Power of Anonymous Veto in Public Discussion ⋮ Decrypting classical cipher text using Markov chain Monte Carlo ⋮ Extended DSA ⋮ An Introduction to Security API Analysis ⋮ Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators ⋮ Faster Multicollisions ⋮ Encryption and Fragmentation for Data Confidentiality in the Cloud
This page was built for publication:
