scientific article; zbMATH DE number 2221909
From MaRDI portal
Publication:5702555
zbMath1085.94001MaRDI QIDQ5702555
Publication date: 2 November 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (50)
Pairing-based cryptography on elliptic curves ⋮ Design of image cipher using Latin squares ⋮ A DSA-like digital signature protocol ⋮ Cryptography using generalized Fibonacci matrices with Affine-Hill cipher ⋮ Basics of Secrecy Coding ⋮ Quantum ramp secret sharing scheme and quantum operations ⋮ Prêt à voter with Paillier encryption ⋮ Insecure primitive elements in an ElGamal signature protocol ⋮ Unnamed Item ⋮ Theoretically extensible quantum digital signature with starlike cluster states ⋮ Linear Cryptanalysis of the PP-1 and PP-2 Block Ciphers ⋮ On the relationships between perfect nonlinear functions and universal hash families ⋮ Perfect hash families of strength three with three rows from varieties on finite projective geometries ⋮ Ideal ramp schemes and related combinatorial objects ⋮ Classical access structures of ramp secret sharing based on quantum stabilizer codes ⋮ On the security of Y-00 under fast correlation and other attacks on the key ⋮ An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels ⋮ Combinatorial repairability for threshold schemes ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test ⋮ DEFAULT: cipher level resistance against differential fault attack ⋮ A Critical Analysis and Improvement of AACS Drive-Host Authentication ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Shrinking generators based on \(\sigma \)-LFSRs ⋮ RFID authentication efficient proactive information security within computational security ⋮ Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets ⋮ A Chaotic Circuit for Producing Gaussian Random Numbers ⋮ A survey of some applications of finite fields ⋮ Ramp scheme based on CRT for polynomial ring over finite field ⋮ A verifiable secret sharing scheme using non-abelian groups ⋮ Unnamed Item ⋮ Sleeping on the job: energy-efficient and robust broadcast for radio networks ⋮ Unnamed Item ⋮ Image encryption using the chaotic Josephus matrix ⋮ From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ Observing biases in the state: case studies with Trivium and Trivia-SC ⋮ Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs ⋮ A fast parallel sparse polynomial GCD algorithm ⋮ The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects ⋮ Quantum strongly secure ramp secret sharing ⋮ Three-level secret sharing schemes from the twisted cubic ⋮ Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures ⋮ A steganographic method based on tetris games ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ Cryptanalysis and improvement of a reversible data-hiding scheme in encrypted images by redundant space transfer ⋮ When lagged Fibonacci generators jump ⋮ Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes ⋮ A new cryptosystem based on a twisted Hessian curve \(H^4_{a,d}\) ⋮ On Solving a Generalized Chinese Remainder Theorem in the Presence of Remainder Errors ⋮ Little extension of Euler's criterion for quadratic residue ⋮ A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups II
This page was built for publication:
