scholarly journals Some Notes on a Formal Algebraic Structure of Cryptology

Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2183
Author(s):  
Vicente Jara-Vera ◽  
Carmen Sánchez-Ávila

Cryptology, since its advent as an art, art of secret writing, has slowly evolved and changed, above all since the middle of the last century. It has gone on to obtain a more solid rank as an applied mathematical science. We want to propose some annotations in this regard in this paper. To do this, and after reviewing the broad spectrum of methods and systems throughout history, and from the traditional classification, we offer a reordering in a more compact and complete way by placing the cryptographic diversity from the algebraic binary relations. This foundation of cryptological operations from the principles of algebra is enriched by adding what we call pre-cryptological operations which we show as a necessary complement to the entire structure of cryptology. From this framework, we believe that it is improved the diversity of questions related to the meaning, the fundamentals, the statute itself, and the possibilities of cryptological science.

1991 ◽  
Vol 02 (02) ◽  
pp. 101-131 ◽  
Author(s):  
THANH TUNG NGUYEN

The paper gives a self-contained account of a calculus of relations from basic operations through the treatment of recursive relation equations. This calculus serves as an algebraic apparatus for defining the denotational semantics of Dijkstra’s nondeterministic sequential programming language. Nondeterministic programs are modeled by binary relations, objects of an algebraic structure founded upon the operations “union”, “left restriction”, “demonic composition”, “demonic union”, and the ordering “restriction of”. Recursion and iteration are interpreted as fixed points of continuous relationals. Developed in the framework of set theory, this calculus may be regarded as a systematic generalization of the functional style.


1981 ◽  
Vol 22 (1) ◽  
pp. 57-68 ◽  
Author(s):  
Ki Hang Kim ◽  
Fred William Roush

In this paper we study some questions proposed by B. Schein [8] regarding the semigroup of binary relationsBxfor a finite setX: what is the ideal structure ofBx, what are the congruences onBx, what are the endomorphisms ofBx? For |X| =nit is convenient to regardBxas the semigroupBnofn×n(0, l)-matrices under Boolean matrix multiplication.


2017 ◽  
Vol 2 (1) ◽  
pp. 56-68 ◽  
Author(s):  
Amy L. Donaldson ◽  
Karen Krejcha ◽  
Andy McMillin

The autism community represents a broad spectrum of individuals, including those experiencing autism, their parents and/or caregivers, friends and family members, professionals serving these individuals, and other allies and advocates. Beliefs, experiences, and values across the community can be quite varied. As such, it is important for the professionals serving the autism community to be well-informed about current discussions occurring within the community related to neurodiversity, a strengths-based approach to partnering with autism community, identity-first language, and concepts such as presumed competence. Given the frequency with which speech-language pathologists (SLPs) serve the autism community, the aim of this article is to introduce and briefly discuss these topics.


2011 ◽  
Vol 49 (08) ◽  
Author(s):  
M Noll ◽  
S Berchtold ◽  
J Lampe ◽  
M Bitzer ◽  
UM Lauer
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document