<abstract><title style='display:none'>Abstract</title>The most commonly used methods for solving classical (historical) ciphers are based on global optimization (meta-heuristic methods). Despite the fact that global optimization is a well-studied problem, in the case of classical ciphers, there are still many open questions such as the construction of fitness functions or efficient transformation of the cryptanalysis (breaking attempt) to an optimization problem. Therefore the transformation of a cryptanalytical task to an optimization problem and the choice of a suitable fitness function form an important part of the topic. In this paper, we focus on the simple columnar transposition in depth. Our main contribution is a detailed analysis and comparison of different fitness functions, fitness landscape analysis and solving experiments.</abstract>

Cryptanalysis of the Columnar Transposition Using Meta-Heuristics

<abstract><title style='display:none'>ABSTRACT</title>The k-nearest neighbour kernel density estimationmethod is a special type of the kernel density estimation method with the local choice of the bandwidth. An advantage of this estimator is that smoothing varies according to the number of observations in a particular region. The crucial problem is how to estimate the value of the parameter k. In the paper we discuss the problem of choosing the parameter k in a way that minimizes the value of the asymptotic mean integrated square error (AMISE). We define the class of the modified cosine densities that meet the requirements given by the AMISE. The results are compared in a simulation study.</abstract>

K-nearest neighbour kernel density estimation, the choice of optimal k

<abstract><title style='display:none'>Abstract</title> In short rate models, bond prices and term structures of interest rates are determined by the parameters of the model and the current level of the instantaneous interest rate (so called short rate). The instantaneous interest rate can be approximated by the market overnight, which, however, can be influenced by speculations on the market. The aim of this paper is to propose a calibration method, where we consider the short rate to be a variable unobservable on the market and estimate it together with the model parameters for the case of the Vasicek model</abstract>

Estimating the Short Rate from the Term Structures in the Vasicek Model

<abstract><title style='display:none'>Abstract</title>This article deals with the damaged and incomplete Old Babylonian tablet <italic>Plimpton 322</italic> which contains 4 columns and 15 rows of a cuneiform mathematical text. It has been shown that the presumed original table with its 7 columns and 39 rows represented: a table of square roots of numbers from 0 to 2 for mathematicians; an earliest rudiments of a trigonometric table for builders and surveyors where angles are not measured as an arc in a unit circle but as a side of a unit right-angled triangle; a list of the 39 exercises on reciprocal pairs, unit and integer-side right triangles (rectangles), factorization and square numbers for teachers.The article provides new arguments in favor of old disputes (squares of diagonals or widths; mistakes in previous analysis of errors in <italic>P322</italic>). Contradictory ideas about <italic>P322</italic> are discussed: Is it the table of triangle sides or factorization terms? Was it compiled by a parallel or independent factorization of the sides or of their squares? Are sides of an initial unit triangle enlarged or reduced by such a factorization? Does it contain two or four arithmetical errors?Time and dimensional requirements for calculation and writing of the complete tablet have been also estimated.</abstract>

<italic>Plimpton 322</italic> : A Universal Cuneiform Table for Old Babylonian Mathematicians, Builders, Surveyors and Teachers

<abstract><title style='display:none'>Abstract</title> In this note the usual Goursat lemma, which describes subgroups of the direct product of two groups, is generalized to describing subgroups of a direct product A1 × A2 × · · · × An of a finite number of groups. Other possible generalizations are discussed and applications characterizing several types of subgroups are given. Most of these applications are straightforward, while somewhat deeper applications occur in the case of profinite groups, cyclic groups, and the Sylow p-subgroups (including infinite groups that are virtual p-groups).</abstract>

Department of Mathematics and Statistics University of Calgary Calgary, Alberta CANADA T2N 1N4

Department of Mathematics and Statistics Indian Institute of Technology Kanpur INDIA

A generalized Goursat lemma

<abstract><title style='display:none'>ABSTRACT</title>We describe the background of the Zodiac killer’s cipher, and present a strategy for how to attack the unsolved Z340 cipher. We present evidence that there is a high degree of non-randomness in the sequence of ciphertext symbols in this cipher, suggesting it has been constructed in a systematic way. Next, we use this information to design a tool for solving the Zodiac ciphers. Using this tool we are able to re-solve the known Z408 cipher.</abstract>

Department of Informatics, University of Bergen, N–5020 Bergen, NORWAY

Department of Applied Informatics, Information Technology, Slovak University of Technology, Ilkoviˇcova 3, SK–812-19 Bratislava, SLOVAKIA

The zodiac killer ciphers

<abstract>
<title style='display:none'>Abstract</title>
In this article, some under-appreciated characteristics of strongly star-Rothberger subsets are explored. Additionally, with the aid of the SSI property and MSSI property, semi-Rothberger and star semi-Rothberger spaces are represented by families of closed sets. Finally, several selection principle like attributes are produced that can reflect the previously mentioned sequential covering features in an inverted form.
</abstract>

Some Alternative Interpretations of Strongly Star Semi-Rothberger and Related Spaces

<abstract>
<title style='display:none'>Abstract</title>
We define and study a Banach-space-valued Nemytskiĭ operator and we find vector measure solutions for associated non-linear initial value problems.
</abstract>

The Nemytskiĭ Operator and Vector Measure Solutions for Non-Linear Initial Value Problems

<abstract>
<title style='display:none'>Abstract</title>
In this article, we are interested in the study of a class of stochastic functional differential systems driven by <italic>G</italic>-Brownian motion with infinite delay. We prove the existence and uniqueness of the solutions when two basic conditions are met: the linear growth condition and the Lipschitz condition.
</abstract>

Existence Result for a Stochastic Functional Differential System Driven by G-Brownian Motion with Infinite Delay

<abstract>
<title style='display:none'>Abstract</title>
Ascon is a family of lightweight authenticated encryption and hashing algorithms, which is a finalist in the NIST Lightweight Cryptography competition. We study the Ascon algorithm from the perspective of algebraic cryptanalysis based on the MRHS representation of the cipher. We call such an approach an MRHS cryptanalysis.
We represent the system on the gate level (focusing on individual AND-gates) and the S-box level (basing MRHS equations on 5-bit S-boxes). We compare the results from the application of two custom MRHS solvers. The RZ solver is based on linear algebra and exhaustive search. The HC solver is based on adaptive bit-flipping with restarts.
We show that both the choice of the solver and the choice of the system representation influence the total complexity of the attack. On the other hand, these choices do not change the fundamental properties of the attack, such as scaling with the amount of information the attacker possesses. A similar assessment holds for using a scaled-down version of Ascon for the experiments. Our method can be used for the experimental evaluation of cipher designs against algebraic attacks.
</abstract>

Algebraic Cryptanalysis of Ascon Using MRHS Equations

<abstract>
<title style='display:none'>Abstract</title>
In this paper, we present full characterizations of variationally McShane and Pettis integrable multifunctions in terms of the cubic derivative and the variational McShane measure of additive interval multifunctions.
</abstract>

Variational Mcshane and Pettis Integrals of Multifunctions

<abstract>
<title style='display:none'>Abstract</title>
In this paper, we discuss the existence, uniqueness and stability of mild solutions of time-dependent impulsive neutral stochastic partial integrodifferential equations with the Rosenblatt process and Poisson jumps. The existence of mild solutions for the equations is discussed by means of the semigroup theory and theory of the resolvent operator. Next, under some sufficient conditions, the results are obtained by using the method of successive approximation and Bihari’s inequality. Finally, an example is provided to illustrate our results.
</abstract>

Existence and Stability Results for Time-Dependent Impulsive Neutral Stochastic Partial Integrodifferential Equations with Rosenblatt Process and Poisson Jumps

<abstract><title style='display:none'>ABSTRACT</title>Random number generators represent one of basic cryptographic primitives used in creating cryptographic protocols. Their security evaluation represents very important part in the design, implementation and employment phase of the generator. One of important security requirements is the existence of a mathematical model describing the physical noise source and the statistical properties of the digitized noise derived from it. The aim of this paper is to propose the model of a class of generators using two jittery clocks with rationally related frequencies. The clock signals with related frequencies can be obtained using phase-locked loops, delay-locked loops or ring oscillators with adjusted oscillation periods. The proposed mathematical model is used to provide entropy per bit estimators and expected bias on the generated sequence. The model is validated by hardware experiments.</abstract>

Mathematical model of physical RNGs based on coherent sampling

<abstract><title style='display:none'>Abstract</title> Symmetric block ciphers are the most widely used cryptographic primitives. In addition to providing privacy, block ciphers are used as basic components in the construction of hash functions, message authentication codes, pseudorandom number generators, as a part of various cryptographic protocols, etc. Nowadays the most popular block cipher is AES (Advanced Encryption Standard). It is used as a standard of symmetric encryption in many countries. Several years ago it was found a theoretical attack exploiting the AES key expansion algorithm that allows reducing significantly the complexity comparing to the brute force attack. This article presents an advanced method of finding the number of active substitutions that helps to estimate the security of encryption algorithms against related-key attacks. The method was applied to a prospective block cipher, which is a candidate for the Ukrainian standard</abstract>

Department of Information Technologies Security Faculty of Computer Engineering and Control Kharkiv National University of Radioelectronics Lenin’s av., 14 Kharkiv UKRAINE

Department of Informatics Faculty of Mathematics and Natural Sciences University of Bergen Postboks 7803, N-5020 Bergen NORWAY

A Method for Security Estimation of the Spn-Based Block Cipher Against Related-Key Attacks

<abstract><title style='display:none'>Abstract</title> McEliece cryptosystem (MECS) is one of the oldest public key cryptosystems, and the oldest PKC that is conjectured to be post-quantum secure. In this paper we survey the current state of the implementation issues and security of MECS, and its variants. In the first part we focus on general decoding problem, structural attacks, and the selection of parameters in general. We summarize the details of MECS based on irreducible binary Goppa codes, and review some of the implementation challenges for this system. Furthermore, we survey various proposals that use alternative codes for MECS, and point out some attacks on modified systems. Finally, we review notable existing implementations on low-resource platforms, and conclude with the topic of side channels in the implementations of MECS</abstract>

Institute of Computer Science and Mathematics Faculty of Electrical Engineering and Information Technology Slovak University of Technology in Bratislava Ilkovicova 3 SK–812-19 Bratislava SLOVAKIA

Institute of Computer Science and Mathematics Faculty of Electrical Engineering and Information Technology Slovak University of Technology in Bratislava Ilkovicova 3 SK-812-19 Bratislava SLOVAKIA

Overview of the Mceliece Cryptosystem and its Security

<abstract><title style='display:none'>Abstract</title>Homomorphic encryption enables various calculations while preserving the data confidentiality. In this paper, we apply the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure matrix multiplication between two matrices. To reduce both the ciphertext size and the computation cost, we propose a new method to pack a matrix into a single ciphertexts so that it also enables efficient matrix multiplication over the packed ciphertexts. Our packing method generalizes Yasuda et al.’s methods (Security Comm. Networks 2015 and ACISP 2015), which are for secure inner product. We also implement our methods and give a comparison with previous packing methods.</abstract>

Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption

<abstract><title style='display:none'>ABSTRACT</title> We introduce the Weibull distributions in presence of cure fraction, censored data and covariates. Two models are explored in this paper: mixture and non-mixture models. Inferences for the proposed models are obtained under the Bayesian approach, using standard MCMC (Markov Chain Monte Carlo) methods. An illustration of the proposed methodology is given considering a life- time data set.</abstract>

Department of Social Medicine—FMRP University of S˜ao Paulo Ribeir˜ao Preto, SP BRAZIL

Josmar Mazucheli Department of Statistics University of Maring´a Paran´a BRAZIL

Cure fraction models using mixture and non-mixture models

<abstract><title style='display:none'>Abstract</title> The aim of this paper is to study the oscillation of the second order advanced neutral differential equations <disp-formula><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="../graphic/v10127-011-0006-4#0007_graphic1.png"/></disp-formula>. (E)Obtained results are based on the new comparison theorems that enable us to reduce problem of the oscillation of the second order equation to the the oscillation of the first order equations. Obtained comparison principles essentially simplify the examination of the studied equations.</abstract>

Oscillation theorems for second order advanced neutral differential equations

Tatra Mountains Mathematical Publications

The Journal of Slovak Academy of Sciences

 The journal publishes original contributions in all fields of mathematical research, especially collections of papers on single topic.  Archiving ...

Cite Score

SNIP

MNiSW

Google Scholar h5-index

Google Scholar h5-median

 The journal publishes original contributions in all fields of mathematical research, especially collections of papers on single topic. ...