Zobrazeno 1 - 10
of 104
pro vyhledávání: '"Duncan A. Buell"'
Autor:
Duncan A. Buell, Richard H. Hudson
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 9, Iss 2, Pp 261-266 (1986)
Using A. Well's estimates the authors have given bounds for the largest prime P0 such that all primes p>P0 have sequences of quadratic residues of length m. For m≤8 the smallest prime having m consecutive quadratic residues is ≡3(mod4) and P0≡1
Externí odkaz:
https://doaj.org/article/30b9aa20faa6488a92baab7797cd8837
Publikováno v:
IEEE Transactions on Professional Communication. 66:94-113
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::603233506a6bc9d7c522fc3b42353bb5
https://doi.org/10.1109/tpc.2022.3228026
https://doi.org/10.1109/tpc.2022.3228026
Autor:
Heidi Rae Cooley, Duncan A. Buell
Publikováno v:
Interactive Film and Media Journal. 1:5-18
Ghosts of the Horseshoe and Ward One are critical interactive applications that offer two distinct yet complementary examples for how questions such as the ones just posed might be addressed on-site and in real-time. In what follows, we offer an acco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2c3938d0c806d98f703e4bed2c7ce69
https://doi.org/10.32920/ifmj.v1i1.1491
https://doi.org/10.32920/ifmj.v1i1.1491
Autor:
Duncan A. Buell
Publikováno v:
The Ramanujan Journal. 59:955-965
In a recent paper, Kishi and Komatsu have shown that the complex quadratic fields of discriminant $$\begin{aligned} \Delta _{18} = 4 - 3^{18n+3} \end{aligned}$$ have a class group whose 3-Sylow subgroup is of rank at least three for all integers n. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a09a2613fbdb5c8f7fed6f5f2cc7929f
https://doi.org/10.1007/s11139-021-00525-5
https://doi.org/10.1007/s11139-021-00525-5
Autor:
Duncan A. Buell, Chris Holcomb
Publikováno v:
Composition and Big Data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83e8b0d00a524e88664d0b1d89697ce0
https://doi.org/10.2307/j.ctv22tnmg2.6
https://doi.org/10.2307/j.ctv22tnmg2.6
Autor:
Duncan A. Buell
Publikováno v:
Undergraduate Topics in Computer Science ISBN: 9783030734916
In Chap. 11 we described several factoring methods. Each will succeed in factoring some integers, but none of these is a state-of-the-art method that we would expect to succeed on a well-chosen RSA \(N = pq\). Even the best of these, CFRAC, suffers f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b0959348648c80eef0f0d8325fb05db
https://doi.org/10.1007/978-3-030-73492-3_12
https://doi.org/10.1007/978-3-030-73492-3_12
Autor:
Duncan A. Buell
Publikováno v:
Undergraduate Topics in Computer Science ISBN: 9783030734916
With the publication of Peter Shor’s seminal paper that factoring and discrete log computations would be entirely feasible on a quantum computer, and with advances in the building of quantum computers, there has been a focus on what is referred to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::203e67a1e5095a103c9e0d2452bf5083
https://doi.org/10.1007/978-3-030-73492-3_15
https://doi.org/10.1007/978-3-030-73492-3_15
Autor:
Duncan A. Buell
Publikováno v:
Undergraduate Topics in Computer Science ISBN: 9783030734916
The security of the RSA cryptosystem is based on the difficulty of factoring integers N that are the products of two large primes p and q. If p and q are chosen well, then factoring N is indeed hard, but there are also factoring methods that work ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e3d2d1c83f24c2f38b656b141d715f9
https://doi.org/10.1007/978-3-030-73492-3_11
https://doi.org/10.1007/978-3-030-73492-3_11
Autor:
Duncan A. Buell
Publikováno v:
Undergraduate Topics in Computer Science ISBN: 9783030734916
The first proposed asymmetric encryption scheme was that of Rivest, Shamir, and Adleman, using exponentiation in the group of integers modulo the product of two large primes. Koblitz and Miller independently proposed the use of the groups of points o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d364041936d5f74ea15ec4fdb4ad409b
https://doi.org/10.1007/978-3-030-73492-3_14
https://doi.org/10.1007/978-3-030-73492-3_14
Autor:
Duncan A. Buell
Publikováno v:
Undergraduate Topics in Computer Science ISBN: 9783030734916
With symmetric cryptography, it is necessary for the two parties who wish to communicate to have access to a common key so that one party can encrypt a message and the other party can decrypt the message. This would limit the ability of two parties w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0635eea1b050a95c838a75516ac77fe5
https://doi.org/10.1007/978-3-030-73492-3_13
https://doi.org/10.1007/978-3-030-73492-3_13