scientific article
From MaRDI portal
Publication:4003085
zbMath0766.11001MaRDI QIDQ4003085
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmscryptologyelementary number theoryapplications of number theoryhashing functionspublic-key systemsuse of computerssplicing of telephone cables
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computing methodologies and applications (68U99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Computational number theory (11Yxx) Elementary number theory (11Axx)
Related Items (18)
An N-D cryptoscheme ⋮ Few Product Gates But Many Zeros ⋮ Key management for Pay-TV broadcast systems in hierarchy ⋮ 2is irrational ⋮ Cardinality of the Ellis semigroup on compact metric countable spaces ⋮ Signed digit data hiding scheme ⋮ Certain towers of ramified minimal ring extensions of commutative rings, II ⋮ Fibonacci order in the period-doubling cascade to chaos ⋮ Cryptanalysis of a public key system based on Diophantine equations ⋮ On the commutative rings with at most two proper subrings ⋮ Why the nth-root function is not a rational function ⋮ A minimal ring extension of a large finite local prime ring is probably ramified ⋮ Consensus networks with time-delays over finite fields ⋮ Conway topograph, -dynamics and two-valued groups ⋮ Cryptanalysis of and improvement on the Hwang-Chen multi-proxy multi-signature schemes ⋮ A note on factors of generalized Fermat numbers ⋮ A traceable group signature scheme. ⋮ The coincidence site lattices in 2D hexagonal lattices using Clifford algebra
This page was built for publication:
