Law and Literature – a Meaningful Connection

The connection between law and (imaginative) literature can still affect surprisingly. The theme of the present article is to summarize some of the basic features of the movement, which is called „Law and Literature” and to suggest some starting-points with which it is associated. These starting points include, for instance linguistic conception of law, narratology in law or the relations between law and culture. The article offers an overview of the classical approaches connecting law and literature and mentions the reasons for this connection: e.g. cultivation of law and lawyers, improvement of judicial decisions or improvement of legal interpretation. Some of the findings resulting from the joint of law and literature can be used in practice and goes beyond „mere” theory. The article is to be seen as an introduction to the movement of „Law and Literature”, presentation of ideas on which this movement is based and offering the possibility of its further development.

Gossip we can trust: Defamation law and non-fiction

Drawing on two case studies, this article considers the allegation of a disgruntled author: ’Defamation was framed to protect the reputations of 19th century gentlemen hypocrites'. The first case study considers the litigation over Bob Ellis' unreliable political memoir, ’Goodbye Jerusalem', published by Random House. The second case study focuses upon the litigation over the allegation by Media Watch that Richard Carleton had plagarised a documentary entitled ’Cry from the Grave'. The article considers the meaning of defamatory imputations, the range of defences, and the available remedies. It highlights the competing arguments over the protection of reputation and privacy, artistic expression, and the freedom of speech. This article concludes that defamation law should foster ’gossip we can trust'.

The normative ontology of the law - Peter Cane's responsibility in law and morality

Implications of Peter Cane's analysis of responsibility in 'Responsibility in Law and Morality' - Cane's preconceptualisation of the 'symbiotic' relationship between law and morality - a principal criticism is that Cane does not develop his seven methodological principles into a more ambitious argument.

Inaugural addresses of Theodore W. Dwight, professor of law, and of George P. Marsh, professor of English literature, in Columbia college, New York.

Mode of access: Internet.

A guide to the law and legal literature of Bolivia.

Mode of access: Internet.

A guide to the law and legal literature of Mexico /

On verso of t.-p.: The Law library.

A guide to the law and legal literature of Ecuador.

On verso of t.-p.: The Law Library.

A guide to the law and legal literature of the Mexican states /

Photocopy. Ann Arbor, University Microfilms, 1978.

A guide to the law and legal literature of Argentina, 1917-1946.

On verso of t.-p.: The Law Library.

A guide to the law and legal literature of Paraguay.

Bibliographical foot-notes.

Guide to the law and legal literature of Argentina, Brazil and Chile /

"Glossary": p. 447-478.

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.