683 research outputs found
Lilly reminiscences of Lillian Hellman
No full textThe author first met Hellman when he was 10 and she 35. Here he recounts the evolution of their relationship that lasted until her death
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
Politicising stardom: Jane Fonda, IPC Films and Hollywood, 1977-1982
No full textPhDThis thesis is an empirical analysis of Jane Fonda’s films, stardom, and political activism during the most commercially successful period of her career. At the outset, Fonda’s early stardom is situated in relation to contemporaneous moral and political ideologies in the United States and how she functioned as both an agent and symbol of these ideologies. Her anti-war activism in the early-1970s constituted the apex of Fonda’s radicalisation and the nadir of her popular appeal; a central question of this thesis, therefore, is how her stardom was rehabilitated for the American mainstream to the point of becoming Hollywood’s most bankable actress.
As the star and producer of IPC Films, Fonda developed political projects using commercial formats, namely Coming Home (1978), The China Syndrome (1979), Nine to Five (1980), and Rollover (1981). The final IPC film, On Golden Pond (1981), signalled an ideological breach in this political strategy by favouring a familial spectacle, and duly outperformed its predecessors significantly. The first and last chapters of this work provide historical parameters for IPC in Fonda’s career, while the remaining chapters are structured by the conceptual and political aspects of each IPC project. Julia (1977) is discussed as an IPC prototype through its dramatisation of political consciousness. Coming Home, The China Syndrome, Nine to Five, and Rollover all exhibit this motif whereas On Golden Pond employs melodramatic nostalgia. Often discussed reductively as a star symbolising change, this thesis instead uses archival and published sources to analyse Fonda’s individual agency in historical context, as well as the cultural and political impact of her stardom. The IPC enterprise provided cinematic apparatus for Fonda’s political recuperation within the American mainstream, which, more broadly, harboured significance for the nation’s conservative resurgence at the end of the 1970s
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
Introductory Comments: Virtual Adjacency and the Meaning of Place
No full textIntroductory Comments transcribed from The 2008 YouTube Election?: The Role and Influence of 21st-Century Media Symposium held on March 13, 2008 at The Catholic University of America, Columbus School of Law, as edited by the author. Copyright © J.J. Hellman 2008
Main Street and 4th Street, showing Hellman residence being moved, 1904
No full textPhotograph of Main Street and 4th Street, showing Hellman residence being moved, 1904. Part of the I.W. Hellman home being moved to vicinity of 18th and Figueroa to make way for Farmers & Merchants Bank building. "Braly(?) , Union Trust, Hobernian(?), Continental building in background." -- unknown author. Herman W. Hellman building at right. A sign posted on the tree (at left) reads: "over Niagara Falls [...]". At center, large plots of earth are disheveled. A log and debris can be seen adjacent to a building at left. To the far right, men can be walking along the street beside the buildings. Two trolleys can be seen beside another structure in construction. In the foreground, two men are visible beside a low fence
Mobile Press-Register sleeve MP0061251
No full textKiwanis Club, president Bruce Hellman, Archbishop Lipscomb / (Korbet's Restaurant
- …
