Publication:4312125

Publication date: 6 November 1994

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

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory

11A51: Factorization; primality

94-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory

Related Items

On finding Fermat’s pairs, A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography, Private key agreement and secure communication for heterogeneous sensor networks, A traceable proxy multisignature scheme based on the elliptic curve cryptosystem, Hardware implementation of finite-field division, A mathematical framework for the semantics of symbolic languages representing periodic time, Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring, The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups, A method for distorting the frequency of character occurrence in the simple substitution cipher, An efficient undeniable group-oriented signature scheme, Fast group operations on elliptic curves in Maple, Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\)., On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree, Safer parameters for the Chor-Rivest cryptosystem, Performance of algebraic graphs based stream-ciphers using large finite fields, Rational points on elliptic curves \(y^2=x^3+a^3\) in \(\mathbb F_p\) where \(p\equiv 1\pmod 6\) is prime, Speeding up exponentiation using an untrusted computational resource, On small world semiplanes with generalised Schubert cells, Sufficient conditions for factoring a class of large integers, The operation of the elliptic curve cryptology in IPv6, An efficient ECDSA-based signature scheme for wireless networks, Generation of pseudorandom sequence over elliptic curve group and their properties, Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions, Factoring and Testing Primes in Small Space