scientific article; zbMATH DE number 682387

Publication date: 6 November 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

elliptic curves cryptography zero-knowledge proofs threshold schemes public key cryptography oblivious transfer factoring hash functions primality testing knapsack cryptosystem probabilistic encryption digital signature standard quadratic sieve factoring method

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization; primality (11A51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Related Items (65)

Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\) ⋮ An efficient ECDSA-based signature scheme for wireless networks ⋮ A new undeniable signature scheme on general linear group over group ring ⋮ Group ring based public key cryptosystems ⋮ Primes in quadratic unique factorization domains ⋮ Unnamed Item ⋮ A type of public cryptosystem using polynomials and pell sequences ⋮ Hardware implementation of finite-field division ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ Almost all hyperharmonic numbers are not integers ⋮ On small world semiplanes with generalised Schubert cells ⋮ Safer parameters for the Chor-Rivest cryptosystem ⋮ A Public Key Cryptosystem Using Hiil's Cipher ⋮ A mathematical framework for the semantics of symbolic languages representing periodic time ⋮ SOME ARITHMETICAL PROPERTIES ON HYPERBOLA ⋮ Computational Number Theory and Cryptography ⋮ Matrix-Product Constructions for Hermitian Self-Orthogonal Codes ⋮ Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring ⋮ Pseudorandom bit sequence generator for stream cipher based on elliptic curves ⋮ Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes ⋮ Unnamed Item ⋮ GENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOL ⋮ Cryptanalysis of a combinatorial public key cryptosystem ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Periodic Orbits of Planar Integrable Birational Maps ⋮ Proof the Skewes' number is not an integer using lattice points and tangent line ⋮ A survey of some applications of finite fields ⋮ On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree ⋮ Lateral Movement in Undergraduate Research: Case Studies in Number Theory ⋮ Performance of algebraic graphs based stream-ciphers using large finite fields ⋮ Generation of pseudorandom sequence over elliptic curve group and their properties ⋮ HOW A NONASSOCIATIVE ALGEBRA REFLECTS THE PROPERTIES OF A SKEW POLYNOMIAL ⋮ Factorization with a logarithmic energy spectrum ⋮ Evaluation codes and their basic parameters ⋮ Encode-then-Encrypt: A Novel Framework for Reliable and Secure Communication ⋮ Private key agreement and secure communication for heterogeneous sensor networks ⋮ Hankel determinant solution for elliptic sequence ⋮ The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups ⋮ A SEMANTICALLY SECURE PUBLIC-KEY CRYPTOSYSTEM BASED ON RSA ⋮ Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions ⋮ Undeniable signature scheme based over group ring ⋮ A method for distorting the frequency of character occurrence in the simple substitution cipher ⋮ Coset intersection of irreducible plane cubics ⋮ A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices ⋮ Rational points on elliptic curves \(y^2=x^3+a^3\) in \(\mathbb F_p\) where \(p\equiv 1\pmod 6\) is prime ⋮ On finding Fermat’s pairs ⋮ A traceable proxy multisignature scheme based on the elliptic curve cryptosystem ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ On the representation of the number of integral points of an elliptic curve modulo a prime number ⋮ Factoring and Testing Primes in Small Space ⋮ An efficient undeniable group-oriented signature scheme ⋮ A key exchange protocol using matrices over group ring ⋮ Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings ⋮ A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography ⋮ Sufficient conditions for factoring a class of large integers ⋮ The operation of the elliptic curve cryptology in IPv6 ⋮ Fast group operations on elliptic curves in Maple ⋮ Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) ⋮ Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). ⋮ Some application of difference equations in Cryptography and Coding Theory ⋮ Unnamed Item ⋮ Application of commutative rings with unity for construction of symmetric encryption system ⋮ Number-theoretical methods of factoring composite numbers and calculating the discrete logarithm ⋮ Symmetric information exchange system based on ring isomorphism ⋮ Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu)

This page was built for publication: