Designing Pair of Nonlinear Components of a Block Cipher over Gaussian Integers

In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Gaussian integers(GI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.But the prime field dependent on the Elliptic curve(EC)provides one S-box at a time by fixing three parameters a,b,and p.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.

Nonlinear Components of a Block Cipher over Eisenstein Integers

In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves,chaotic maps,and Gaussian integers has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Eisenstein integers(EI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.However,in the same way,by taking three fixed parameters only one S-box is obtained through a prime field-dependent Elliptic curve(EC),chaotic maps,and Gaussian integers.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.

Preliminary Identification of a Prime Number Other Than 2 and 3, the Origin of Twin Prime Numbers, the Structure of the Chain of Prime Numbers and the Set of Prime Numbers Less Than a Given Integer

The application of the Euclidean division theorem for the positive integers allowed us to establish a set which contains all the prime numbers and this set we called it set of supposedly prime numbers and we noted it Esp. We subsequently established from the previous set the set of non-prime numbers (the set of numbers belonging to this set and which are not prime) denoted Enp. We then extracted from the set of supposedly prime numbers the numbers which are not prime and the set of remaining number constitutes the set of prime numbers denoted Ep. We have deduced from the previous set, the set of prime numbers between two natural numbers. We have explained during our demonstrations the origin of the twin prime numbers and the structure of the chain of prime numbers.

The Ordinal Interpretation of the Integers and Its Use in Number Theory

The author recently published a paper which claimed that an ordinal interpretation of numbers had limited applicability for cryptography. A further examination of this subject, in particular to what extent an ordinal interpretation is useful for recurrence sequences, is needed. Hilbert favored an interpretation of the natural numbers that placed their ordinal properties prior to their cardinal properties [1] [2]. The author examines ordinal uses of the integers in number theory in order to discuss the possibilities and limitations of this approach. The author hopes this paper will be useful in clarifying or even correcting some matters that were discussed in his paper of January of 2018. I was trained informally in philosophical realism, and while I think idealism too has a place, at this time in my life I believe that the weight of evidence and usefulness is more on the side of philosophical materialism. I hope this discussion will help supplement for my readers the material in Number in Mathematical Cryptography. I still maintain that a lack of clarity on these matters has hindered progress in cryptography;and it has taken time for me to better understand these things. I hope others who have interest and ability will assist in making these matters clearer. My intention was to work in pure mathematics, and the transition to an applied mindset was difficult for me. As a result, I feel most comfortable in a more middle-of-the road attitude, but have had to slowly move to a more precise analysis of the physical quantities involved. I hope my readers will be patient with my terminology, which is still evolving, and my discussion of things which are more indirectly related, and which are necessary for my expression. These are important things for the mathematical community to understand, and I hope smarter and more knowledgeable people will address my errors, and improve upon the things I might have correct. I am discussing sequences which are sometimes a use of both ordinal and cardinal numbers.

Information Protection Based on Extraction of Square Roots of Gaussian Integers

A cryptosystem based on computation of square roots of complex integers modulo composite n is described in this paper. This paper provides an algorithm extracting a square root of Gaussian integer. Various properties of square roots and a method for finding Gaussian generators are demonstrated. The generators can be instrumental in constructing other cryptosystems. It is shown how to significantly reduce average complexity of decryption per each block of ciphertext.

Cubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication

There are settings where encryption must be performed by a sender under a time constraint. This paper de-scribes an encryption/decryption algorithm based on modular arithmetic of complex integers called Gaus-sians. It is shown how cubic extractors operate and how to find all cubic roots of the Gaussian. All validations (proofs) are provided in the Appendix. Detailed numeric illustrations explain how to use the method of digital isotopes to avoid ambiguity in recovery of the original plaintext by the receiver.

On the Line Graph of the Complement Graph for the Ring of Gaussian Integers Modulo n

The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete characterization of Hamiltonian, Eulerian, planer, regular, locally and locally connected is given. The chromatic number when is a power of a prime is computed. Further properties for and are also discussed.

Terminating Cycles for Iterated Difference Values of Four—Digit Integers

1. Introduction Since D. R. Kaprekar discoverd the interesting property of the number 6174 an interesting mathematical model has been developed:

Positive integers possessing a weak order

Let m be a positive integer, g(m) be the number of integers t for which 1≤t≤m and there does not exist a positive integer n satisfying (t=t(n))t~ n+1 ≡t(modm).For a number x≥3, letG(x)=∑m≤xg(m).In this paper, we obtain the asymptotic formula:G(x)=αx^2+O(xlogx),as x→∞. Our result improves the corresponding result with an error term O(xlog^2x) of Yang Zhaohua obtained in 1986.

Dimensionality reduction model based on integer planning for the analysis of key indicators affecting life expectancy

Purpose:Exploring a dimensionality reduction model that can adeptly eliminate outliers and select the appropriate number of clusters is of profound theoretical and practical importance.Additionally,the interpretability of these models presents a persistent challenge.Design/methodology/approach:This paper proposes two innovative dimensionality reduction models based on integer programming(DRMBIP).These models assess compactness through the correlation of each indicator with its class center,while separation is evaluated by the correlation between different class centers.In contrast to DRMBIP-p,the DRMBIP-v considers the threshold parameter as a variable aiming to optimally balances both compactness and separation.Findings:This study,getting data from the Global Health Observatory(GHO),investigates 141 indicators that influence life expectancy.The findings reveal that DRMBIP-p effectively reduces the dimensionality of data,ensuring compactness.It also maintains compatibility with other models.Additionally,DRMBIP-v finds the optimal result,showing exceptional separation.Visualization of the results reveals that all classes have a high compactness.Research limitations:The DRMBIP-p requires the input of the correlation threshold parameter,which plays a pivotal role in the effectiveness of the final dimensionality reduction results.In the DRMBIP-v,modifying the threshold parameter to variable potentially emphasizes either separation or compactness.This necessitates an artificial adjustment to the overflow component within the objective function.Practical implications:The DRMBIP presented in this paper is adept at uncovering the primary geometric structures within high-dimensional indicators.Validated by life expectancy data,this paper demonstrates potential to assist data miners with the reduction of data dimensions.Originality/value:To our knowledge,this is the first time that integer programming has been used to build a dimensionality reduction model with indicator filtering.It not only has applications in life expectancy,but also has obvious advantages in data mining work that requires precise class centers.

A Recursive High Payload Reversible Data Hiding Using Integer Wavelet and Arnold Transform

Reversible data hiding is an information hiding technique that requires the retrieval of the error free cover image after the extraction of the secret image.We suggested a technique in this research that uses a recursive embedding method to increase capacity substantially using the Integer wavelet transform and the Arnold transform.The notion of Integer wavelet transforms is to ensure that all coefficients of the cover images are used during embedding with an increase in payload.By scrambling the cover image,Arnold transform adds security to the information that gets embedded and also allows embedding more information in each iteration.The hybrid combination of Integer wavelet transform and Arnold transform results to build a more efficient and secure system.The proposed method employs a set of keys to ensure that information cannot be decoded by an attacker.The experimental results show that it aids in the development of a more secure storage system and withstand few tampering attacks The suggested technique is tested on many image formats,including medical images.Various performance metrics proves that the retrieved cover image and hidden image are both intact.This System is proven to withstand rotation attack as well.

有限域上三次型零点个数的p-adic估计

研究有限域上三次型零点个数的p-adic估计问题.改进了经典的Chevalley-Warning定理和Ax-Katz定理关于这类超曲面有理点的估计.

STANCU POLYNOMIALS BASED ON THE Q-INTEGERS

A new generalization of Stancu polynomials based on the q-integers and a nonnegative integer s is firstly introduced in this paper. Moreover, the shape-preserving and convergence properties of these polynomials are also investigated.

Optimal integration of solar home systems and appliance scheduling for residential homes under severe national load shedding

In developing countries like South Africa,users experienced more than 1030 hours of load shedding outages in just the first half of 2023 due to inadequate power supply from the national grid.Residential homes that cannot afford to take actions to mitigate the challenges of load shedding are severely inconvenienced as they have to reschedule their demand involuntarily.This study presents optimal strategies to guide households in determining suitable scheduling and sizing solutions for solar home systems to mitigate the inconvenience experienced by residents due to load shedding.To start with,we predict the load shedding stages that are used as input for the optimal strategies by using the K-Nearest Neighbour(KNN)algorithm.Based on an accurate forecast of the future load shedding patterns,we formulate the residents’inconvenience and the loss of power supply probability during load shedding as the objective function.When solving the multi-objective optimisation problem,four different strategies to fight against load shedding are identified,namely(1)optimal home appliance scheduling(HAS)under load shedding;(2)optimal HAS supported by solar panels;(3)optimal HAS supported by batteries,and(4)optimal HAS supported by the solar home system with both solar panels and batteries.Among these strategies,appliance scheduling with an optimally sized 9.6 kWh battery and a 2.74 kWp panel array of five 550 Wp panels,eliminates the loss of power supply probability and reduces the inconvenience by 92%when tested under the South African load shedding cases in 2023.

Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem

The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given.

洪水过程线同频放大混合整数规划模型

当设计洪水峰、量关系较差时,设计洪水过程线同频放大会出现明显的畸形。构建了设计洪水过程线同频放大混合整数规划模型,以洪水过程线各时段流量作为决策变量,提出了时序系列光滑度函数,并以此作为目标函数,以设计洪峰流量、不同时段设计洪量作为约束条件,首次加入了涨落同向约束条件,保证设计和典型洪水过程线具备相近模式。实例研究表明,当设计洪水峰、量关系不协调时,此模型计算的设计洪水过程线顺滑、各频率之间无交叉,与典型洪水过程线(特别在洪峰附近时段保持)相近模式。研究成果为设计洪水过程线同频放大提供了新的、可行的方法。

不确定需求下物流配送网点选址多目标优化及仿真

物流配送需求的不确定性导致物流配送成本波动,增加了物流企业配送管理的难度,加剧了“最后一公里”末端配送不畅。以降低末端物流配送成本和缩短配送时间为优化目标,考虑快递包裹数量不确定情况下末端配送的运力水平和配送覆盖区域人口密度因素,提出了一种基于“0-1”整数规划模型的多重目标优化策略,建立了物流配送中心的动态选址模型,并用Anylogic进行了仿真验证。研究结果表明,在配送包裹数量短期大幅度波动的情况下,末端配送运力水平、网点位置和服务能力需要有差别调整才能达到降本增效的目的。

合作环境下共享枢纽选址决策与优化

针对多承运商联合选址及枢纽共享决策与优化问题,从横向合作角度出发,以总成本最小为目标,分别构建共享及非共享情形下,考虑多分配模式且有容量限制的枢纽选址模型,并分析企业共享决策对运作成本的影响。结果表明:共享枢纽网络在一定条件下比不共享枢纽网络更能节约成本,共享的额外补充成本直接影响着承运商的共享决策及枢纽选址的优化效果;随机式分布对额外补充成本因子相对不敏感,合理规划初始枢纽选址并适当地调整补充成本因子,有助于枢纽网络实现成本控制目标。该研究可对物流网络枢纽选址及合作决策的制定提供参考。

基于装卸顺序的中型机多航段协同配载优化

多航段、多经停的航空货运航班,飞行过程中需要合理控制飞机的重心(CG)位置,保持平衡状态,中转站装卸操作过程中需要避免额外装卸操作,减少时间和劳力浪费,因此,研究多航段航班的协同配载问题具有重要现实意义。根据航空器自身特点与集装器(ULD)装卸顺序,结合各航段飞机装载平衡与过站机场ULD装卸操作要求,通过协调分配各航段ULD和散货位置,建立了中型机联程航班多目标整数线性规划模型。模型考虑了ULD和散货的质量、体积及与舱位的匹配限制,航空器限重、舱位限重、舱位及区域累积限重、上下舱联合限重和CG位置的平衡限制,以及前后航段ULD和散货的连接性约束。根据造成中间机场额外装卸操作的2种原因,基于装卸顺序,提出装卸优化模型,通过ULD的舱内平移,优化了CG,减少了装卸次数。以B757-200F机型为例,在两装一卸、一装两卸和两装两卸3种场景下,采用商用求解器Gurobi,分别针对3种不同目标函数组合进行求解和分析对比。实验表明:所提模型可以有效协调过站货物的额外装卸次数,优化前后两航段的CG位置。