Results 71 to 80 of about 5,753 (265)

Accelerating HQC with Additive FFT

Transactions on Cryptographic Hardware and Embedded Systems
This paper presents an accelerated implementation of the Hamming Quasi-Cyclic (HQC) key encapsulation mechanism by leveraging additive Fast Fourier Transform (FFT) for polynomial multiplication (polymuls).
Ming-Shing Chen, Chun-Ming Chiu, Chun-Tao Peng, Bo-Yin Yang   +3 more
doaj   +1 more source

Ionic Gating of Liquid‐Crystal‐Like Pteridine Assemblies Enables Tunable Light Scattering

Advanced Materials, EarlyView.
Tunable optical properties emerge through developmentally regulated ionic gating, which transforms disordered, ultraviolet (UV)‐absorbing organelles into concentrically ordered, liquid‐crystal‐like light scatterers. By integrating analyses of pteridine composition, potassium‐dependent assembly, hierarchical ultrastructure, and optical behavior, the ...
Sourabh Bera, Zohar Eyal, Yael Noy, Yuval Barzilay, Siddharth Sahoo, Srikant Moharana, Avi Baram, Tali Lerer‐Goldshtein, Neta Varsano, Bar Bader, Lothar Houben, Uwe Heinig, Iddo Pinkas, Moshe Goldsmith, Tamar Unger, Shira Albeck, Andrea Sorrentino, Maxim Itkin, Sergey Malitsky, Ziv Porat, Ido Hadar, Venkata Jayasurya Yallapragada, Dvir Gur   +22 more
wiley   +1 more source

Cost-Efficient Pipelined Modular Polynomial Multiplier for Post-Quantum Cryptography Saber

Quantum Reports
The development of quantum computers presents a great challenge for current cryptographic algorithms. Post-quantum cryptography has been proposed to secure against quantum computers in the near future.
Hua Li
doaj   +1 more source

On multiplicative decompositions of polynomial sequences, II [PDF]

Acta Arithmetica, 2018
In this paper, the relations between the zeta functions of smooth projective varieties over finite fields and the functions of degree \(0\) from the extended Selberg class \(S^{\sharp}\) have been considered. Let \(S_{0}^{\sharp}\) denote the subclass of degree \(0\) functions in \(S^{\sharp}\).
Hajdu, Lajos, Sárközy, András
openaire   +3 more sources

Epitaxially Integrated Electro‐Optic KNbO3 Thin Films on Silicon

Advanced Materials, EarlyView.
We demonstrate the first epitaxial integration of electro‐optic KNbO3 thin films on silicon using suboxide molecular‐beam epitaxy. Combining adsorption‐controlled molecular‐beam epitaxy, advanced characterization, and phase‐field modeling, we demonstrate phase‐pure crystalline films mirroring bulk crystals with robust Pockels response, enabling future ...
Sankalpa Hazra, Tobias Schwaigert, Yingxin Zhu, Aiden Ross, Muhammad Aminul Haque Chowdhury, Shun‐Li Shang, Sameer Singh, Zhiyu Zhang, Zhe Wang, Brynn Brower, Saugata Sarker, Suchismita Sarker, Zi‐Kui Liu, Rama K. Vasudevan, Long‐Qing Chen, Yang Yang, Darrell G. Schlom, Venkatraman Gopalan   +17 more
wiley   +1 more source

Nonlinear polynomial systems: multiple roots and their multiplicities [PDF]

Proceedings Shape Modeling Applications, 2004., 2004
We present methods for the computation of roots of univariate and bivariate nonlinear polynomial systems as well as the identification of their multiplicity. We first present an algorithm, called the TDB algorithm, which computes the values and the multiplicities of roots of a univariate polynomial.
Kwang Hee Ko, Takis Sakkalis, Nicholas M. Patrikalakis   +2 more
openaire   +1 more source

Inverse Design of Nanoparticulate Materials

Advanced Materials, EarlyView.
Inverse design shifts nanomaterial development from empirical trial‐and‐error to predictive model‐driven strategies. It can rely on knowledge‐based, data‐based, or hybrid process and property functions. This perspective article provides a practical framework for applying inverse design based on instructive examples. It discusses which modeling approach
Nabi Etienne Traoré, Annika Mauch, Michelle Berthold, Lukas Pflug, Wolfgang Peukert, Nicolas Vogel   +5 more
wiley   +1 more source

A New Secret Sharing Scheme Based on Polynomials over Finite Fields

Mathematics, 2020
In this paper, we examine a secret sharing scheme based on polynomials over finite fields. In the presented scheme, the shares can be used for the reconstruction of the secret using polynomial multiplication. This scheme is both ideal and perfect.
Selda Çalkavur, Patrick Solé, Alexis Bonnecaze   +2 more
doaj   +1 more source

Generic Reductions for In-place Polynomial Multiplication [PDF]

Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation, 2019
The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been made to improve the space complexity, developing modified versions of a few specific algorithms to use no extra ...
Giorgi, Pascal, Grenet, Bruno, Roche, Daniel   +2 more
openaire   +3 more sources

Life‐Like Ferrous Oxide Microspheres from Kombucha

Advanced Materials Interfaces, EarlyView.
Kombucha bacterial cellulose, sodium alginate, and ferrous nitrate self‐assemble into membrane‐enclosed iron oxide microspheres. These microspheres bud daughter vesicles, sustain 24‐h electrochemical oscillations, and filter theta‐band signals.
Panagiotis Mougkogiannis, Anna Nikolaidou, Andrew Adamatzky   +2 more
wiley   +1 more source