Results 61 to 70 of about 5,753 (265)

A Bootstrapping-Capable Configurable NTT Architecture for Fully Homomorphic Encryption

IEEE Access
Fully homomorphic encryption (FHE) provides a solution to privacy-preserving applications because of its ability to perform computations on encrypted data without exposing raw data.
Rella Mareta, Ardianto Satriawan, Phap Ngoc Duong, Hanho Lee   +3 more
doaj   +1 more source

Asymptotics for multiple Meixner polynomials

Journal of Mathematical Analysis and Applications, 2014
The n-root asymptotic behavior of multiple Meixner polynomials is studied. A method based on an algebraic function formulation in connection with some available techniques from logarithmic potential theory has been developed. It represents an alternative to the use of Riemann-Hilbert techniques and the steepest descent method for oscillatory RH ...
Aptekarev, A. I., Arvesú Carballo, Jorge   +1 more
openaire   +3 more sources

Universal Conductance Fluctuations in Quantum Anomalous Hall Insulators

Advanced Materials, EarlyView.
Universal conductance fluctuations are observed in mesoscopic quantum anomalous Hall insulators. Two distinct fluctuation patterns are identified, arising from different interference processes of bulk and chiral edge states, respectively. These findings unveil rich quantum interference phenomena in quantum anomalous Hall insulators and provide insights
Peng Deng, Peng Zhang, Gang Qiu, Ting‐Hsun Yang, Chang Niu, Yaochen Li, Wenqiang Cui, Yang Feng, Peide D. Ye, Ke He, Kai Chang, Kang L. Wang   +11 more
wiley   +1 more source

High-Speed NTT Accelerator for CRYSTAL-Kyber and CRYSTAL-Dilithium

IEEE Access
The efficiency of polynomial multiplication execution majorly impacts the performance of lattice-based post-quantum cryptosystems. In this research, we propose a high-speed hardware architecture to accelerate polynomial multiplication based on the Number
Trong-Hung Nguyen, Binh Kieu-Do-Nguyen, Cong-Kha Pham, Trong-Thuc Hoang   +3 more
doaj   +1 more source

Secure Collaborative Publicly Verifiable Computation

IEEE Access, 2017
Publicly Verifiable Computation (PVC) enables computationally weak trusted sources to outsource several computations to some more powerful public untrusted clouds.
Qiang Wang, Fucai Zhou, Chunyu Chen, Pengkai Xuan, Qiyu Wu   +4 more
doaj   +1 more source

Resistance to Overdoping Allows Over 2000 S cm−1 Conductivity in P(g3BTTT) With Anion‐Exchange Doping

Advanced Materials, EarlyView.
Anion‐exchange doping of conjugated polymers is an effective way to achieve high conductivities. Here, we report over 2000 S cm−1 electrical conductivity for doped P(g3BTTT). In addition, we show that P(g3BTTT) sustains exceptionally high doping levels without any drop in the charge mobility.
Basil Hunger, Maximilian M. Horn, Eva Röck, Diego Rosas Villalva, Lize Bynens, Jochen Vanderspikken, Christina Kousseff, Silène Gobeil, Olivier Bardagot, Nesibe Akmanşen‐Kalayci, Sarah H. Tolbert, Iain McCulloch, Wouter Maes, Demetra Tsokkou, Natalie Banerji   +14 more
wiley   +1 more source

Exploiting Small-Norm Polynomial Multiplication with Physical Attacks

Transactions on Cryptographic Hardware and Embedded Systems
We present a set of physical profiled attacks against CRYSTALS-Dilithium that accumulate noisy knowledge on secret keys over multiple signatures, finally leading to a full key recovery attack. The methodology is composed of two steps.
Olivier Bronchain, Melissa Azouaoui, Mohamed ElGhamrawy, Joost Renes, Tobias Schneider   +4 more
doaj   +1 more source

Implementasi dan Pengukuran Kinerja Operasi Aritmatika Finite Field Berbasis Polinomial Biner

JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2015
Cryptography is one of the security techniques that secure information confidentiality and information integrity while electronic transaction processing.
Wenny Franciska Senjaya, Budi Rahardjo
doaj   +1 more source

Practical fast polynomial multiplication [PDF]

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
The “fast” polynomial multiplication algorithms for dense univariate polynomials are those which are asymptotically faster than the classical O(N2) method. These “fast” algorithms suffer from a common defect that the size of the problem at which they start to be better than the classical method is quite large; so large, in fact that it is impractical ...
openaire   +2 more sources

Spin Transport Across Interfaces With the Non‐Collinear Antiferromagnet Mn3Sn

Advanced Materials, EarlyView.
We study spin transport with Mn3Sn|Metal${\rm Mn}_3{\rm Sn}\vert{\rm Metal}$ heterostructures. For Mn3Sn|Pt${\rm Mn}_3{\rm Sn}\vert{\rm Pt}$ heterostructures, ultrafast spin current generation by optical pumping of Mn3Sn${\rm Mn}_3{\rm Sn}$ is explored, while for Mn3Sn|NiFe${\rm Mn}_3{\rm Sn}\vert{\rm NiFe}$ heterostructures, we probe the spin–charge ...
Paul A. Marschall, Wolfgang Hoppe, Prajwal Rigvedi, Börge Göbel, Franziska Ziolkowski, Samir Lounis, Banabir Pal, Stuart S. P. Parkin, Georg Woltersdorf   +8 more
wiley   +1 more source