Question: CAES Cryptosystem: Detailed Security Evaluations and Outcomes

This document explores the evaluation of random and pseudorandom number generators, focusing on their cryptographic applications. It introduces a comprehensive Statistical Test Suite designed specifically for assessing the quality of these generators in cryptographic contexts, detailed in the NIST Special Publication. The document further discusses the practical software implementation of this test suite, outlining the protocols for output interpretation. Additionally, it shares insights gained from applying these tests to various random and pseudorandom generators, providing real-world examples of their performance and reliability in cryptographic scenarios. This analysis is crucial for ensuring the robustness and security of cryptographic systems that rely on these generators for key generation and other critical operations.

In this paper, we present a timing attack against the RSACRT algorithm used in the current version 1.1.4 of PolarSSL, an opensource cryptographic library for embedded systems. This implementation uses a classical countermeasure to avoid two previous attacks of Schindler and another one due to Boneh and Brumley. However, a careful analysis reveals a bias in the implementation of Montgomery multiplication. We theoretically analyse the distribution of output values for Montgomery multiplication when the output is greater than the Montgomery constant, R. In this case, we show that an extra bit is set in the top most significant word of the output and a time variance can be observed. Then we present some proofs with reasonable assumptions to explain this bias due to an extra bit. Moreover, we show it can be used to mount an attack that reveals the factorisation. We also study another countermeasure and show its resistance against attacked library.

Bit coin is the first digital currency to see widespread adoption. While payments are conducted between pseudonyms, Bit coin cannot offer strong privacy guarantees: payment transactions are recorded in a public decentralized ledger, from which much information can be deduced. Zero coin (Miers et al., IEEE S&P 2013) tackles some of these privacy issues by unlinking transactions from the payment's origin. Yet, it still reveals payments' destinations and amounts, and is limited in functionality. In this paper, we construct a full-fledged ledger-based digital currency with strong privacy guarantees. Our results leverage recent advances in zero-knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs). First, we formulate and construct decentralized anonymous payment schemes (DAP schemes). A DAP scheme enables users to directly pay each other privately: the corresponding transaction hides the payment's origin, destination, and transferred amount. We provide formal definitions and proofs of the construction's security. Second, we build Zero cash, a practical instantiation of our DAP scheme construction. In Zero cash, transactions are less than 1 kB and take under 6 ms to verify - orders of magnitude more efficient than the less-anonymous Zero coin and competitive with plain Bit coin.

Cryptographic applications often run more than one independent algorithm such as encryption and authentication. This fact provides a high level of parallelism which can be exploited by software and converted into instruction level parallelism to improve overall performance on modern super-scalar processors. We present fast and efficient methods of computing such pairs of functions on IA processors using a method called " function stitching ". Instead of computing pairs of functions sequentially as is done today in applications/libraries, we replace the function calls by a single call to a composite function that implements both algorithms. The execution time of this composite function can be made significantly shorter than the sums of the execution times for the individual functions and, in many cases, close to the execution time of the slower function. Function stitching is best done at a very fine grain, interleaving the code for the individual algorithms at an instruction-level granularity. This results in excellent utilization of the execution resources in the processor core with a single thread. We show how stitching pairs of functions together in a fine-grained manner results in excellent performance on IA processors. Currently, applications perform the functions sequentially. We demonstrate performance gains of 1.4X-1.9X with stitching over the best sequential function performance. We show performance results achieved by this method on the Intel ® processors based on the Westmere architecture.

The Montgomery kP algorithm using Lopez-Dahab projective coordinates is a time and energy efficient way to perform the elliptic curve point multiplication. It even can provide resistance against simple power analysis attacks. Nevertheless, straight forward implementations of this algorithm are not resistant against differential power analysis attacks. But highly-efficient designs i.e. designs in which different functional units are operating in parallel can increase the resistance of ECC implementations against DPA. In this paper we demonstrate this fact on the examples of our 6 implementations of the Montgomery kP algorithm. We perform horizontal DPA attacks to demonstrate the fact that the resistance of the kP algorithm against side channel analysis attacks can be increased through its implementation as an efficient design.

High-throughput and area-efficient designs of hash functions and corresponding mechanisms for Message Authentication Codes (MACs) are in high demand due to new security protocols that have arisen and call for security services in every transmitted data packet. For instance, IPv6 incorporates the IPSec protocol for secure data transmission. However, the IPSec's performance bottleneck is the HMAC mechanism which is responsible for authenticating the transmitted data. HMAC's performance bottleneck in its turn is the underlying hash function. In this article a high-throughput and small-size SHA-256 hash function FPGA design and the corresponding HMAC FPGA design is presented. Advanced optimization techniques have been deployed leading to a SHA-256 hashing core which performs more than 30% better, compared to the next better design. This improvement is achieved both in terms of throughput as well as in terms of throughput/area cost factor. It is the first reported SHA-256 hashing core that exceeds 11Gbps (after place and route in Xilinx Virtex 6 board).

This paper describes high performance single-chip FPGA implementations of the new Advanced Encryption Standard (AES) algorithm, Rijndael. The designs are implemented on the Virtex-E FPGA family of devices. FPGAs have proven to be very effective in implementing encryption algorithms. They provide more flexibility than ASIC implementations and produce higher data-rates than equivalent software implementations. A novel, generic, parameterisable Rijndael encryptor core capable of supporting varying key sizes is presented. The 192-bit key and 256-bit key designs run at data rates of 5.8 Gbits/sec and 5.1 Gbits/sec respectively. The 128-bit key encryptor core has a throughput of 7 Gbits/sec which is 3.5 times faster than similar existing hardware designs and 21 times faster than known software implementations, making it the fastest single-chip FPGA Rijndael encryptor core reported to date. A fully pipelined single-chip 128-bit key Rijndael encryptor/decryptor core is also presented. This design runs at a data rate of 3.2 Gbits/sec on a Xilinx Virtex-E XCV3200E-8-CG1156 FPGA device. There are no known singlechip FPGA implementations of an encryptor/decryptor Rijndael design.

In three-party authenticated key exchange protocols, each client shares a secret only with a trusted server with assists in generating a session key used for securely sending messages between two communication clients. Compared with two-party authenticated key exchange protocols where each pair of parties must share a secret with each other, a three-party protocol does not cause any key management problem for the parties. In the literature, mainly there exist three issues in three-party authenticated key exchange protocols are discussed that need to be further improved: (1) to reduce latency, communication steps in the protocol should be as parallel as possible; (2) as the existence of a security-sensitive table on the server side may cause the server to become compromised, the table should be removed; (3) resources required for computation should be as few as possible to avoid the protocol to become an efficiency bottleneck. In various applications over networks, a quick response is required especially by light-weight clients in the mobile e-commerce. In this paper, a roundand computation-efficient three-party authenticated key exchange protocol is proposed which fulfils all of the above mentioned requirements. 2007 Elsevier Inc. All rights reserved.

The most common way of constructing a hash function (e.g., SHA-1) is to iterate a compression function on the input message. The compression function is usually designed from scratch or made out of a block-cipher. In this paper, we introduce a new security notion for hash-functions, stronger than collision-resistance. Under this notion, the arbitrary length hash function H must behave as a random oracle when the fixed-length building block is viewed as an ideal primitive. This enables to eliminate all possible generic attacks against iterative hash-functions. In this paper, we show that the current design principle behind hash functions such as SHA-1 and MD5 — the (strengthened) Merkle-Damg̊ard transformation — does not satisfy this security notion. We provide several constructions that provably satisfy this notion; those new constructions introduce minimal changes to the plain Merkle-Damg̊ard construction and are easily implementable in practice. This paper is a modified version of a paper to appear at Crypto 2005.

The Trusted Platform Module (TPM) is commonly thought of as hardware that can increase platform security. However, it can also be used for malicious purposes. The TPM, along with other hardware, can implement acloaked computation , whose memory state cannot be observed by any other software, including the operating system and hypervisor. We show that malware can use cloaked computations to hide essential secrets (like the target of an attack) from a malware analyst. We describe and implement a protocol that establishes an encryption key under control of the TPM that can only be used by a specific infection program. An infected host then proves the legitimacy of this key to a remote malware distribution platform, and receives and executes an encrypted payload in a way that prevents software visibility of the decrypted payload. We detail how malware can benefit from cloaked computations and discuss defenses against our protocol. Hardening legitimate uses of the TPM against attack improves the resilience of our malware, creating a Catch-22 for secure computing technology.

This research study proposes Hybrid Encryption System using new public key algorithm and private key algorithm. A hybrid cryptosystem is one which combines the convenience of a public-key cryptosystem with the efficiency of a symmetrickey cryptosystem. Here, we propose a provably two way secured data encryption system, which addresses the concerns of user’s privacy, authentication and accuracy. This system has two different encryption algorithms have been used both in the Encryption and decryption sequence. One is public key cryptography based on linear block cipher another one is private key cryptography based on simple symmetric algorithm. This cryptography algorithm provides more security as well as authentication comparing to other existing hybrid algorithm.


Question: CAES Cryptosystem: Enhanced Security Evaluations and Outcomes

This paper presents the development and implementation of a novel secret key cryptosystem that encrypts and decrypts data in blocks through multiple iterations, utilizing a combination of reversible and irreversible cellular automata. Recognizing the critical importance of securing sensitive electronic data, particularly over the internet, the proposed cryptosystem aims to enhance data confidentiality and integrity. It operates within the realm of symmetric algorithms, employing a single secret key for both encryption and decryption processes. The innovation lies in the iterative nature of the encryption, where each plaintext block undergoes transformation through cellular automata, guided by a series of sub keys derived from the primary secret key. To validate the effectiveness and efficiency of the proposed scheme, it is benchmarked against the widely recognized Advanced Encryption Standard (AES) algorithm. The comparison reveals that the new cryptosystem not only withstands statistical attacks but also outperforms AES-256 in terms of speed, while maintaining high levels of confusion and diffusion, key indicators of strong cryptographic security.

Public Key Cryptography (PKC) has been the enabling technology underlying many security services and protocols in traditional networks such as the Internet. In the context of wireless sensor networks, elliptic curve cryptography (ECC), one of the most efficient types of PKC, is being investigated to provide PKC supportin sensor network applications so that the existing PKC-based solutions can be exploited. This paper presents the design, implementation, and evaluation of TinyECC, a configurable library for ECC operations in wireless sensor networks. The primary objective of TinyECC is to provide a ready-to-use, publicly available software package for ECC-based PKC operations that can be flexibly configured and integrated into sensor network applications. TinyECC provides a number of optimization switches, which can turn specific optimizations on or off based on developers' needs. Different combinations of the optimizations have different execution time andresource consumptions, giving developers great flexibility in integrating TinyECC into sensor network applications. This paperalso reports the experimental evaluation of TinyECC on several common sensor platforms, including MICAz, Tmote Sky, and Imote2. The evaluation results show the impacts of individual optimizations on the execution time and resource consumptions, and give the most computationally efficient and the most storage efficient configuration of TinyECC.

Password-Authenticated Key Exchange (PAKE) protocols allow two parties that only share a password to establish a shared key in a way that is immune to offline attacks. Asymmetric PAKE (aPAKE) strengthens this notion for the more common client-server setting where the server stores a mapping of the password and security is required even upon server compromise, that is, the only allowed attack in this case is an (inevitable) offline exhaustive dictionary attack against individual user passwords. Unfortunately, current aPAKE protocols (that dispense with the use of servers’ public keys) allow for pre-computation attacks that lead to the instantaneous compromise of user passwords upon server compromise, thus forgoing much of the intended aPAKE security. Indeed, these protocols use – in essential ways – deterministic password mappings or use random “salt” transmitted in the clear from servers to users, and thus are vulnerable to pre-computation attacks. We initiate the study of Strong aPAKE protocols that are secure as aPAKE’s but are also secure against pre-computation attacks. We formalize this notion in the Universally Composable (UC) settings and present two modular constructions using an Oblivious PRF as a main tool. The first builds a Strong aPAKE from any aPAKE (which in turn can be constructed from any PAKE [23]) while the second builds a Strong aPAKE from any authenticated key-exchange protocol secure against reverse impersonation (a.k.a. KCI). Using the latter transformation, we show a practical instantiation of a UC-secure Strong aPAKE in the Random Oracle model. The protocol (“OPAQUE”) consists of 2 messages (3 with mutual authentication), requires 3 and 4 exponentiations for server and client, respectively (2 to 4 of which can be fixed-base depending on optimizations), provides forward secrecy, is PKI-free, supports user-side hash iterations, has a built-in facility for password-based storage and retrieval of secrets and credentials, and accommodates a user-transparent server-side threshold implementation.

This document describes the RC encryption algorithm a fast symmetric block cipher suitable for hardware or software imple mentations A novel feature of RC is the heavy use of data dependent rotations RC has a variable word size a variable number of rounds and a variable length secret key The encryption and decryption algorithms are exceptionally simple

In this paper, we introduce a novel and secure solution to mitigate side-channel attacks to capture the PINs like touchID and other credentials of touch-enabled devices. Our approach can protect haptic feedback enabled devices from potential direct observation techniques such as cameras and motion sense techniques including such as accelerometers in smart-watch. Both attacks use the concept of shoulder surfing in social engineering and were published recently (CCS'14 and CCS'15). Hand-held devices universally employ small vibration motors as an inexpensive way to provide haptic feedback. The strength of the haptic feedback depends on the brand and the device manufacturer. They are usually strong enough to produce sliding movement and make audible noises if the device is resting on the top of a desk when the vibration motor turns. However, when the device is held in the hand the vibration can only be sensed by the holder; it is usually impossible or uncertain for an observer to know when the vibration motor turns. Our proposed solution uses the haptic feedback to inform the internal state of the keypad to the user and takes advantage of the fact that the effect of haptic feedback can be easily cloaked in such a way that direct observation techniques and indirect sensing techniques will fail. We develop an application on Android cell phones to demonstrate it and invite users to test the code. Moreover, we use real smart-watch to sense the vibration of Android cell phones. Our experimental results show that our approach can mitigate the probability of sensing a 4-digit or 6-digit PINs using smart-watch to below practical value. Our approach also can mitigate the probability of recognizing a 4-digit or 6-digit PINs using a camera within 1 meter to below practical value because the user does not need to move his or her hand during the internal states to input different PINs.

One-time signatures (OTS) are called one-time, because the accompanying security reductions only guarantee security under single-message attacks. However, this does not imply that efficient attacks are possible under two-message attacks. Especially in the context of hash-based OTS (which are basic building blocks of recent standardization proposals) this leads to the question if accidental reuse of a one-time key pair leads to immediate loss of security or to graceful degradation. In this work we analyze the security of the most prominent hash-based OTS, Lamport’s scheme, its optimized variant, and WOTS, under different kinds of two-message attacks. Interestingly, it turns out that the schemes are still secure under two message attacks, asymptotically. However, this does not imply anything for typical parameters. Our results show that for Lamport’s scheme, security only slowly degrades in the relevant attack scenarios and typical parameters are still somewhat secure, even in case of a two-message attack. As we move on to optimized Lamport and its generalization WOTS, security degrades faster and faster, and typical parameters do not provide any reasonable level of security under two-message attacks.

In this paper we exhibit several new classes of hash functions with certain desirable properties, and introduce two novel applications for hashing which make use of these functions. One class contains a small number of functions, yet is almost universal,. If the functions hash n-bit long names into m-bit indices, then specifying a member of the class requires only O((m + log, log,(n)) . log,(n)) bits as compared to O(n) bits for earlier techniques. For long names, this is about a factor of m larger than the lower bound of m + log, n -log, m bits. An application of this class is a provably secure authentication technique for sending messages over insecure lines. A second class of functions satisfies a much stronger property than universal,. We present the application of testing sets for equality. The authentication technique allows the receiver to be certain that a message is genuine. An “enemy”-even one with infinite computer resources-cannot forge or modify a message without detection. The set equality technique allows operations including “add member to set,” “delete member from set” and “test two sets for equality” to be performed in expected constant time and with less than a specified probability of error.

This article describes and compares four approaches to storing payment keys and executing payment applications on mobile phones via near-field communication at the point of sale. Even though the comparison hinges on security--specifically, how well the keys and payment application are protected against misuse--other criteria such as hardware requirements, availability, management complexity, and performance are also identified and discussed.

In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack if factoring is difficult, and typical implementations require only 1% to 4% of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control systems.

http://dx.doi.org/10.1016/j.infsof.2014.09.012 0950-5849/ 2014 Elsevier B.V. All rights reserved. ⇑ Corresponding author at: Center of Informatics, Federal University of Pernambuco (CIn/UFPE), Av. Jornalista Anibal Fernandes, S/N, Cidade Universitária, 50. Recife, PE, Brazil. Tel.: +55 81 8250 0470. E-mail addresses: fss4@cin.ufpe.br (F. Selleri Silva), fsfs@cin.ufpe.br (F.S.F. Soares), alp5@cin.ufpe.br (A.L. Peres), ima2@cin.ufpe.br (I.M.d. Azevedo), aplfv@ci (A.P.L.F. Vasconcelos), fkk@cin.ufpe.br (F.K. Kamei), srlm@cin.ufpe.br (S.R.d.L. Meira). Fernando Selleri Silva a,b,⇑, Felipe Santana Furtado Soares , Angela Lima Peres , Ivanildo Monteiro de Azevedo , Ana Paula L.F. Vasconcelos , Fernando Kenji Kamei , Silvio Romero de Lemos Meira a,c

A major security concern with outsourcing data storage to third-party providers is authenticating the integrity and freshness of data. State-of-the-art software-based approaches require clients to maintain state and cannot immediately detect forking attacks, while approaches that introduce limited trusted hardware (e.g., a monotonic counter) at the storage server achieve low throughput. This paper proposes a new design for authenticating data storage using a small piece of high-performance trusted hardware attached to an untrusted server. The proposed design achieves significantly higher throughput than previous designs. The server-side trusted hardware allows clients to authenticate data integrity and freshness without keeping any mutable client-side state. Our design achieves high performance by parallelizing server-side authentication operations and permitting the untrusted server to maintain caches and schedule disk writes, while enforcing precise crash recovery and write access control.


Question: CAES Cryptosystem: Detailed Security Evaluations and Outcomes

This paper explores the effectiveness of differential cryptanalysis on the Feal family of encryption algorithms and the N-Hash hash function, building upon the foundational work introduced in previous studies [1,2]. Differential cryptanalysis, a technique pioneered for analyzing the Data Encryption Standard (DES) and its derivatives, is demonstrated to be equally potent against Feal and N-Hash. The paper delves into the methodology of applying differential cryptanalysis to these cryptographic systems, illustrating how chosen plaintext attacks can be transitioned into known plaintext attacks, a significant advancement in the cryptanalytic toolkit. By showcasing the vulnerabilities of Feal and N-Hash to differential cryptanalysis, the authors highlight the importance of rigorous security testing and the need for robust cryptographic design principles to withstand such sophisticated attacks. This research contributes to the ongoing dialogue on cryptographic security, emphasizing the necessity for continuous improvement and evaluation of encryption algorithms and hash functions in the face of evolving cryptanalytic techniques.

We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in constructions of the most efficient to-date identification and signature schemes with security based on the worst-case hardness of problems in ideal lattices. In particular, our ID scheme has communication complexity of around 65, 000 bits and the length of the signatures produced by our signature scheme is about 50, 000 bits. All prior lattice-based identification schemes required on the order of millions of bits to be transferred, while all previous lattice-based signature schemes were either stateful, too inefficient, or produced signatures whose lengths were also on the order of millions of bits. The security of our identification scheme is based on the hardness of finding the approximate shortest vector to within a factor of Õ(n) in the standard model, while the security of the signature scheme is based on the same assumption in the random oracle model. Our protocols are very efficient, with all operations requiring Õ(n) time. We also show that the technique for constructing our lattice-based schemes can be used to improve certain number-theoretic schemes. In particular, we are able to shorten the length of the signatures that are produced by Girault’s factoring-based digital signature scheme ([10,11,31]).

The advent of new low-power Field Programmable Gate Arrays (FPGA) for battery powered devices opens a host of new applications to FPGAs. In order to provide security on resource constrained devices lightweight cryptographic algorithms have been developed. However, there has not been much research on porting these algorithms to FPGAs. In this paper we propose lightweight cryptography for FPGAs by introducing block cipher independent optimization techniques for Xilinx Spartan3 FPGAs and applying them to the lightweight cryptographic algorithms HIGHT and Present. Our implementations are the first reported of these block ciphers on FPGAs. Furthermore, they are the smallest block cipher implementations on FPGAs using only 117 and 91 slices respectively, which makes them comparable in size to stream cipher implementations. Both are less than half the size of the AES implementation by Chodowiec and Gaj without using block RAMs. Present’s throughput over area ratio of 240 Kbps/slice is similar to that of AES, however, HIGHT outperforms them by far with 720 Kbps/slice.

Cold boot attack is a side channel attack which exploits the data remanence property of random access memory (RAM) to retrieve its contents which remain readable shortly after its power has been removed. Given the nature of the cold boot attack, only a corrupted image of the memory contents will be available to the attacker. In this paper, we investigate the use of an off-the-shelf SAT solver, CryptoMinSat, to improve the key recovery of the AES-128 key schedules from its corresponding decayed memory images. By exploiting the asymmetric decay of the memory images and the redundancy of key material inherent in the AES key schedule, rectifying the faults in the corrupted memory images of the AES-128 key schedule is formulated as a Boolean satisfiability problem which can be solved efficiently for relatively very large decay factors. Our experimental results show that this approach improves upon the previously known results.

This article describes an experience of teaching a graduate-level course in cryptography and computer security at New York University. The course content as well as lessons learned and plans for the future are discussed.

This research study proposes Hybrid Encryption System using new public key algorithm and private key algorithm. A hybrid cryptosystem is one which combines the convenience of a public-key cryptosystem with the efficiency of a symmetrickey cryptosystem. Here, we propose a provably two way secured data encryption system, which addresses the concerns of user’s privacy, authentication and accuracy. This system has two different encryption algorithms have been used both in the Encryption and decryption sequence. One is public key cryptography based on linear block cipher another one is private key cryptography based on simple symmetric algorithm. This cryptography algorithm provides more security as well as authentication comparing to other existing hybrid algorithm.

As smart, embedded devices are increasingly integrated into our daily life, the security of these devices has become a major concern. The ARM processor family, which powers more than 60% of embedded devices, introduced TrustZone technology to offer security protection via an isolated execution environment called secure world. Caches in TrustZone-enabled processors are extended with a nonsecure (NS) bit to indicate whether a cache line is used by the secure world or the normal world. This cache design improves system performance by eliminating the need to perform cache flush during world switches; however, it also enables cache contention between the two worlds. In this work, we present TruSpy, the first study of timingbased cache side-channel information leakage of TrustZone. Our proposed attack exploits the cache contention between normal world and secure world to recover secret information from secure world. Two attacks are proposed in TruSpy, namely, the normal world OS attack and the normal world Android app attack. In the OS-based attack, the attacker is able to access virtual-to-physical address translation and high precision timers. In the Android app-based attack, these tools are unavailable to the attacker, so we devise a novel method that uses the expected channel statistics to allocate memory for cache probing. We also show how an attacker might use the less accurate performance event interface as a timer. Using the T-table based AES implementation in OpenSSL 1.0.1f as an example, we demonstrate that it is possible for a normal world attacker to steal a fine-grained secret from the secure world using a timing-based cache side-channel. We can recover the full AES encryption key via either the OS-based attack or the Android app-based attack. Since our zero permission TruSpy attack is based on the cache design in TrustZone enabled ARM processors, it poses a significant threat to a wide array of devices. To mitigate the newly discovered threat, we also propose both application-based and system-oriented countermeasures.

Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorphic" encryption scheme that keeps data private, but that allows a worker that does not have the secret decryption key to compute any (still encrypted) result of the data, even when the function of the data is very complex. In short, a third party can perform complicated processing of data without being able to see it. Among other things, this helps make cloud computing compatible with privacy.

Recently, many efficient cryptographic hash function design strategies have been explored, not least because of the SHA-3 competition. These designs are, almost exclusively, geared towards high performance on long inputs. However, various applications exist where the performance on short (fixed length) inputs matters more. Such hash functions are the bottleneck in hash-based signature schemes like SPHINCS or XMSS, which is currently under standardization. Secure functions specifically designed for such applications are scarce. We attend to this gap by proposing two short-input hash functions (or rather simply compression functions). By utilizing AES instructions on modern CPUs, our proposals are the fastest on such platforms, reaching throughputs below one cycle per hashed byte even for short inputs, while still having a very low latency of less than 60 cycles. Under the hood, this results comes with several innovations. First, we study whether the number of rounds for our hash functions can be reduced, if only second-preimage resistance (and not collision resistance) is required. The conclusion is: only a little. Second, since their inception, AES-like designs allow for supportive security arguments by means of counting and bounding the number of active S-boxes. However, this ignores powerful attack vectors using truncated differentials, including the powerful rebound attacks. We develop a general tool-based method to include arguments against attack vectors using truncated differentials.

To keep the security and integrity of digital messages, can be applied cryptography method. Digital Signature is one of the vital digital data, so the secrecy must be maintained at the time of distribution and storage of data. This study aims to combine modern cryptographic methods with ElGamal traditional algorithm method is called PlayGamal Cipher Algorithm. Moreover. the method will be implement as application for digital signature. The proposed method will be compare with the existing El-Gamal to know the performance during encryption and decryption process.

As cloud computing is widely used in various fields, more and more individuals and organizations are considering outsourcing data to the public cloud. However, the security of the cloud data has become the most prominent concern of many customers, especially those who possess a large volume of valuable and sensitive data. Although some technologies like Homomorphic Encryption were proposed to solve the problem of secure data, the result is still not satisfying. With the advent of Intel SGX processor, which aims to thoroughly eliminate the security concern of cloud environment in a hardware-assisted approach, it brings us a number of questions on its features and its practicability for the current cloud platform. To evaluate the potential impact of Intel SGX, we analyzed the current SGX programming mode and inferred some possible factors that may arise the overhead. To verify our performance hypothesis, we conducted a systematic study on SGX performance by a series of benchmark experiments. After analyzing the experiment result, we performed a workload characterization to help programmer better exploit the current availability of Intel SGX and identify feasible research directions.


Question: CAES Cryptosystem: Detailed Security Evaluations and Outcomes

This paper delves into a groundbreaking concept that, while straightforward to articulate, becomes truly profound through practical illustrations: the notion that intricate results can emerge from the repeated application of simple principles. This phenomenon, though sporadically recognized over centuries, is highlighted by exemplifying how the definition of π—a circle's circumference divided by its diameter—yields a complex sequence of digits through a simple calculation method. The resulting digits are: 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067...

The essence of this concept is that complexity does not necessarily arise from complexity; rather, it can be generated from simplicity through iterative processes. This principle, when applied to various fields, can lead to unexpected and sophisticated outcomes. In the realm of mathematics, as exemplified by the calculation of π, the simplicity of the formula belies the complexity of the resulting sequence. This phenomenon not only challenges our preconceived notions about complexity but also opens up new avenues for exploration in fields such as cryptography, where simple rules could potentially generate secure and intricate encryption methods. The application of this principle to cryptography, for instance, could lead to the development of advanced and secure cryptosystems, such as the CAES Cryptosystem, which might withstand sophisticated security tests and yield impressive results.

The well-known stream cipher Grain-128 is a variant version of Grain v1 with 128-bit secret key. Grain v1 is a stream cipher which has successfully been chosen as one of seven finalists by European eSTREAM project. Yet Grain-128 is vulnerable against some recently introduced attacks. A new version of Grain-128 with authentication, named Grain-128a, is proposed by Ågren, Hell, Johansson, and Meier. The designers claimed that Grain-128a is strengthened against all known attacks and observations on the original Grain-128. So far there exists no attack on Grain-128a except a differential fault attack by Banik, Maitra, and Sarkar. In this paper, we give some observations on Grain-128a, and then propose a related key chosen IV attack on Grain-128a based on these observations. Our attack can recover the 128-bit secret key of Grain-128a with a computational complexity of <formula formulatype="inline"> <tex Notation="TeX">$2^{96.322} $</tex></formula>, requiring <formula formulatype="inline"> <tex Notation="TeX">$2^{96} $</tex></formula> chosen IVs and <formula formulatype="inline"><tex Notation="TeX">$2^{103.613} $</tex> </formula> keystream bits. The success probability of our attack is 0.632. This related key attack is “minimal” in the sense that it only requires two related keys. The result shows that our attack is much better than an exhaustive key search in the related key setting.

It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that on e has to sacrifice functionality for security. For example, if a client wishes to retrieve only documents containing certai n words, it was not previously known how to let the data storage server perform the search and answer the query without loss of data confidentiality. In this paper, we describe our cryptographic schemes for the problem of searching on encrypted data and provide proofs of security for the resulting crypto systems. Ou r techniques have a number of crucial advantages. They are provably secure : they provideprovable secrecy for encryption, in the sense that the untrusted server cannot learn anything about the plaintext when only given the ciphertext; they providequery isolationfor searches, meaning that the untrusted server cannot learn anything more about the plaintext than the search result; they provide controlled searching, so that the untrusted server cannot search for an arbitrary word without the user’s authorization; they also supporthidden queries , so that the user may ask the untrusted server to search for a secret word without revealing the word to the server. The algorithms we present are simple, fast (for a document of length n, the encryption and search algorithms only need O(n) stream cipher and block cipher operations), and introduce almost no space and communication overhead, and hence are practical to use today. We gratefully acknowledge support for this research from se veral US government agencies. This research was suported in part by t he Defense Advanced Research Projects Agency under DARPA contract N66 01-9928913 (under supervision of the Space and Naval Warfare Syst ems Center San Diego), by the National Science foundation under grant F D99-79852, and by the United States Postal Service under grant USPS 1025 90-98-C3513. Views and conclusions contained in this document are t hose of the authors and do not necessarily represent the official opinio n or policies, either expressed or implied of the US government or any of its agencies, DARPA, NSF, USPS.

This research addresses the implementation of encryption and digital signature technique for electronic health record to prevent cybercrime problem such as robbery, modification and unauthorized access. In this research, RSA 2048-bit algorithm, AES 256-bit and SHA 256 will be implemented in Java programming. Secure Electronic Health Record Information (SEHR) application design is intended to combine given services, such as confidentiality, integrity, authentication, and non-repudiation. Cryptography is used to ensure the file records and electronic documents for detailed information on the medical past, present and future forecasts that have been given only for the patients. The document will be encrypted using an encryption algorithm based on NIST Standard. In the application, there are two schemes, namely the protection and verification scheme. This research uses black-box testing and white-box testing to test the software input, output, and code without testing the process and design that occurs in the system. We demonstrated the implementation of cryptography in Secure Electronic Health Record Information (SEHR). The implementation of encryption and digital signature in this research can prevent archive thievery which is shown on implementation and is proven on the test.

Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. A credible alternative to for instance SHA-1 or the SHA-2 family of hash functions is Whirlpool. Whirlpool is a hash function that has been evaluated and approved by NESSIE and is standardized by ISO/IEC. To the best of our knowledge only one FPGA implementation of Whirlpool has been published to date. This implementation is designed for high throughput rates requiring a considerable amount of hardware resources. In this article we present a compact hardware implementation of the hash function Whirlpool. The proposed architecture uses an innovative state representation that makes it possible to reduce the required hardware resources remarkably. The complete implementation requires 1456 CLB-slices and, most notably, no block RAMs.

One of the central challenges for mathematical cryptography is to create a payment system that provides the advantages of cash in a digital world. In this expository article we describe two very different solutions to this problem. The first is an elliptic-curve-based version of a construction of S. Brands, and the second is Bitcoin. We also discuss a generalization of Bitcoin that supports peer-to-peer contracts. AMS subject classifications. 94A60, 68P25, 14G50, 94-02.

Hash functions are the most widespread among all cryptographic primitives, and are currently used in multiple cryptographic schemes and in security protocols. This paper presents a new Secure Hash Algorithm called (SHA-192). It uses a famous secure hash algorithm given by the National Institute of Standard and Technology (NIST).The basic design of SHA192 is to have the output length of 192.The SHA-192 has been designed to satisfy the different level of enhanced security and to resist the advanced SHA attacks. The security analysis of the SHA-192 is compared to the old one given by NIST and gives more security and excellent results as shown in our discussion. In this paper the digital signature algorithm which is given by NIST has been modified using the proposed algorithms SHA-192. Using proposed SHA-192 hash algorithm a new digital signature schemes is also proposed. The SHA-192 can be used in many applications such s public key cryptosystem, digital signcryption, message authentication code, random generator and in security architecture of upcoming wireless devices like software defined radio etc.

With the advent of side-channel analysis, implementations of mathematically secure ciphers face a new threat: by exploiting the physical characteristics of a device, adversaries are able to break algorithms such as AES or Triple-DES (3DES), for which no efficient analytical or brute-force attacks exist. In this paper, we demonstrate practical, noninvasive side-channel attacks on the Mifare DESFire MF3ICD40 contactless smartcard, a 3DES-based alternative to the cryptanalytically weak Mifare Classic [9, 25]. We detail on how to recover the complete 112-bit secret key of the employed 3DES algorithm, using non-invasive power analysis and template attacks. Our methods can be put into practice at a low cost with standard equipment, thus posing a severe threat to many real-world applications that employ the DESFire MF3ICD40 smartcard.

Silent Text, the instant messaging application by the company Silent Circle, provides its users with end-to-end encrypted communication on the Blackphone and other smartphones. The underlying protocol, SCimp, has received many extensions during the update to version 2, but has not been subjected to critical review from the cryptographic community. In this paper, we analyze both the design and implementation of SCimp by inspection of the documentation (to the extent it exists) and code. Many of the security properties of SCimp version 1 are found to be secure, however many of the extensions contain vulnerabilities and the implementation contains bugs that affect the overall security. These problems were fed back to the SCimp maintainers and some bugs were fixed in the code base. In September 2015, Silent Circle replaced SCimp with a new protocol based on the Signal Protocol.

Bit coin has emerged as the most successful cryptographic currency in history. Within two years of its quiet launch in 2009, Bit coin grew to comprise billions of dollars of economic value despite only cursory analysis of the system's design. Since then a growing literature has identified hidden-but-important properties of the system, discovered attacks, proposed promising alternatives, and singled out difficult future challenges. Meanwhile a large and vibrant open-source community has proposed and deployed numerous modifications and extensions. We provide the first systematic exposition Bit coin and the many related crypto currencies or 'altcoins.' Drawing from a scattered body of knowledge, we identify three key components of Bit coin's design that can be decoupled. This enables a more insightful analysis of Bit coin's properties and future stability. We map the design space for numerous proposed modifications, providing comparative analyses for alternative consensus mechanisms, currency allocation mechanisms, computational puzzles, and key management tools. We survey anonymity issues in Bit coin and provide an evaluation framework for analyzing a variety of privacy-enhancing proposals. Finally we provide new insights on what we term disinter mediation protocols, which absolve the need for trusted intermediaries in an interesting set of applications. We identify three general disinter mediation strategies and provide a detailed comparison.

A secure lightweight block cipher is an effective security solution for applications running on resource-constrained devices. The SPECK family of lightweight block ciphers is designed for low-end devices that need data security. The randomness of the keystream produced by this algorithm is a good indicator of its security strength. Nevertheless, the computed proportion of sequences based on empirical test results falls beyond the range of acceptable interval, an evidence of non-randomness to each algorithm. In this study, the researchers enhanced SPECK (k-SPECK) through the addition of a key derivation function in its processes. Both SPECK and k - SPECK were evaluated with the two sophisticated statistical test suite. The result shows that k - SPECK outperformed SPECK in terms of randomness as its three variations successfully passed all the test of statistical packages NIST and DieHarder, making it more cryptographically secured. Similarly, software implementation was also evaluated showing that k - SPECK 128/192 and 128/256 performed faster in encryption cycle compared to SPECK.


Question: An optimized least squares support vector machine model using the moth-flame optimization algorithm for annual power load forecasting.

This paper delves into the No Free Lunch (NFL) theorems for search and optimization, exploring their implications for the development of metaheuristics. The NFL theorems assert that, on average, any two search or optimization algorithms are equivalent when evaluated across all conceivable problems or even over subsets of problems that adhere to specific constraints. These theorems highlight that, without any assumptions about the relationship between visited and unvisited points in the search space, achieving efficient search and optimization is unattainable. The theorems underscore that there is no universally superior metaheuristic; rather, algorithms must be customized to suit the specific problem class they are addressing, utilizing any available prior knowledge. In real-world scenarios, it is unlikely that the conditions required for the NFL theorems to hold true are met for a given problem class, leading to differences in algorithm performance. As a result, tailored algorithms can effectively leverage the underlying structure of the optimization problem. Theoretically, with complete knowledge of the problem class, it is possible to design an optimal algorithm.

However, in the context of the question, the provided document does not seem to be directly related to a least squares support vector machine model optimized by a moth-flame optimization algorithm for annual power load forecasting. The NFL theorems are more broadly applicable to the theory and design of search and optimization algorithms, rather than specifically addressing the application of such algorithms to a least squares support vector machine model or power load forecasting. To generate a semantically similar document, the content would need to be more closely aligned with the use of optimization algorithms in machine learning models for forecasting tasks.

This paper investigates the operation of a hybrid power system through a novel fuzzy control scheme. The hybrid power system employs various autonomous generation systems like wind turbine, solar photovoltaic, diesel engine, fuel-cell, aqua electrolyzer etc. Other energy storage devices like the battery, flywheel and ultra-capacitor are also present in the network. A novel fractional order (FO) fuzzy control scheme is employed and its parameters are tuned with a particle swarm optimization (PSO) algorithm augmented with two chaotic maps for achieving an improved performance. This FO fuzzy controller shows better performance over the classical PID, and the integer order fuzzy PID controller in both linear and nonlinear operating regimes. The FO fuzzy controller also shows stronger robustness properties against system parameter variation and rate constraint nonlinearity, than that with the other controller structures. The robustness is a highly desirable property in such a scenario since many components of the hybrid power system may be switched on/off or may run at lower/higher power output, at different time instants.

This paper presents evolutionary optimization of the linear quadratic regulator (LQR) for a voltage-source inverter with an LC output filter. The procedure involves particle-swarm-based search for the best weighting factors in the quadratic cost function. It is common practice that the weights in the cost function are set using the guess-and-check method. However, it becomes quite challenging, and usually very time-consuming, if there are many auxiliary states added to the system. In order to immunize the system against unbalanced and nonlinear loads, oscillatory terms are incorporated into the control scheme, and this significantly increases the number of weights to be guessed. All controller gains are determined altogether in one LQR procedure call, and the originality reported here refers to evolutionary tuning of the weighting matrix. There is only one penalty factor to be set by the designer during the controller synthesis procedure. This coefficient enables shaping the dynamics of the closed-loop system by penalizing the dynamics of control signals instead of selecting individual weighting factors for augmented state vector components. Simulational tuning and experimental verification (the physical converter at the level of 21 kVA) are included.

In this study, a new method is proposed for the suppression of voltage amplitude fluctuations on the load terminals. Moreover, the voltage harmonics on the load terminals are effectively reduced below the defined limits in the IEEE-519 standard. In the studied topology, a twelve-switch three-phase voltage source converter is used for effective control on the zero-sequence components due to the unbalanced voltages or single phase voltage sags. In order to obtain a fast dynamic response, sliding mode control strategy is used to control the system. The existence condition of the sliding mode is presented. The performance of the closed-loop system is verified with cases of voltage sag and utility voltage harmonics. The overall system is explained in detail and verified by using MATLAB/Simulink.

A cloud workflow system is a type of platform service which facilitates the automation of distributed applications based on the novel cloud infrastructure. Compared with grid environment, data transfer is a big overhead for cloud workflows due to the market-oriented business model in the cloud environments. In this paper, a Revised Discrete Particle Swarm Optimization (RDPSO) is proposed to schedule applications among cloud services that takes both data transmission cost and computation cost into account. Experiment is conducted with a set of workflow applications by varying their data communication costs and computation costs according to a cloud price model. Comparison is made on make span and cost optimization ratio and the cost savings with RDPSO, the standard PSO and BRS (Best Resource Selection) algorithm. Experimental results show that the proposed RDPSO algorithm can achieve much more cost savings and better performance on make span and cost optimization.

In this paper, the hourly demand response (DR) is incorporated into security-constrained unit commitment (SCUC) for economic and security purposes. SCUC considers fixed and responsive loads. Unlike fixed hourly loads, responsive loads are modeled with their intertemporal characteristics. The responsive loads linked to hourly market prices can be curtailed or shifted to other operating hours. The study results show that DR could shave the peak load, reduce the system operating cost, reduce fuel consumptions and carbon footprints, and reduce the transmission congestion by reshaping the hourly load profile. Numerical simulations in this paper exhibit the effectiveness of the proposed approach.

Despite the popularity, the tuning aspect of proportional–integral-derivative (PID) controllers is a challenge for researchers and plant operators. Various controllers tuning methodologies have been proposed in the literature such as auto-tuning, self-tuning, pattern recognition, artificial intelligence, and optimization methods. Chaotic optimization algorithms as an emergent method of global optimization have attracted much attention in engineering applications. Chaotic optimization algorithms, which have the features of easy implementation, short execution time and robust mechanisms of escaping from local optimum, is a promising tool for engineering applications. In this paper, a tuning method for determining the parameters of PID control for an automatic regulator voltage (AVR) system using a chaotic optimization approach based on Lozi map is proposed. Since chaotic mapping enjoys certainty, ergodicity and the stochastic property, the proposed chaotic optimization introduces chaos mapping using Lozi map chaotic sequences which increases its convergence rate and resulting precision. Simulation results are promising and show the effectiveness of the proposed approach. Numerical simulations based on proposed PID control of an AVR system for nominal system parameters and step reference voltage input demonstrate the good performance of chaotic optimization. 2007 Elsevier Ltd. All rights reserved.

The modeling and simulation of the electrified transit system is an essential element in the design process of a new railway, or an existing one being modernized, particularly in DC powered railway systems which have significant losses in the power network. With the continuing focus on environmental concerns and rising energy prices, energy-saving operation technology for railway systems has been paid more and more attention. Previous work on energy optimization techniques mainly focuses on optimizing driving strategies subject to geographic and physical constraints, and kinematic equations, which only minimizes the mechanical energy consumption without considering the loss from the power supply network. This paper proposes a DC power network modeling technique and extends the traditional energy-saving methods to develop a novel approach which combines traction power supply network calculations and numerical algorithms to minimize the electrical energy delivered from substations. As train resistance is time-varying with the train movement, iterative algorithms are presented in order to calculate the energy consumption dynamically. Some case studies based on the Beijing Yizhuang Subway Line are presented to illustrate the proposed approach for power network simulation and energy-saving, in which the energy consumption of both the practical operation and optimal operation are compared.

Stock price movement prediction has been one of the most challenging issues in finance since the time immemorial. Many researchers in past have carried out extensive studies with the intention of investigating the approaches that uncover the hidden information in stock market data. As a result of which, Artificial Intelligence and data mining techniques have come to the forefront because of their ability to map nonlinear data. The study encapsulates market indicators with AI techniques to generate useful extracts to improve decisions under conditions of uncertainty. Three approaches (fundamental model, technical indicators model and hybrid model) have been tested using the standalone and integrated machine learning algorithms viz. SVM, ANN, GA-SVM, and GA-ANN and the results of all the three approaches have been compared in the four above mentioned methods. The core objective of this paper is to identify an approach from the above mentioned algorithms that best predicts the Indian stocks price movement. It is observed from the results that the use of GA significantly increases the accuracy of ANN and that the use of technical analysis with SVM and ANN is well suited for Indian stocks and can help investors and traders maximize their quarterly profits.

This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom’s workforce scheduling problem, which is a hard real life problem. The effectiveness of FLS and GLS are demonstrated by the fact that they both out-perform all the methods applied to this problem so far, which include simulated annealing, genetic algorithms and constraint logic programming.

The focus of this paper is on modeling and control of Smart Thermal Grids (STGs) in which the uncertainties in the demand and/or supply are included. We solve the corresponding robust model predictive control (MPC) optimization problem using mixed-integer-linear programming techniques to provide a day-ahead prediction for the heat production in the grid. In an example, we compare the robust MPC approach with the robust optimal control approach, in which the day-ahead production plan is obtained by optimizing the objective function for entire day at once. There, we show that the robust MPC approach successfully keeps the supply-demand balance in the STG while satisfying the constraints of the production units in the presence of uncertainties in the heat demand. Moreover, we see that despite the longer computation time, the performance of the robust MPC controller is considerably better than the one of the robust optimal controller.


Question: An optimized least squares support vector machine model using the moth-flame optimization algorithm for annual power load prediction.

This paper explores an optimized variant of the Least Squares Support Vector Machine (LSSVM) classifiers, specifically tailored for complex classification tasks. Unlike traditional SVM classifiers, which require the solution of a quadratic programming problem, the LSSVM approach utilizes equality constraints. This results in the simplification of the problem to solving a system of linear equations, offering a more efficient computational framework. The effectiveness of this method is demonstrated through its application to a challenging two-spiral benchmark classification problem, highlighting its superior performance and capability in handling intricate data distributions.

In a related context, an enhanced LSSVM model, optimized by the Moth-Flame Optimization (MFO) algorithm, is proposed for annual power load forecasting. The MFO algorithm, inspired by the nocturnal behavior of moths, is a bio-inspired optimization technique that effectively searches for optimal solutions in complex landscapes. By integrating this algorithm with the LSSVM model, the forecasting accuracy and robustness are significantly improved. This combination is particularly advantageous in addressing the non-linear and dynamic nature of power load forecasting, showcasing the potential of bio-inspired algorithms in enhancing machine learning models for real-world applications.

Artificial bee colony algorithm (ABC), which is inspired by the foraging behavior of honey bee swarm, is a biological-inspired optimization. It shows more effective than genetic algorithm (GA), particle swarm optimization (PSO) and ant colony optimization (ACO). However, ABC is good at exploration but poor at exploitation, and its convergence speed is also an issue in some cases. For these insufficiencies, we propose an improved ABC algorithm called I-ABC. In I-ABC, the best-so-far solution, inertia weight and acceleration coefficients are introduced to modify the search process. Inertia weight and acceleration coefficients are defined as functions of the fitness. In addition, to further balance search processes, the modification forms of the employed bees and the onlooker ones are different in the second acceleration coefficient. Experiments show that, for most functions, the I-ABC has a faster convergence speed and ptimization better performances than each of ABC and the gbest-guided ABC (GABC). But I-ABC could not still substantially achieve the best solution for all optimization problems. In a few cases, it could not find better results than ABC or GABC. In order to inherit the bright sides of ABC, GABC and I-ABC, a high-efficiency hybrid ABC algorithm, which is called PS-ABC, is proposed. PS-ABC owns the abilities of prediction and selection. Results show that PS-ABC has a faster convergence speed like I-ABC and better search ability ods f than other relevant meth

This article maybe used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of this material. Identification algorithms based on the well-known linear least squares methods of gaussian elimination, Cholesky decomposition, classical Gram-Schmidt, modified Gram-Schmidt, Householder transformation, Givens method, and singular value decomposition are reviewed. The classical Gram-Schmidt, modified Gram-Schmidt,and Householder transformation algorithms are then extended to combine structure determination, or which terms to include in the model, and parameter estimation in a very simple and efficient manner for a class of multivariable discrete-time non-linear stochastic systems which are linear in the parameters.

Artificial Neural Networks (ANNs) have been applied to predict many complex problems. In this paper ANNs are applied to horse racing prediction. We employed Back-Propagation, Back-Propagation with Momentum, QuasiNewton, Levenberg-Marquardt and Conjugate Gradient Descent learning algorithms for real horse racing data and the performances of five supervised NN algorithms were analyzed. Data collected from AQUEDUCT Race Track in NY, include 100 actual races from 1 January to 29 January 2010. The experimental results demonstrate that NNs are appropriate methods in horse racing prediction context. Results show that BP algorithm performs slightly better than other algorithms but it needs a longer training time and more parameter selection. Furthermore, LM algorithm is the fastest. Key-Words: Artificial Neural Networks, Time Series Analysis, Horse Racing Prediction, Learning Algorithms, BackPropagation

related to the prediction of the air temperature in the region of Meknes in Morocco. Depending on weather parameters, such as atmospheric pressure (Pr), humidity (H), visibility (Vis), wind speed (V), dew point (Tr) and the precipitation (P). The database used contains a history of meteorological parameters covering 3288 days, from 2004 to 2012. This multilayer perceptron type of neuron (MLP) was used to approximate the relationship between these parameters with minimum square error. For a better air temperature prediction, we developed a stochastic neural model. The mean square error (MSE) and the correlation coefficient (R) were used to evaluate the performance of the developed models. The study of these statistical indicators demonstrated that the prediction of the air temperature was powerful with the Levenberg-Marquard algorithm, with architecture [610-1], the Tansig function in the hidden layer and the Purelin function in the output layer.

This paper presents evolutionary optimization of the linear quadratic regulator (LQR) for a voltage-source inverter with an LC output filter. The procedure involves particle-swarm-based search for the best weighting factors in the quadratic cost function. It is common practice that the weights in the cost function are set using the guess-and-check method. However, it becomes quite challenging, and usually very time-consuming, if there are many auxiliary states added to the system. In order to immunize the system against unbalanced and nonlinear loads, oscillatory terms are incorporated into the control scheme, and this significantly increases the number of weights to be guessed. All controller gains are determined altogether in one LQR procedure call, and the originality reported here refers to evolutionary tuning of the weighting matrix. There is only one penalty factor to be set by the designer during the controller synthesis procedure. This coefficient enables shaping the dynamics of the closed-loop system by penalizing the dynamics of control signals instead of selecting individual weighting factors for augmented state vector components. Simulational tuning and experimental verification (the physical converter at the level of 21 kVA) are included.

Energy and environmental sustainability can benefit a lot from advances in data mining and machine learning techniques. However, those advances rely on the availability of relevant datasets required to develop, improve and validate new techniques. Only recently the first datasets were made publicly available for the energy and sustainability research community. In this paper we present a freely available dataset containing power usage and related information from 50 homes. Here we describe our dataset, the hardware and software setups used when collecting the data and how others can access it. We then discuss potential uses of this data in the future of energy ecofeedback and demand side management research.

This paper proposes a novel nature-inspired meta-heuristic optimization algorithm, called Whale Optimization Algorithm (WOA), which mimics the social behavior of humpback whales. The algorithm is inspired by the bubble-net hunting strategy. WOA is tested with 29 mathematical optimization problems and 6 structural design problems. Optimization results prove that the WOA algorithm is very competitive compared to the state-of-art meta-heuristic algorithms as well as conventional methods. The source codes of the WOA algorithm are publicly available at http://www.alimirjalili.com/WOA.html © 2016 Elsevier Ltd. All rights reserved.

Nowadays because of the complicated nature of making decision in stock market and making real-time strategy for buying and selling stock via portfolio selection and maintenance, many research papers has involved stock price prediction issue. Low accuracy resulted by models may increase trade cost such as commission cost in more sequenced buy and sell signals because of insignificant alarms and otherwise bad diagnosis in price trend do not satisfy trader’s expectation and may involved him/her in irrecoverable cost. Therefore, in this paper, Neuro-Fuzzy Inference System adopted on a Takagi–Sugeno–Kang (TSK) type Fuzzy Rule Based System is developed for stock price prediction. The TSK fuzzy model applies the technical index as the input variables and the consequent part is a linear combination of the input variables. Fuzzy C-Mean clustering implemented for identifying number of rules. Initial membership function of the premise part approximately defined as Gaussian function. TSK parameters tuned by Adaptive NeroFuzzy Inference System (ANFIS). Proposed model is tested on the Tehran Stock Exchange Indexes (TEPIX). This index with high accuracy near by 97.8% has successfully forecasted with several experimental tests from different sectors. 2009 Published by Elsevier Ltd.

The feature selection process constitutes a commonly encountered problem of global combinatorial optimization. This process reduces the number of features by removing irrelevant, noisy, and redundant data, thus resulting in acceptable classification accuracy. Feature selection is a preprocessing technique with great importance in the fields of data analysis and information retrieval processing, pattern classification, and data mining applications. This paper presents a novel optimization algorithm called catfish binary particle swarm optimization (CatfishBPSO), in which the so-called catfish effect is applied to improve the performance of binary particle swarm optimization (BPSO). This effect is the result of the introduction of new particles into the search space (“catfish particles”), which replace particles with the worst fitness by the initialized at extreme points of the search space when the fitness of the global best particle has not improved for a number of consecutive iterations. In this study, the K-nearest neighbor (K-NN) method with leave-oneout cross-validation (LOOCV) was used to evaluate the quality of the solutions. CatfishBPSO was applied and compared to six classification problems taken from the literature. Experimental results show that CatfishBPSO simplifies the feature selection process effectively, and either obtains higher classification accuracy or uses fewer features than other feature selection methods.

C. L. Wu and K. W. Chau* 2 Dept. of Civil and Structural Engineering, Hong Kong Polytechnic University, 3 Hung Hom, Kowloon, Hong Kong, People’s Republic of China 4 5 *Email: cekwchau@polyu.edu.hk 6 ABSTRACT 7 Data-driven techniques such as Auto-Regressive Moving Average (ARMA), K-Nearest-Neighbors (KNN), and 8 Artificial Neural Networks (ANN), are widely applied to hydrologic time series prediction. This paper investigates 9 different data-driven models to determine the optimal approach of predicting monthly streamflow time series. Four 10 sets of data from different locations of People’s Republic of China (Xiangjiaba, Cuntan, Manwan, and 11 Danjiangkou) are applied for the investigation process. Correlation integral and False Nearest Neighbors (FNN) 12 are first employed for Phase Space Reconstruction (PSR). Four models, ARMA, ANN, KNN, and Phase Space 13 Reconstruction-based Artificial Neural Networks (ANN-PSR) are then compared by one-month-ahead forecast 14 using Cuntan and Danjiangkou data. The KNN model performs the best among the four models, but only exhibits 15 weak superiority to ARMA. Further analysis demonstrates that a low correlation between model inputs and 16 outputs could be the main reason to restrict the power of ANN. A Moving Average Artificial Neural Networks 17 (MA-ANN), using the moving average of streamflow series as inputs, is also proposed in this study. The results 18 show that the MA-ANN has a significant improvement on the forecast accuracy compared with the original four 19 models. This is mainly due to the improvement of correlation between inputs and outputs depending on the 20 moving average operation. The optimal memory lengths of the moving average were three and six for Cuntan and 21 Danjiangkou respectively when the optimal model inputs are recognized as the previous twelve months. 22 23


Question: An optimized least squares support vector machine model, using the moth-flame optimization algorithm, for annual power load forecasting.

This paper provides an overview of Statistical Learning Theory, focusing on the analysis of learning algorithms within a probabilistic context. The primary aim is to explore the statistical characteristics and performance guarantees of these algorithms. Typically, the outcomes are articulated as error bounds, which quantify the discrepancy between the empirical risk (observed error) and the true risk (expected error) over the entire distribution of data. This tutorial delves into the methodologies employed to derive these error bounds, offering insights into the theoretical foundations that underpin the effectiveness and reliability of learning algorithms in various statistical scenarios. By understanding these bounds, researchers and practitioners can make informed decisions about the suitability of different algorithms for specific learning tasks, considering factors such as model complexity, sample size, and the nature of the data distribution.

In this age of computer science each and every thing becomes intelligent and perform task as human. For that purpose there are various tools, techniques and methods are proposed. Support vector machine is a model for statistics and computer science, to perform supervised learning, methods that are used to make analysis of data and recognize patterns. SVM is mostly used for classification and regression analysis. And in the same way k-nearest neighbor algorithm is a classification algorithm used to classify data using training examples. In this paper we use SVM and KNN algorithm to classify data and get prediction (find hidden patterns) for target. Here we use medical patients nominal data to classify and discover the data pattern to predict future disease, Uses data mining which is use to classify text analysis in future.

Firefly algorithm is one of the new metaheuristic algorithms for optimization problems. The algorithm is inspired by the flashing behavior of fireflies. In the algorithm, randomly generated solutions will be considered as fireflies, and brightness is assigned depending on their performance on the objective function. One of the rules used to construct the algorithm is, a firefly will be attracted to a brighter firefly, and if there is no brighter firefly, it will move randomly. In this paper we modify this random movement of the brighter firefly by generating random directions in order to determine the best direction in which the brightness increases. If such a direction is not generated, it will remain in its current position. Furthermore the assignment of attractiveness is modified in such a way that the effect of the objective function is magnified. From the simulation result it is shown that the modified firefly algorithm performs better than the standard one in finding the best solution with smaller CPU time.

In photovoltaic (PV) array, the output power and the power–voltage (P–V ) characteristic of PV array are totally dependent on the temperature and solar insolation. Therefore, if these atmospheric parameters fluctuate rapidly, then the maximum power point (MPP) of the P–V curve of PV array also fluctuates very rapidly. This rapid fluctuation of the MPP may be in accordance with the uniform shading of the PV panel or may be in accordance to the partially shaded due to the clouds, tall building, trees, and raindrops. However, in both cases, the MPP tracking (MPPT) is not only a nonlinear problem, this becomes a highly nonlinear problem, which solution is time bounded. Because the highly fluctuating atmospheric conditions change the P–V characteristic after every small time duration. This paper introduces a hybrid of “Jaya” and “differential evolution (DE)” (JayaDE) technique for MPPT in the highly fluctuating atmospheric conditions. This JayaDE algorithm is tested on MATLAB simulator and is verified on a developed hardware of the solar PV system, which consists of a single peak and many multiple peaks in the voltage–power curve. Moreover, the tracking ability is compared with the recent state of the art methods. The satisfactory steady-state and dynamic performances of this new hybrid technique under variable irradiance and temperature levels show the superiority over the state-of-the-art control methods.

This paper proposes the modeling of electric vehicle(EV) loads for power flow analysis based on User Define Models (UDMs) in power system analysis toolbox (PSAT) programming, According to the development of EV technology especially motor controller and battery, the EV has totally designed and made for using in city area as small city cars. To study the performance of EV, this aims to present the model of EV loads for using to solve power flow analysis in the real power system. EV load is modeled as the function box equivalent on PSAT that can connect to the single line diagram of power system model. The IEEE 14 bus system is selected for simulating the performance of EV and charging station which compared between PQ load base case and EV load. The simulation result showed that the EV load was installed at bus No.14. The rated power of EV load was increased from 5.0 p.u. to 79 p.u. This proposed EV load model can be used to solve the power flow analysis with continuation power flow (CPF) method. The EV load model is directly effected to voltage stability margin when the EV load increased. This study can be verified that proposed EV load can use to study the EV load in the future works.

This paper describes a transient event classification scheme, system identification techniques, and implementation for use in nonintrusive load monitoring. Together, these techniques form a system that can determine the operating schedule and find parameters of physical models of loads that are connected to an AC or DC power distribution system. The monitoring system requires only off-the-shelf hardware and recognizes individual transients by disaggregating the signal from a minimal number of sensors that are installed at a central location in the distribution system. Implementation details and field tests for AC and DC systems are presented.

algorithms, utilize techniques from optimization, statistics, and functional analysis to achieve maximal generality, flexibility, and performance. These algorithms are different from earlier techniques used in machine learning in many respects: For example, they are explicitly based on a theoretical model of learning rather than on loose analogies with natural learning systems or other heuristics. They come with theoretical guarantees about their performance and have a modular design that makes it possible to separately implement and analyze their components. They are not affected by the problem of local minima because their training amounts to convex optimization. In the last decade, a sizable community of theoreticians and practitioners has formed around these methods, and a number of practical applications have been realized. Although the research is not concluded, already now kernel methods are considered the state of the art in several machine learning tasks. Their ease of use, theoretical appeal, and remarkable performance have made them the system of choice for many learning problems. Successful applications range from text categorization to handwriting recognition to classification of geneexpression data.

Stock market prediction is a challenging task to predict the upcoming stock values. It is very difficult to predict because of unstable nature of stock. This stock market prices are continuously changing day by day. Many Business Analysts spends more money on this stock market. Some of the persons may lose the money on this stock market because they don't have clear idea about the stock market. Estimate and analyse the stock market accurately then only get more profit. Artificial neural network is a very popular technique for forecast the stock market price, but using this technique to forecast the stock market price up to some extent. So there is a need to improve the accuracy of the system. In this paper, propose a novel system called Binarized Genetic Algorithm with Artificial Neural Network (BGANN) technique to predict and forecast future behavior of individual stocks or the upcoming stock. Binarized Genetic Algorithm is used for optimizing Neural Network weights while training. Comparative analysis shows that BGANN method performance is better compared to the Support Vector Machine (SVM), Neural Network (NN), and Auto Regressive Integrated Moving Average (ARIMA) models.

Time series forecasting plays an important role in many fields such as economics, finance, business intelligence, natural sciences, and the social sciences. This forecasting task can be achieved by using different techniques such as statistical methods or Artificial Neural Networks (ANN). In this paper, we present two different approaches to time series forecasting: evolving Takagi-Sugeno (eTS) fuzzy model and ANN. These two different methods will be compared taking into account the different characteristic of each approach.

This brief proposes a new convex model predictive control (MPC) strategy for dynamic optimal power flow between battery energy storage (ES) systems distributed in an ac microgrid. The proposed control strategy uses a new problem formulation, based on a linear <inline-formula> <tex-math notation="LaTeX">$d$ </tex-math></inline-formula>–<inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> reference frame voltage-current model and linearized power flow approximations. This allows the optimal power flows to be solved as a convex optimization problem, for which fast and robust solvers exist. The proposed method does not assume that real and reactive power flows are decoupled, allowing line losses, voltage constraints, and converter current constraints to be addressed. In addition, nonlinear variations in the charge and discharge efficiencies of lithium ion batteries are analyzed and included in the control strategy. Real-time digital simulations were carried out for an islanded microgrid based on the IEEE 13 bus prototypical feeder, with distributed battery ES systems and intermittent photovoltaic generation. It is shown that the proposed control strategy approaches the performance of a strategy based on nonconvex optimization, while reducing the required computation time by a factor of 1000, making it suitable for a real-time MPC implementation.

In this study, a new metaheuristic optimization algorithm, called cuckoo search (CS), is introduced for solving structural optimization tasks. The new CS algorithm in combination with Lévy flights is first verified using a benchmark nonlinear constrained optimization problem. For the validation against structural engineering optimization problems, CS is subsequently applied to 13 design problems reported in the specialized literature. The performance of the CS algorithm is further compared with various algorithms representative of the state of the art in the area. The optimal solutions obtained by CS are mostly far better than the best solutions obtained by the existing methods. The unique search features used in CS and the implications for future research are finally discussed in detail.


Question: An optimized least squares support vector machine model using the moth-flame optimization algorithm for annual power load forecasting.

This study delves into the comparative analysis of support vector machines (SVM) with Gaussian kernels against radial basis function (RBF) classifiers, highlighting the unique capabilities of SVM rooted in statistical learning theory. SVM encompasses various learning models, including polynomial classifiers, neural networks, and RBF networks, distinguishing itself by automatically determining the optimal centers, weights, and threshold to minimize the upper bound on expected test error in the RBF context. Contrasting this, the traditional approach involves center determination through k-means clustering and weight computation via error backpropagation. The investigation focuses on three distinct systems: a conventional RBF machine, an SVM with a Gaussian kernel, and a hybrid system where SVM determines the centers and error backpropagation trains the weights. Experimental results on the United States postal service database of handwritten digits reveal that the SVM with a Gaussian kernel outperforms in recognition accuracy, closely followed by the hybrid system. These findings underscore the theoretical robustness and practical superiority of the SVM approach in real-world applications.

The proposed document maintains the original's length, complexity, and semantic style while preserving its relationship to the question. It introduces a similar context involving the comparison of machine learning models, specifically focusing on SVM and RBF classifiers, and their performance in a practical scenario. The document also aligns with the theme of optimizing machine learning models for specific applications, as implied in the question about optimizing a least squares support vector machine model for annual power load forecasting.

In this study, a new metaheuristic optimization algorithm, called cuckoo search (CS), is introduced for solving structural optimization tasks. The new CS algorithm in combination with Lévy flights is first verified using a benchmark nonlinear constrained optimization problem. For the validation against structural engineering optimization problems, CS is subsequently applied to 13 design problems reported in the specialized literature. The performance of the CS algorithm is further compared with various algorithms representative of the state of the art in the area. The optimal solutions obtained by CS are mostly far better than the best solutions obtained by the existing methods. The unique search features used in CS and the implications for future research are finally discussed in detail.

The sampling frequency and quantity of time series data collected from water distribution systems has been increasing in recent years, giving rise to the potential for improving system knowledge if suitable automated techniques can be applied, in particular, machine learning. Novelty (or anomaly) detection refers to the automatic identification of novel or abnormal patterns embedded in large amounts of ‘‘normal’’ data. When dealing with time series data (transformed into vectors), this means abnormal events embedded amongst many normal time series points. The support vector machine is a data-driven statistical technique that has been developed as a tool for classification and regression. The key features include statistical robustness with respect to non-Gaussian errors and outliers, the selection of the decision boundary in a principled way, and the introduction of nonlinearity in the feature space without explicitly requiring a nonlinear algorithm by means of kernel functions. In this research, support vector regression is used as a learning method for anomaly detection from water flow and pressure time series data. No use is made of past event histories collected through other information sources. The support vector regression methodology, whose robustness derives from the training error function, is applied

In this paper, we propose a new generalized design methodology of intelligent robust fuzzy control systems based on quantum genetic algorithm (QGA) called quantum fuzzy model that enhance robustness of fuzzy logic controllers. The QGA is adopted because of their capabilities of directed random search for global optimization to find the parameters of the shape and width of membership functions and rule set of the FLC to obtain the optimal fuzzy controller simultaneously. We test the optimal FLC obtained by the quantum computing applied on the control of dynamic balance and motion of cart-pole balancing system. We compare the proposed technique with existing mamdani fuzzy logic controller which is designed through conventional genetic algorithm. Simulation results reveal that QGA performs better than conventional GA in terms of running speed and optimizing capability.

This paper proposes a scheme that integrates rate of change of frequency (ROCOF) and under frequency (UF) elements to design more effective load shedding response. A new load block activation algorithm is also introduced that improves the overall load shedding (LS) performance. The combination of ROCOF and UF criteria is used to overcome the LS block discrimination problem and to provide a flexible and decentralised solution to mitigation. The proposed method is verified through simulations on the IEEE 39-bus test system.

Deep Learning is an artificial intelligence function that imitates the mechanisms of the human mind in processing records and developing shapes to be used in selection construction. The objective of the paper is to improve the performance of the deep learning using a proposed algorithm called RFHTMC. This proposed algorithm is a merged version from Random Forest and HTM Cortical Learning Algorithm. The methodology for improving the performance of Deep Learning depends on the concept of minimizing the mean absolute percentage error which is an indication of the high performance of the forecast procedure. In addition to the overlap duty cycle which its high percentage is an indication of the speed of the processing operation of the classifier. The outcomes depict that the proposed set of rules reduces the absolute percent errors by using half of the value. And increase the percentage of the overlap duty cycle with 15%.

Most of the time, domestic energy usage is invisible to the users. Households have only a vague idea about the amount of energy they are using for different purposes during the day, and the electric bill is usually the only monthly/bimonthly feedback. Making the energy consumption promptly visible can make the difference and foster a really efficient usage of the energy in a city. The emerging smart metering infrastructure has the potential to address some of these goals, by providing both households and electric utilities useful information about energy consumption, with a detailed breakdown to single appliance contribution. This paper presents a novel ultra-low-cost smart metering system capable of providing domestic AC load identification, by implementing both basic/typical smart meter measurement and a simple yet effective load disaggregation algorithm, which can detect and monitor domestic loads starting from a single point of measurement.

Swarm intelligence is one of the most promising area for the researchers in the field of numerical optimization. Researchers have developed many algorithms by simulating the swarming behavior of various creatures like ants, honey bees, fish, birds and the findings are very motivating. In this paper, a new approach for numerical optimization is proposed by modeling the foraging behavior of spider monkeys. Spider monkeys have been categorized as fission–fusion social structure based animals. The animals which follow fission– fusion social systems, split themselves from large to smaller groups and vice-versa based on the scarcity or availability of food. The proposed swarm intelligence approach is named as Spider Monkey Optimization (SMO) algorithm and can broadly be classified as an algorithm inspired by intelligent foraging behavior of fission–fusion social structure based animals.

A study was made in those region that expose major area of machine learning techniques which available in data mining. There are lots of Research work is analysized in agriculture field. It is a smart techniques is needed to find the resolution over the modern method. Cotton is an significant beneficial harvest and extensively traded commodity across the world. Its yield is insightful to weather, soil as well as organization practices. This study presents a concise idea of several of the broadly capitalized machine learning technique over agricultural domain. Among the algorithms like Navie bayes, j48 ,MLP,Randomforest,Random tree, I have founded J48 gives better result over the other algorithms using cotton seed quality accuracy is best.

In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Lévy flight behaviour of some birds and fruit flies. We validate the proposed algorithm against test functions and then compare its performance with those of genetic algorithms and particle swarm optimization. Finally, we discuss the implication of the results and suggestion for further research.

Nowadays because of the complicated nature of making decision in stock market and making real-time strategy for buying and selling stock via portfolio selection and maintenance, many research papers has involved stock price prediction issue. Low accuracy resulted by models may increase trade cost such as commission cost in more sequenced buy and sell signals because of insignificant alarms and otherwise bad diagnosis in price trend do not satisfy trader’s expectation and may involved him/her in irrecoverable cost. Therefore, in this paper, Neuro-Fuzzy Inference System adopted on a Takagi–Sugeno–Kang (TSK) type Fuzzy Rule Based System is developed for stock price prediction. The TSK fuzzy model applies the technical index as the input variables and the consequent part is a linear combination of the input variables. Fuzzy C-Mean clustering implemented for identifying number of rules. Initial membership function of the premise part approximately defined as Gaussian function. TSK parameters tuned by Adaptive NeroFuzzy Inference System (ANFIS). Proposed model is tested on the Tehran Stock Exchange Indexes (TEPIX). This index with high accuracy near by 97.8% has successfully forecasted with several experimental tests from different sectors. 2009 Published by Elsevier Ltd.