scientific article; zbMATH DE number 1759796
From MaRDI portal
Publication:4536819
zbMath0989.68508MaRDI QIDQ4536819
Publication date: 6 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Tightly secure signatures from lossy identification schemes, Bootstrapping for approximate homomorphic encryption, A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity, Indistinguishable Proofs of Work or Knowledge, Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates, Computing discrete logarithms in an interval, A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols, QUAD: A Practical Stream Cipher with Provable Security, Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms, Computing Interval Discrete Logarithm Problem with Restricted Jump Method