75 research outputs found
FIGURE 1 in Thysanoptera of Southeastern U.S.A.: A checklist for Florida and Georgia
No full textFIGURE 1. Number of thysanopteran species for which the type specimens came from the state indicated (standard abbreviations for USA state names given).Published as part of Diffie, Stan, Edwards, G. B. & Mound, Laurence A., 2008, Thysanoptera of Southeastern U.S.A.: A checklist for Florida and Georgia, pp. 45-62 in Zootaxa 1787 (1) on page 47, DOI: 10.11646/zootaxa.1787.1.3, http://zenodo.org/record/512436
Thrips of Ornamentals in the Southeastern US
No full textENY-845, a 10-page illustrated fact sheet by Joe Funderburk, Stan Diffie, Jyotsna Sharma, Amanda Hodges, and Lance Osborne, describes the common thrips associated with ornamental plants in the southeastern U.S., their biology, feeding behavior and damage, natural enemies, sampling and identification. Includes references and a key representing thrips species from three families. Published by the UF Department of Entomology and Nematology, December 2007
New Key Exchange Protocol Based on Mandelbrot and Julia Fractal Sets.
No full textIn this paper, we propose a new cryptographic key exchange
protocol based on Mandelbrot and Julia Fractal sets. The Fractal based key exchange protocol is possible because of the intrinsic connection between the Mandelbrot and Julia Fractal sets. In the proposed protocol, Mandelbrot Fractal function takes the chosen private key as the input parameter and generates the corresponding public key
Quantum Diffie-Hellman Key Exchange
No full textIn 2014, the author conceived of a quantal version of the classical cryptographic Diffie-Hellman key exchange protocol. However, the paper was declined to be published (by a not disclosed journal). No further publication attempts were made by the author. In the time afterwards, the aforementioned idea was conceived by others as well, resulting in a number of publications regarding this topic and even slight improvements. Thereby underlining the significance of the author\u27s original idea, despite of being rejected by peer reviewed journals.
The paper at hand therefore serves two purposes: First, it might serve others (especially young researchers) as an example to not feel discouraged by publication refusals, if they truly deem them as important novelties. Second, it provides an easy to understand introduction to grasp the concept of a quantum Diffie-Hellman key exchange.
All of the following paragraphs, including the remainder of this abstract, are taken from the original 2014 publication attempt and are unchanged in comparison to the 2014 original:
In this work, a quantal version of the classical cryptographic Diffie-Hellman key exchange protocol is introduced. It is called Quantum Diffie-Hellman key exchange. Unlike for the existing quantum key distribution protocols, actual quantum states, and not their measurement outcomes, are regarded as finally exchanged keys/information. By implementation of that quantal Diffie-Hellman version, both communication parties in the end are in possession of identically prepared, and secret quantum states. Thus the cryptographically important principle of forward secrecy is now available in a quantum physical framework. As a merit of the quantum setting, an improvement of the classical Diffie-Hellman protocol is also achieved, as neither of the two parties exactly know the final, exchanged states
Polynomial Interpolation of Cryptographic Functions Related to the Diffie-Hellman Problem
No full textRecently, the first author introduced some cryptographic functions closely related to the Diffie-Hellman problem called P -Diffie-Hellman functions. We show that the existence of a low degree polynomial representing a P -Diffie-Hellman function on a large set would lead to an efficient algorithm for solving the Diffie-Hellman problem. Motivated by this result we prove lower bounds on the degree of such interpolation polynomials.
Polynomial interpolation of cryptographic functions related to Diffie–Hellman and discrete logarithm problem
No full textAbstractRecently, the first author introduced some cryptographic functions closely related to the Diffie–Hellman problem called P-Diffie–Hellman functions. We show that the existence of a low-degree polynomial representing a P-Diffie–Hellman function on a large set would lead to an efficient algorithm for solving the Diffie–Hellman problem. Motivated by this result we prove lower bounds on the degree of such interpolation polynomials. Analogously, we introduce a class of functions related to the discrete logarithm and show similar reduction and interpolation results
Diffie and Hellman are exchanging matrices over group rings
No full textTitle: Diffie and Hellman are exchanging matrices over group rings Author: Romana Linkeová Department: Department of Algebra Supervisor: Mgr. Pavel Příhoda, Ph.D., Department of Algebra Abstract: The Diffie-Hellman key exchange protocol is not suitable for devices with limited computational power while computing over group Z∗ p (where p is at least a 300-digit number). This fact led to the research of other algebraic structures, which may help in reducing the computational and storage cost of the protocol. D. Kahrobaei et al. posted in 2013 a proposal for working over a structure of small matrices and claimed that this modification will not affect the security of the protocol. We will attempt to attack this modification of the Diffie- Hellman protocol with the help of the theory of symmetric group representations. Firstly, we mention the basics of the theory of representations together with both the classical and the modified Diffie-Hellman protocol. Next, we elaborate the attack step by step and complement some of the steps with examples. Then, we probed security of the modified protocol against the baby-step giant-step attack. Keywords: public key cryptography, symmetric group representations, Diffie-Hellman protocol
Insecticide Evaluation for Control of the Imported Fire Ant in Bibb County, Ga, 1993
No full textAbstract
Two broadcast baits, Amdro® and Logic®, were broadcast over respective 2.2 acre plots on 27 May. A Herd Seeder mounted on a Honda ATC was used to apply the baits at 1.5 lb/acre. A third plot (2 acres) was left untreated as a control plot. Applications were made at 5:00 pm. Each plot contained five 0.1 acre circular subplots. These plots were marked with orange surveyor stakes. Pretreatment counts were made on 27 May inside the fifteen subplots. Posttreatment counts were made inside the same fifteen subplots on 27 Jun, 30 Jul, 31 Aug, 29 Sep, 13 Oct, and 17 Nov.</jats:p
The Effect of Time on Bait Applications for the Control of the Red Imported Fire Ant in Tattnall County, Ga, 1992
No full textAbstract
Three 0.1 acre subplots were permanently established within each of eight 1.65 acre plots. Each subplot was marked with an orange surveyor stake at its center. Pretreatment mound counts were made in the central 0.1 acre subplot on 29 June. Amdro® was broadcast at 11:00 am (82° soil temperature), 2:00 pm (86° soil temperature), and 5:00 pm (91° soil temperature). Each treatment, including an untreated control, was applied to two plots. The treated plots each received 1.2 lb/acre of Amdro®. Posttreatment counts were made on 26 Aug and 14 Dec.</jats:p
Insecticide Evaluation for Control of the Imported Fire Ant in Tift County, Ga, 1992
No full textAbstract
Six treatments wen evaluated as follows: Orthene® and Safecide® applied as dry powders over the top of active mounds, Orthene® applied as a drench, Logic® and Safecide’ baits sprinkled around the base of active mounds, and an untreated control. Each 0.2 acre circular plot was permanently marked with an orange surveyor stake. Three replicates were used for each treatment. Pretreatment counts were taken on 29 Jul in the 0.1 acre inner circle of each plot. Posttreatmeni counts of active mounds in the 0.1 acre inner circle were made on 6 Aug, 25 Aug, 3 Sep, and 20 Oct. Treatments were initiated at 7:30 AM on 29 Jul The average soil temperature was 90°F.</jats:p
- …
