bluuebunny/crossref_metadata_2025 huggingface dataset:
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF
Authors: Datta Nilanjan , Dutta Avijit , Nandi Mridul , Paul Goutam
Published: November 2020

SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely PMAC_Plus (Yasuda, CRYPTO 2011), 3kf9 (Zhang et al., ASIACRYPT 2012) and LightMAC_Plus (Naito, ASIACRYPT 2017). In this paper, we have abstracted out the inherent design principle of all these BBB secure MACs and present a generic design paradigm to construct a BBB secure pseudo random function, namely Double-block Hash-then- Sum or in short (DbHtS). A DbHtS construction, as the name implies, computes a double block hash on the message and then sum the encrypted output of the two hash blocks. Our result renders that if the underlying hash function meets certain security requirements (namely cover-free and block-wise universal advantage is low), DbHtS construction provides 2n/3-bit security. We demonstrate the applicability of our result by instantiating all the existing beyond birthday secure deterministic MACs (e.g., SUM-ECBC, PMAC_Plus, 3kf9, LightMAC_Plus) as well as a simple two-keyed variant for each of them and some algebraic hash based constructions.
More Accurate Differential Properties of LED64 and Midori64
Authors: Sun Ling , Wang Wei , Wang Meiqin
Published: November 2020

In differential cryptanalysis, a differential is more valuable than the single trail belonging to it in general. The traditional way to compute the probability of the differential is to sum the probabilities of all trails within it. The automatic tool for the search of differentials based on Mixed Integer Linear Programming (MILP) has been proposed and realises the task of finding multiple trails of a given differential. The problem is whether it is reliable to evaluate the probability of the differential traditionally. In this paper, we focus on two lightweight block ciphers – LED64 and Midori64 and show the more accurate estimation of differential probability considering the key schedule. Firstly, an automated tool based on Boolean Satisfiability Problem (SAT) is put forward to accomplish the automatic search of differentials for ciphers with S-boxes and is applied to LED64 and Midori64. Secondly, we provide an automatic approach to detect the right pairs following a given differential, which can be exploited to calculate the differential property. Applying this technique to the STEP function of LED64, we discover some differentials with enhanced probability. As a result, the previous attacks relying upon high probability differentials can be improved definitely. Thirdly, we present a method to compute an upper-bound of the weak-key ratio for a given differential, which is utilised to analyse 4-round differentials of Midori64. We detect two differentials whose weak-key ratios are much lower than the expected 50%. More than 78% of the keys will make these two differentials being impossible differentials. The idea of the estimation for an upper-bound of the weak-key ratio can be employed for other ciphers and allows us to launch differential attacks more reliably. Finally, we introduce how to compute the enhanced differential probability and evaluate the size of keys achieving the improved probability. Such a property may incur an efficient weak-key attack. For a 4-round differential of Midori64, we obtain an improved differential property for a portion of keys.
Boomerang Connectivity Table Revisited. Application to SKINNY and AES
Authors: Song Ling , Qin Xianrui , Hu Lei
Published: November 2020

The boomerang attack is a variant of differential cryptanalysis which regards a block cipher E as the composition of two sub-ciphers, i.e., E = E1 o E0, and which constructs distinguishers for E with probability p2q2 by combining differential trails for E0 and E1 with probability p and q respectively. However, the validity of this attack relies on the dependency between the two differential trails. Murphy has shown cases where probabilities calculated by p2q2 turn out to be zero, while techniques such as boomerang switches proposed by Biryukov and Khovratovich give rise to probabilities greater than p2q2. To formalize such dependency to obtain a more accurate estimation of the probability of the distinguisher, Dunkelman et al. proposed the sandwich framework that regards E as Ẽ1 o Em o Ẽ0, where the dependency between the two differential trails is handled by a careful analysis of the probability of the middle part Em. Recently, Cid et al. proposed the Boomerang Connectivity Table (BCT) which unifies the previous switch techniques and incompatibility together and evaluates the probability of Em theoretically when Em is composed of a single S-box layer. In this paper, we revisit the BCT and propose a generalized framework which is able to identify the actual boundaries of Em which contains dependency of the two differential trails and systematically evaluate the probability of Em with any number of rounds. To demonstrate the power of this new framework, we apply it to two block ciphers SKINNY and AES. In the application to SKINNY, the probabilities of four boomerang distinguishers are re-evaluated. It turns out that Em involves5 or 6 rounds and the probabilities of the full distinguishers are much higher than previously evaluated. In the application to AES, the new framework is used to exclude incompatibility and find high probability distinguishers of AES-128 under the related-subkey setting. As a result, a 6-round distinguisher with probability 2−109.42 is constructed. Lastly, we discuss the relation between the dependency of two differential trails in boomerang distinguishers and the properties of components of the cipher.
Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks
Authors: Derbez Patrick , Fouque Pierre-Alain , Lambin Baptiste , Mollimard Victor
Published: November 2020

The Feistel construction is one of the most studied ways of building block ciphers. Several generalizations were then proposed in the literature, leading to the Generalized Feistel Network, where the round function first applies a classical Feistel operation in parallel on an even number of blocks, and then a permutation is applied to this set of blocks. In 2010 at FSE, Suzaki and Minematsu studied the diffusion of such construction, raising the question of how many rounds are required so that each block of the ciphertext depends on all blocks of the plaintext. They thus gave some optimal permutations, with respect to this diffusion criteria, for a Generalized Feistel Network consisting of 2 to 16 blocks, as well as giving a good candidate for 32 blocks. Later at FSE’19, Cauchois et al. went further and were able to propose optimal even-odd permutations for up to 26 blocks.In this paper, we complete the literature by building optimal even-odd permutations for 28, 30, 32, 36 blocks which to the best of our knowledge were unknown until now. The main idea behind our constructions and impossibility proof is a new characterization of the total diffusion of a permutation after a given number of rounds. In fact, we propose an efficient algorithm based on this new characterization which constructs all optimal even-odd permutations for the 28, 30, 32, 36 blocks cases and proves a better lower bound for the 34, 38, 40 and 42 blocks cases. In particular, we improve the 32 blocks case by exhibiting optimal even-odd permutations with diffusion round of 9. The existence of such a permutation was an open problem for almost 10 years and the best known permutation in the literature had a diffusion round of 10. Moreover, our characterization can be implemented very efficiently and allows us to easily re-find all optimal even-odd permutations for up to 26 blocks with a basic exhaustive search
Substitution Attacks against Message Authentication
Authors: Armour Marcel , Poettering Bertram
Published: November 2020

This work introduces Algorithm Substitution Attacks (ASAs) on message authentication schemes. In light of revelations concerning mass surveillance, ASAs were initially introduced by Bellare, Paterson and Rogaway as a novel attack class against the confidentiality of encryption schemes. Such an attack replaces one or more of the regular scheme algorithms with a subverted version that aims to reveal information to an adversary (engaged in mass surveillance), while remaining undetected by users. While most prior work focused on subverting encryption systems, we study options to subvert symmetric message authentication protocols. In particular we provide powerful generic attacks that apply e.g. to HMAC or Carter–Wegman based schemes, inducing only a negligible implementation overhead. As subverted authentication can act as an enabler for subverted encryption (software updates can be manipulated to include replacements of encryption routines), we consider attacks of the new class highly impactful and dangerous.
New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160
Authors: Liu Fukang , Dobraunig Christoph , Mendel Florian , Isobe Takanori , Wang Gaoli , Cao Zhenfu
Published: November 2020

RIPEMD-160 is a hash function published in 1996, which shares similarities with other hash functions designed in this time-period like MD4, MD5 and SHA-1. However, for RIPEMD-160, no (semi-free-start) collision attacks on the full number of steps are known. Hence, it is still used, e.g., to generate Bitcoin addresses together with SHA-256, and is an ISO/IEC standard. Due to its dual-stream structure, even semifree- start collision attacks starting from the first step only reach 36 steps, which were firstly shown by Mendel et al. at Asiacrypt 2013 and later improved by Liu, Mendel and Wang at Asiacrypt 2017. Both of the attacks are based on a similar freedom degree utilization technique as proposed by Landelle and Peyrin at Eurocrypt 2013. However, the best known semi-free-start collision attack on 36 steps of RIPEMD-160 presented at Asiacrypt 2017 still requires 255.1 time and 232 memory. Consequently, a practical semi-free-start collision attack for the first 36 steps of RIPEMD-160 still requires a significant amount of resources. Considering the structure of these previous semi-free-start collision attacks for 36 steps of RIPEMD-160, it seems hard to extend it to more steps. Thus, we develop a different semi-free-start collision attack framework for reduced RIPEMD-160 by carefully investigating the message expansion of RIPEMD-160. Our new framework has several advantages. First of all, it allows to extend the attacks to more steps. Second, the memory complexity of the attacks is negligible. Hence, we were able to mount semi-free-start collision attacks on 36 and 37 steps of RIPEMD-160 with practical time complexity 241 and 249 respectively. Additionally, we describe semi-free-start collision attacks on 38 and 40 (out of 80) steps of RIPEMD-160 with time complexity 252 and 274.6, respectively. To the best of our knowledge, these are the best semi-free-start collision attacks for RIPEMD-160 starting from the first step with respect to the number of steps, including the first practical colliding message pairs for 36 and 37 steps of RIPEMD-160.
Exhaustive Search for Various Types of MDS Matrices
Authors: Kesarwani Abhishek , Sarkar Santanu , Venkateswarlu Ayineedi
Published: November 2020

MDS matrices are used in the design of diffusion layers in many block ciphers and hash functions due to their optimal branch number. But MDS matrices, in general, have costly implementations. So in search for efficiently implementable MDS matrices, there have been many proposals. In particular, circulant, Hadamard, and recursive MDS matrices from companion matrices have been widely studied. In a recent work, recursive MDS matrices from sparse DSI matrices are studied, which are of interest due to their low fixed cost in hardware implementation. In this paper, we present results on the exhaustive search for (recursive) MDS matrices over GL(4, F2). Specifically, circulant MDS matrices of order 4, 5, 6, 7, 8; Hadamard MDS matrices of order 4, 8; recursive MDS matrices from companion matrices of order 4; recursive MDS matrices from sparse DSI matrices of order 4, 5, 6, 7, 8 are considered. It is to be noted that the exhaustive search is impractical with a naive approach. We first use some linear algebra tools to restrict the search to a smaller domain and then apply some space-time trade-off techniques to get the solutions. From the set of solutions in the restricted domain, one can easily generate all the solutions in the full domain. From the experimental results, we can see the (non) existence of (involutory) MDS matrices for the choices mentioned above. In particular, over GL(4, F2), we provide companion matrices of order 4 that yield involutory MDS matrices, circulant MDS matrices of order 8, and establish the nonexistence of involutory circulant MDS matrices of order 6, 8, circulant MDS matrices of order 7, sparse DSI matrices of order 4 that yield involutory MDS matrices, and sparse DSI matrices of order 5, 6, 7, 8 that yield MDS matrices. To the best of our knowledge, these results were not known before. For the choices mentioned above, if such MDS matrices exist, we provide base sets of MDS matrices, from which all the MDS matrices with the least cost (with respect to d-XOR and s-XOR counts) can be obtained. We also take this opportunity to present some results on the search for sparse DSI matrices over finite fields that yield MDS matrices. We establish that there is no sparse DSI matrix S of order 8 over F28 such that S8 is MDS.
Improving the MILP-based Security Evaluation Algorithm against Differential/Linear Cryptanalysis Using A Divide-and-Conquer Approach
Authors: Zhou Chunning , Zhang Wentao , Ding Tianyou , Xiang Zejun
Published: November 2020

In recent years, Mixed Integer Linear Programming (MILP) has been widely used in cryptanalysis of symmetric-key primitives. For differential and linear cryptanalysis, MILP can be used to solve two kinds of problems: calculation of the minimum number of differentially/linearly active S-boxes, and search for the best differential/linear characteristics. There are already numerous papers published in this area. However, the efficiency is not satisfactory enough for many symmetric-key primitives. In this paper, we greatly improve the efficiency of the MILP-based search algorithm for both problems. Each of the two problems for an r-round cipher can be converted to an MILP model whose feasible region is the set of all possible r-round differential/linear characteristics. Generally, high-probability differential/linear characteristics are likely to have a low number of active S-boxes at a certain round. Inspired by the idea of a divide-and-conquer approach, we divide the set of all possible differential/linear characteristics into several smaller subsets, then separately search them. That is to say, the search of the whole set is split into easier searches of smaller subsets, and optimal solutions within the smaller subsets are combined to give the optimal solution within the whole set. In addition, we use several techniques to further improve the efficiency of the search algorithm. As applications, we apply our search algorithm to five lightweight block ciphers: PRESENT, GIFT-64, RECTANGLE, LBLOCK and TWINE. For each cipher, we obtain better results than the best-known ones obtained from the MILP method. For the minimum number of differentially/linearly active S-boxes, we reach 31/31, 16/15, 16/16, 20/20 and 20/20 rounds for the five ciphers respectively. For the best differential/linear characteristics, we reach 18/18, 15/13, 15/14, 16/15 and 15/16 rounds for the five ciphers respectively.
INT-RUP Secure Lightweight Parallel AE Modes
Authors: Chakraborti Avik , Datta Nilanjan , Jha Ashwin , Mancillas-López Cuauhtemoc , Nandi Mridul , Sasaki Yu
Published: November 2020

Owing to the growing demand for lightweight cryptographic solutions, NIST has initiated a standardization process for lightweight cryptographic algorithms. Specific to authenticated encryption (AE), the NIST draft demands that the scheme should have one primary member that has key length of 128 bits, and it should be secure for at least 250 − 1 byte queries and 2112 computations. Popular (lightweight) modes, such as OCB, OTR, CLOC, SILC, JAMBU, COFB, SAEB, Beetle, SUNDAE etc., require at least 128-bit primitives to meet the NIST criteria, as all of them are just birthday bound secure. Furthermore, most of them are sequential, and they either use a two pass mode or they do not offer any security when the adversary has access to unverified plaintext (RUP model). In this paper, we propose two new designs for lightweight AE modes, called LOCUS and LOTUS, structurally similar to OCB and OTR, respectively. These modes achieve notably higher AE security bounds with lighter primitives (only a 64-bit tweakable block cipher). Especially, they satisfy the NIST requirements: secure as long as the data complexity is less than 264 bytes and time complexity is less than 2128, even when instantiated with a primitive with 64-bit block and 128-bit key. Both these modes are fully parallelizable and provide full integrity security under the RUP model. We use TweGIFT-64[4,16,16,4] (also referred as TweGIFT-64), a tweakable variant of the GIFT block cipher, to instantiate our AE modes. TweGIFT-64-LOCUS and TweGIFT-64-LOTUS are significantly light in hardware implementation. To justify, we provide our FPGA based implementation results, which demonstrate that TweGIFT-64-LOCUS consumes only 257 slices and 690 LUTs, while TweGIFT-64-LOTUS consumes only 255 slices and 664 LUTs.
Cryptanalysis of the Legendre PRF and Generalizations
Authors: Beullens Ward , Beyne Tim , Udovenko Aleksei , Vitto Giuseppe
Published: November 2020

The Legendre PRF relies on the conjectured pseudorandomness properties of the Legendre symbol with a hidden shift. Originally proposed as a PRG by Damgård at CRYPTO 1988, it was recently suggested as an efficient PRF for multiparty computation purposes by Grassi et al. at CCS 2016. Moreover, the Legendre PRF is being considered for usage in the Ethereum 2.0 blockchain.This paper improves previous attacks on the Legendre PRF and its higher-degree variant due to Khovratovich by reducing the time complexity from O(< (p log p/M) to O(p log2 p/M2) Legendre symbol evaluations when M ≤ 4√ p log2 p queries are available. The practical relevance of our improved attack is demonstrated by breaking three concrete instances of the PRF proposed by the Ethereum foundation. Furthermore, we generalize our attack in a nontrivial way to the higher-degree variant of the Legendre PRF and we point out a large class of weak keys for this construction. Lastly, we provide the first security analysis of two additional generalizations of the Legendre PRF originally proposed by Damgård in the PRG setting, namely the Jacobi PRF and the power residue PRF.
Finding Bit-Based Division Property for Ciphers with Complex Linear Layers
Authors: Hu Kai , Wang Qingju , Wang Meiqin
Published: November 2020

The bit-based division property (BDP) is the most effective technique for finding integral characteristics of symmetric ciphers. Recently, automatic search tools have become one of the most popular approaches to evaluating the security of designs against many attacks. Constraint-aided automatic tools for the BDP have been applied to many ciphers with simple linear layers like bit-permutation. Constructing models of complex linear layers accurately and efficiently remains hard. A straightforward method proposed by Sun et al. (called the S method), decomposes a complex linear layer into basic operations like COPY and XOR, then models them one by one. However, this method can easily insert invalid division trails into the solution pool, which results in a quicker loss of the balanced property than the cipher itself would. In order to solve this problem, Zhang and Rijmen propose the ZR method to link every valid trail with an invertible sub-matrix of the matrix corresponding to the linear layer, and then generate linear inequalities to represent all the invertible sub-matrices. Unfortunately, the ZR method is only applicable to invertible binary matrices (defined in Definition 3).To avoid generating a huge number of inequalities for all the sub-matrices, we build a new model that only includes that the sub-matrix corresponding to a valid trail should be invertible. The computing scale of our model can be tackled by most of SMT/SAT solvers, which makes our method practical. For applications, we improve the previous BDP for LED and MISTY1. We also give the 7-round BDP results for Camellia with FL/FL−1, which is the longest to date.Furthermore, we remove the restriction of the ZR method that the matrix has to be invertible, which provides more choices for future designs. Thanks to this, we also reproduce 5-round key-dependent integral distinguishers proposed at Crypto 2016 which cannot be obtained by either the S or ZR methods.
Key Assignment Schemes with Authenticated Encryption, revisited
Authors: Pijnenburg Jeroen , Poettering Bertram
Published: November 2020

A popular cryptographic option to implement Hierarchical Access Control in organizations is to combine a key assignment scheme with a symmetric encryption scheme. In brief, key assignment associates with each object in the hierarchy a unique symmetric key, and provides all higher-ranked “authorized” subjects with a method to recover it. This setup allows for encrypting the payloads associated with the objects so that they can be accessed by the authorized and remain inaccessible for the unauthorized. Both key assignment and symmetric encryption have been researched for roughly four decades now, and a plethora of efficient constructions have been the result. Surprisingly, a treatment of the joint primitive (key assignment combined with encryption, as used in practice) in the framework of provable security was conducted only very recently, leading to a publication in ToSC 2018(4). We first carefully revisit this publication. We then argue that there are actually two standard use cases for the combined primitive, which also require individual treatment. We correspondingly propose a fresh set of security models and provably secure constructions for each of them. Perhaps surprisingly, the two constructions call for different symmetric encryption primitives: While standard AEAD is the right tool for the one, we identify a less common tool called Encryptment as best fitting the other.
Cryptanalysis of Curl-P and Other Attacks on the IOTA Cryptocurrency
Authors: Heilman Ethan , Narula Neha , Tanzer Garrett , Lovejoy James , Colavita Michael , Virza Madars , Dryja Tadge
Published: November 2020

We present attacks on the cryptography formerly used in the IOTA blockchain, including under certain conditions the ability to forge signatures. We developed practical attacks on IOTA’s cryptographic hash function Curl-P-27, allowing us to quickly generate short colliding messages. These collisions work even for messages of the same length. Exploiting these weaknesses in Curl-P-27, we broke the EUCMA security of the former IOTA Signature Scheme (ISS). Finally, we show that in a chosen-message setting we could forge signatures and multi-signatures of valid spending transactions (called bundles in IOTA).
From Combined to Hybrid: Making Feedback-based AE even Smaller
Authors: Chakraborti Avik , Datta Nilanjan , Jha Ashwin , Mitragotri Snehal , Nandi Mridul
Published: November 2020

In CHES 2017, Chakraborti et al. proposed COFB, a rate-1 sequential block cipher-based authenticated encryption (AE) with only 1.5n-bit state, where n denotes the block size. They used a novel approach, the so-called combined feedback, where each block cipher input has a combined effect of the previous block cipher output and the current plaintext block. In this paper, we first study the security of a general rate-1 feedback-based AE scheme in terms of its overall internal state size. For a large class of feedback functions, we show that the overlying AE scheme can be attacked in 2r queries if the internal state size is n + r bits for some r ≥ 0. This automatically shows that a birthday bound (i.e. 2n/2 queries) secure AE scheme must have at least 1.5n-bit state, whence COFB is almost-optimal (use 1.5n-bit state and provides security up to 2n/2/n queries). We propose a new feedback function, called the hybrid feedback or HyFB, which is a hybrid composition of plaintext and ciphertext feedbacks. HyFB has a key advantage of lower XOR counts over the combined feedback function. This essentially helps in reducing the hardware footprint. Based on HyFB we propose a new AE scheme, called HyENA, that achieves the state size, rate, and security of COFB. In addition, HyENA has significantly lower XOR counts as compared to COFB, whence it is expected to have a smaller implementation as compared to COFB.
THE EFFECT OF ORGANOSOLV TREATMENT ON THE PHYSICOCHEMICAL PROPERTIES OF PULP AND PAPER FROM HORSE GRASS (ANDROPOGON TECTORUM).
Authors: Otitoju O. , Ashogbon A.O.
Published: November 2020

The delignification of horse grass (HG) was carried out using methanol and water (organosolv pulping); varying the cooking conditions at 30min, 60min and 90min with ratios: 1:1, 1:2 and 1:3, Methanol-water, cooked in autoclave at 1050C. The pulp obtained were selected and macerated in equal volume of glacial acetic acid (ethanoic acid) and hydrogen peroxide (1:1) at a temperature 1000C, to investigate the fiber length; fiber diameter; lumen with their derived indices and paper strength properties was determined according to TAPPI standard methods, T 494 om-96. The best fiber length of 3.21mm, tear index 31.43 mN.m2/g, tensile index 97.79Nm/g and bulk index 5.15 kPa.m2/g was obtained at 1:3 methanol: H2O at 105°C with cooking time of 60 min. Therefore, it was established that high quality papers of different grades can be produced from horse grass with acceptable strength properties using low concentration of methanol/water pulping with moderate time at boiling temperature. The research concluded that methanol-water was excellently good for pulping of horse grass fibers. The above results showed that horse grass is a good alternative sources of fibers to produce pulp and paper.
Effects of Ramp Rate and Starting Temperature on Gas Chromatography-Mass Spectrometric Analyses of Petroleum Hydrocarbons
Authors: Oghoje S.  U. , Ukpebor J. E. , Agbaire P. O. , Ejeomo C. , Oviasogie P. O.
Published: November 2020

The quest for better GC-MS/FID starting temperature and ramping conditions for the quantification of hydrocarbons in our environment necessitated this study. A surrogate n-alkane standard was screened using nine GC-MS conditions involving the alteration of ramp rates and/or initial temperatures. There was observed increase in the TIC chromatogram or ionic mass unit as the ramp rate or initial temperatures were increased. The peak areas of the analytes were significantly affected. The R2 and response factor values of the eight standard calibration curves (each for a modified method) varied from 0.9224 – 0.9971 and 0.0034 – 0.0045 respectively. Consequently, the quantification of the diesel concentration in diesel spiked water and soil by using the eight methods was different from each other and from the standard method. Average differences of 11.5 and 15 % from the theoretical values were observed for the water and soil analyses respectively. Increasing ramp rates or initial temperatures led to shorter throughput but less data accuracy. The use of 60 oC as starting temperature and ramp at 5 oC/minute was better for quantification of the diesel range organics.
La orientación psicopedagógica para la prevención de la dependencia tecnológica en los adolescentes del Preuniversitario
Authors: Abad Águila Lixenda , Torres Zerquera Leticia del Carmen , Pérez Egües Miguel Alejandro , Falcón Dayana Díaz
Published: November 2020

La orientación psicopedagógica en el Preuniversitario es un proceso que responde a las exigencias de la sociedad y a las necesidades propias de la etapa del desarrollo por la que transitan los educandos. En la actualidad, el uso desmedido e incontrolado de las tecnologías, constituye una de las problemáticas que requiere de la orientación psicopedagógica en la etapa de la adolescencia a fin de prevenir la dependencia tecnológica. El estudio efectuado en un Preuniversitario del municipio Cienfuegos develó insuficiencias en el proceso de orientación, que se manifiestan en la poca percepción del riesgo que entraña el uso desmedido de las tecnologías. El objetivo del trabajo consistió en proponer una estrategia de orientación psicopedagógica para la prevención de la dependencia tecnológica en los adolescentes del Preuniversitario; estructurada en cuatro etapas: diagnóstico, elaboración, ejecución y evaluación. Los resultados preliminares indicaron que es una estrategia de orientación psicopedagógica factible, que brinda a los adolescentes la posibilidad de ser protagonista de su perfeccionamiento y tiene en cuenta la participación de docentes y familiares.
O conceito de mal em Kant é suficiente?
Authors: Morita Henrique Franco
Published: November 2020

A filosofia compreende o mal presente nos regimes totalitários? Arendt evoca o mal radical segundo Kant. Reconstrói-se, assim, a caracterização kantiana do mal, concentrando-se nas obras A Religião nos Limites da Simples Razão (1793) e Antropologia de um Ponto de Vista Pragmático (1798). As inclinações dividem-se em afetos e paixões. Afetos são insuficientes para macular uma boa vontade, paixões afiguram-se corruptoras. Parte-se, então, à pergunta sobre a natureza humana ser boa ou má, a propensão para o mal e a disposição originária para o bem: a natureza humana é corrompida, mas há responsabilização. Entre natureza e arbítrio, o conceito de mal aponta para o dever de usar a liberdade de acordo com os comandos da lei moral, reconduzindo-se à disposição santa originária. Daí a ideia de que a moral conduz à religião e à plenitude da comunidade ética. Conclui-se, entretanto, que Kant não abarca a superfluidade dos seres humanos – nem a banalidade do mal – como teorizado por Arendt.
Notas sobre a crítica de Nietzsche à filologia e à educação
Authors: Calomeni Tereza Cristina
Published: November 2020

Vinculado ao projeto de pesquisa A singularidade do trágico-dionisíaco e a crítica da cultura no jovem Nietzsche, o artigo aborda alguns aspectos da crítica nietzschiana da filologia alemã como ponto de partida para uma análise da reflexão sobre a cultura e a educação.
Towards a dual ontology: duality, a case study
Authors: Ferrari Francesco Maria
Published: November 2020

The main aim of this work is to depict the interconnection of the most relvantformal concepts of modal logic and category theory, i.e., bisimulation andduality, arising from the mathematical analysis of physical processes and toshow their relevance with respect to some foundational issues related to the actual ontological debates. Current foundamental physics concerns the non-linear thermodynamics of the quantum eld, whose range is made of far from equilibrium systems and whose basic mechanism of symmetries (patterns) formation supposes the spontaneous breaking of symmetries (SBS). SBS implies that such systems reach unpredictable states. Thus, evolutive and/or far from equilibrium systems are to be conceived primarily as processes and just in a secondary way as objects, for the information they display is always incomplete with respect to their evolution. Formally, this is due to their non-linear mathematical behaviour.This make a question about the ontology of such systems, given thatthe actual most widespread ontologies conceive existent entities just as objects(actualist ontologies). It is claimed that the fundamental dierence and advantage of category theoretic approach to foundation is that, instead of considering objects and operations for what they 'are', as it is in set theory, in and through category theory we are considering them for what they 'do'. This, of course, would constitute a signicative shifting in mathematical philosophy and in foundationof mathematical physics: from a Platonic to an Aristotelian ontology ofmathematics (and, then, of physics). Actually, providing a contribution to thisvery shift is what this paper want to be focused on. In fact, the implicit pointthe present investigation is concerned with is how to treat the potential innite:the modalization of the existence of each object of the domain of quanticationmeans a potentially innite variation of the domain of quantication. The Aristotelian notion of potentiality diers with the usual one (employed by Platonism and/or formalism and/or conceptualism) inasmuch it does not presupposes any actuality. For instance, it is well known that the Platonic presupposition of set theory consists in the fact "that each potential innite, if it is rigorously applicable mathematically, presupposes an actual innite" [Hallett (1984, p. 25)]. In turn, the formalist notion of (absolute) completeness derives directly from that, if only for the actuality of the information a formal system was intended to dispaly.
Entre o universal e o singular: Oswaldo Giacoia Junior e o grande dilema da filosofia contemporânea
Authors: Mattos Fernando Costa
Published: November 2020

O artigo propõe um diálogo, a partir do livro Nietzsche x Kant, de Oswaldo Giacoia Jr, sobre a tensão entre o universal e o singular, uma questão que seria decisiva na filosofia contemporânea como um todo. Depois de reconstruir os principais argumentos de Giacoia, sua conclusão é analisada e discutida, sugerindo-se que um possível modo de conciliar as duas perspectivas é oferecido por Jürgen Habermas, notadamente no texto “Acerca do uso pragmático, ético e moral da razão prática”. Em sua conclusão, porém, o artigo recupera uma certa distância de Habermas e, voltando aos termos em que Giacoia havia encaminhado a tensão entre o universal e o singular, propõe reforçar o papel da Filosofia no encaminhamento da questão.
O desenvolvimento da psicologia de Schopenhauer
Authors: Bacelar Kleverton
Published: November 2020

Esse artigo, apresentado previamente em conferência no VIII Colóquio Internacional Schopenhauer (Curitiba, 2017), tem por objetivo expor o surgimento e as transformações da psicologia moral na obra de Schopenhauer (1788-1860), desde seu início nos anos de formação até o fim de sua produção intelectual, como requisito prévio para indicar sua função preparatória para o surgimento das psicologias de Paul Rée e Friedrich Nietzsche que com ela confrontam-se paralelamente.Palavras-chave: Psicologia, Caráter, móbeis da vontade.
“Dem Willen zum Leben ist das Leben gewiß”: vida e finalidade em Schopenhauer
Authors: Mattioli William
Published: November 2020

Neste artigo, pretendo discutir o problema da vida em Schopenhauer a partir da perspectiva de sua metafísica da natureza, que implica uma concepção teleológica da evolução das formas de manifestação da vontade segundo uma hierarquia de seus graus de objetivação. Meu ponto de partida é a fórmula schopenhaueriana mediante a qual o autor apresenta sua concepção básica acerca da essência de todo fenômeno: a “vontade de vida”. Investigarei se e em que medida a noção de vida que encontramos em sua filosofia da natureza, a partir do conceito de “força vital” (Lebenskraft), o compromete ou ao menos o aproxima de uma posição que podemos chamar de vitalista, e isso com base na distinção entre três sentidos e graus de abrangência que podemos atribuir a uma tal posição: desde uma posição menos onerosa do ponto de vista metafísico e mais moderada no que diz respeito às suas pretensões, a uma posição mais radical, estrita, universalista e metafisicamente mais robusta. O trabalho que se segue é a primeira parte de um estudo sobre o problema da vida e da força vital em Schopenhauer, que será continuado numa segunda parte.
Schopenhauer, mestre de Nietzsche: sobre niilismo e ascetismo
Authors: Constâncio João
Published: November 2020

O artigo tentar mostrar três coisas: primeiro que, embora Nietzsche rejeite alguns dos aspectos mais importantes da famosa metafísica da vontade que se encontra no centro de toda a filosofia de Schopenhauer, tal metafísica não deixa por isso de ser o ponto de partida da sua análise do “facto fundamental da vontade humana” na Genealogia da Moral; depois, que o modo como Schopenhauer entende o ascetismo e a “negação da vontade” tem uma importância crucial para a compreensão da concepção nietzschiana do “ideal ascético” e de uma “vontade do nada” como vontade ascética; por fim, que a interpretação daquilo a que Nietzsche chama “niilismo” na Genealogia e, em geral, na sua obra não pode dispensar a reflexão sobre o modo como Nietzsche e Schopenhauer pensam o ascetismo e a ideia de uma “vontade do nada”. Este último ponto implica a revisão crítica de importantes interpretações do niilismo em Nietzsche, como a de Stegmaier e a de van Tongeren.
A critical approach to sensorimotor contingency theory: brain as agent and conscious mind as a guide of action
Authors: Coelho Jonas Gonçalves
Published: November 2020

I present and consider critically O'Regan and Noë's sensorimotor contingency theory, proposed as an alternative to solve the explanatory gap problem. I start with the criticism that these authors address the current conception of representation, according to which conscious experiences are representations of the external world produced by the brain. Afterward, I summarize the way the sensorimotor contingency theory addresses the problem of the explanatory gap, explaining the existence, form, and content of visual consciousness in terms of an "exploratory activity" mediated by sensorimotor contingency laws. Finally, in agreement with criticisms addressed to O'Regan and Noë's solution, I propose a way to face the problem of the explanatory gap, which, recognizing the relevance of the body and the external environment to the existence, form and content of visual consciousness, but privileging the role of the brain as an organ of visual consciousness, and as an agent who uses visual consciousness as a guide to initiate and maintain embodied and situated adaptive actions in the world.
The extended mind hypothesis: an anti-metaphysical vaccine
Authors: Airoldi Giorgio
Published: November 2020

Discussions about the extended mind have ‘extended’ in various directions in the last decades. While applied to other aspects of human cognition and even consciousness, the extended-mind hypothesis has also been criticized, as it questions fundamental ideas such as the image of a dual world, divided between an external and an internal domain by the border of ‘skin and skull’, the idea of a localized and constant decision center, and the role of internal representations. We suggest that the main virtue of the hypothesis is not as a theory per se, but as a vaccine against persistent metaphysical prejudices about the mind’s structure, functions and borders. Being an hypothesis about the most efficient ways to combine resources and problems, and not a theory about the mind’s a-priori constitution, the extended mind view moves the focus from ontology to pragmatics and helps purify philosophy of mind from metaphysical remainders.
How to measure a quale
Authors: Pessoa Jr. Osvaldo Frota
Published: November 2020

According to the colored-brain thesis (or qualitative physicalism), sense data or qualia are real physical-chemical qualities, located inside the brain, possibly at a specific locus. Our hypothesis is that the seats of phenomenal consciousness have a structure and a materiality. According to the proposed view, a chromatic quale emerges when a certain pixel of the visual sensorium (the hypothetical subjective visual “screen”, or Cartesian theater, with its specific materiality ω) is fed with a certain pattern Σ of spikes; a change in this pattern quickly changes the color that is subjectively generated. How could one manage to measure chromatic qualia? In principle, with nanoscopical techniques, one could capture all the patterns that fall on the sensorium, and transmit the information to other media. But this does not capture the qualia. However, if the patterns are made to fall on a tissue of the same kind, typically inside another person’s brain, this other person will have roughly the same subjective experience as the first person. The model is used to explore two different situations involving qualia inversion. The paper also explores Cartesian materialism, and the claim that phenomenal time and space are identical to a region of physical time and space.
Kant e o problema do sujeito
Authors: Flores Paulo Henrique
Published: November 2020

Este artigo apresenta o conceito problemático de sujeito na filosofia de Kant. Iniciamos por apresentar as linhas principais e os sentidos empírico e transcendental da Subjektivität na primeira Crítica de Kant, as suas significações epistemológicas e práticas e a maneira como ela responde à invenção de uma posição radicalmente construtivista em filosofia. O sujeito é, acima de tudo, uma atividade formal de unificação no nível teórico, uma atividade que é também a condição de possibilidade universal de toda experiência coerente. Daí o fato de que a sua realidade não é a de uma alma substancial ou a de uma subjetividade empírica, concebidas como objetos determinados. É a sua constituição como sujeito transcendental que abre a possibilidade para a ideia do sujeito como um agente livre, autor de suas próprias representações e ações.
Psicofisiologia e terapia dos afetos
Authors: Giacoia Junior Oswaldo
Published: November 2020

O presente trabalho tem como principal objetivo apresentar a psicofisiologia de Nietzsche como terapia dos afetos, filosoficamente articulada como tentativa de transvaloração da metanoia (μετανοια) cristã.
O não-idêntico como excesso e transformação. Dialética negativa e crítica do idealismo hegeliano em Theodor W. Adorno
Authors: Petrechen Kugnharski Gabriel
Published: November 2020

Este artigo aborda os motivos centrais da Dialética Negativa de Theodor W. Adorno tomando como referência a crítica do idealismo. Pretendemos mostrar como a crítica do idealismo não é apenas um elemento dentre outros, mas sim aquele estruturador do que Adorno entende por “dialética negativa”. Ao apontar para um diagnóstico de tempo presente no qual as possibilidades de transformação social por meio da práxis encontram-se bloqueadas, o teórico crítico irá insistir em uma transformação das categorias filosóficas por meio das quais a realidade pode ser interpretada. No cerne dessa transformação encontramos a crítica da dialética hegeliana, sobretudo ao seu elemento idealista, do qual uma dialética negativa (entendida como “materialista”), deve abdicar, e também uma “volta” a Kant. Nesse ponto, a categoria do não-idêntico possui um papel-chave na concepção de dialética defendida por Adorno, e deve marcar a transição de um primado do sujeito para um primado do objeto.
Ciência e magia
Authors: Weil Eric , Castelo Branco Judikael , Costeski Evanildo
Published: November 2020

Tradução de texto inédito de Eric Weil. Nele, o autor realiza um exercício de metafilosofia ao confrontar dois discursos alternativos de horizonte de sentido: a magia, pela qual Weil se interessou no início da própria formação, quando se dedicou aos estudos de filosofia do período da Renascença italiana, e a ciência, que configura nosso saber e nosso fazer na modernidade.
Hegel feiticeiro? Observações sobre a crítica de Eric Voegelin a Hegel
Authors: Vivan Eichenberger Hernandez
Published: November 2020

o presente texto visa reconstruir a interpretação de Eric Voegelin a respeito de Hegel, tomado como representante destacado da vertente gnóstica. De início, o texto procede à reconstituição da tese de Voegelin, salientando em que sentido Hegel poderia ser descrito como um feiticeiro. Na sequência, apresenta uma anticrítica à maneira como Hegel é compreendido enfocando como os conceitos que caracterizam a filosofia hegeliana não são esclarecidos pela abordagem de Voegelin. Por fim, expande essa anticrítica de maneira a tentar demonstrar qual é a fonte da interpretação de Voegelin, a saber, na visão de mundo conservadora que informa os seus pressupostos.
Duas teses sobre a evidência: o “duplo deslocamento” propedêutico à fenomenologia de Husserl
Authors: Côrtes Tourinho Carlos Diógenes
Published: November 2020

O presente artigo aborda duas teses principais sobre a evidência em Husserl. A primeira delas afirma que a evidência é o “primeiro princípio metódico” a reger a investigação de um objeto, ao passo que a segunda afirma que “toda evidência predicativa implica em uma evidência pré-predicativa”. No exame da primeira, encontramos o que assegura a passagem da “presunção” a “presença” de algo visado; já a segunda supõe uma reflexão sobre o alcance e limite da evidência, revelando-nos o deslocamento da percepção sensível para a percepção categorial. Se a primeira tese consiste em uma lição preliminar sobre o método fenomenológico, a segunda contém a descoberta da intuição categorial e sua relação com a experiência pré-predicativa.
When the Landscape of the Face is Hidden from Us
Authors: Horta Paula
Published: November 2020

How do we respond to the vulnerability of the Other when we do not see his face? How do photographer and viewers position themselves ethically in relation to the (hi)story of suffering they are called to witness? These are the questions that steer my reflection about Jillian Edelstein’s unpublished photograph of Archbishop Desmond Tutu. Taken shortly after the South African Truth and Reconciliation Commission (TRC) completed its work, the photograph evokes the moment during the TRC hearings when the Archbishop, Chairman of the commission, laid down his head and wept. Drawing on Emmanuel Levinas’s conceptualization of “the face”; I discuss how affect is produced within and through Edelstein’s photograph, and specifically how the affective quality of the photograph both contributes to an understanding of the experience of suffering within the context of the TRC and summons an ethical response from the viewer.

Keywords: Desmund Tutu, Emmanuel Levinas, gesture and photography, Jillian Edelstein, photography portrait
The Execution of Bin Laden in Images
Authors: Shah Chinar
Published: November 2020

The photo essay illustrates the politics of missing visuals from the public domain and analysis of the artist’s book Bin Laden Situation Room. The book is a reaction to the photograph issued on 2 May 2011 by the American government at the time of Bin Laden’s execution. The image taken by the official White House photographer Pete Souza, depicts president Barack Obama and his national security team witnessing the execution of Osama Bin Laden, the leader of the Islamic militant organization, al-Qaeda. Apart from this the American government did not issue any other visual evidence of the event. The essay explores war strategies of keeping the visuals mute, and in doing so, controlling the public opinion. Photography that prides itself on representing and uncovering historical moments, completely fails here. The book Bin Laden Situation Room, attempts to look for what the image fails to show. The essay examines the visibility and invisibility of frames of references and power to see and not see. Keywords: Bin Laden, missing images, photo book, photography, situation room
Typomorphic gold features as criteria of placer association with primary gold-silver-type sources (example from Mnogovershinnoye ore placer cluster)
Authors: Yablokova Svetlana , Samosorov Georgiy , Pozdnyakova Natalia
Published: November 2020

A comprehensive study of native gold from Mnogovershinnoye gold cluster ores and placers (granulometry, crystal morphology, internal structure, nature of exogenetic transformations, fineness and trace element composition) was performed to define placer association with primary sources. Using ICP-MS method and X-ray spectrographic analysis, new data on geochemical gold features was obtained, which expands and clarifies the evidence of gold typomorphism from a gold-silver deposit primary source and its association with placers.