Open AccessProceedings Article
A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number.
René Peralta,Jeroen van de Graaf +1 more
- 01 Jan 1986
pp 15
60
TL;DR: A probabilistic polynomial-time algorithm for computing the square root of a number x/P Z, where P = 2 S + 1 Q + 1(Q odd, s > 0) is a prime number, is described.
read more
Abstract: A probabilistic polynomial-time algorithm for computing the square root of a number x \in {\bf Z}/P{\bf Z} , where P = 2^{S}Q + 1(Q odd, s > 0) is a prime number, is described. In contrast to the Adleman, Manders, and Miller algorithm, this algorithm gets faster as s grows. As with the Berlekamp-Rabin algorithm, the expected running time of the algorithm is independent of x . However, the algorithm presented here is considerably faster for values of s greater than 2 .
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A data mining framework for building intrusion detection models
Wenke Lee,Salvatore J. Stolfo,Kui W. Mok +2 more
- 14 May 1999
TL;DR: A data mining framework for adaptively building Intrusion Detection (ID) models is described, to utilize auditing programs to extract an extensive set of features that describe each network connection or host session, and apply data mining programs to learn rules that accurately capture the behavior of intrusions and normal activities.
•Journal Article
Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms
TL;DR: It is proved that breaking the Diffie-Hellman protocol for G and base g is equivalent to computing discrete logarithms in G to the base g when a certain side information string S is given.
201
The Diffie–Hellman Protocol
Ueli Maurer,Stefan Wolf +1 more
- 01 Mar 2000
TL;DR: This paper summarizes the present knowledge on the security of the Diffie–Hellman protocol, allowing two parties who share no secret information initially, to generate a mutual secret key.
139
Chameleon Hashing Without Key Exposure
Xiaofeng Chen,Fangguo Zhang,Kwangjo Kim +2 more
- 27 Sep 2004
TL;DR: Chameleon signatures as mentioned in this paper are based on hash-and-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest and simultaneously provide the properties of non-repudiation and non-transferability for the signed message, i.e., the designated recipient is capable of verifying the validity of the signature, but cannot disclose the contents of the signed information to convince any third party without the signer's consent.
Attacks on the HKM/HFX Cryptosystem
Xuejia Lai,Rainer A. Rueppel +1 more
- 21 Feb 1996
TL;DR: The HKM / HFX cryptosystem is proposed for standardization at the ITU Telecommunication Standardization Sector Study Group 8 and is designed to provide authenticity and confidentiality of FAX messages at a commercial level of security.
References
A data mining framework for building intrusion detection models
Wenke Lee,Salvatore J. Stolfo,Kui W. Mok +2 more
- 14 May 1999
TL;DR: A data mining framework for adaptively building Intrusion Detection (ID) models is described, to utilize auditing programs to extract an extensive set of features that describe each network connection or host session, and apply data mining programs to learn rules that accurately capture the behavior of intrusions and normal activities.
Factoring polynomials over large finite fields
TL;DR: In this paper, the authors present a deterministic procedure for factoring polynomials over finite fields, which reduces the problem of factoring an arbitrary polynomial over the Galois field GF(p m) to finding the roots in GF(m) of certain other polynomorphisms over GF (m).
Probabilistic Algorithms in Finite Fields
TL;DR: Probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynometric, and factoring aPolynomial into its irredUCible factors over a infinite field are presented.
The Diffie–Hellman Protocol
Ueli Maurer,Stefan Wolf +1 more
- 01 Mar 2000
TL;DR: This paper summarizes the present knowledge on the security of the Diffie–Hellman protocol, allowing two parties who share no secret information initially, to generate a mutual secret key.
139
Attacks on the HKM/HFX Cryptosystem
Xuejia Lai,Rainer A. Rueppel +1 more
- 21 Feb 1996
TL;DR: The HKM / HFX cryptosystem is proposed for standardization at the ITU Telecommunication Standardization Sector Study Group 8 and is designed to provide authenticity and confidentiality of FAX messages at a commercial level of security.