Post-quantum cryptography Algorithm's standardization and performance analysis
-Quantum computer is no longer a hypothetical idea. It is the world's most important technology and there is a race among countries to get supremacy in quantum technology.
Manish Kumar
exaly +3 more sources
Enhancing IoT security through cloud-assisted post-quantum authentication: a case study with UOV signatures [PDF]
The UOV signature scheme is a promising quantum-resistant candidate in NIST PQC, offering shorter signatures and efficiency, but requires solving a system of linear equations, which presents a challenge while performing in resource-constrained IoT ...
Veeresh R. Maned +3 more
doaj +2 more sources
Cryptography: Advances in Secure Communication and Data Protection [PDF]
In the innovative work secure communication and data protection are being main field, which are emerged by cryptography as a fundamental pillar. Strong cryptographic methods are now essential given the rising reliance on digital technologies and the ...
Victor Melvin +4 more
doaj +1 more source
A new type of digital signature algorithms with a hidden group [PDF]
The known designs of digital signature schemes with a hidden group, which use finite non-commutative algebras as algebraic support, are based on the computational complexity of the so-called hidden discrete logarithm problem.
Dmitriy N. Moldovyan
doaj +1 more source
A Mathematical Perspective on Post-Quantum Cryptography
In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
A Zero-Knowledge Proof System with Algebraic Geometry Techniques
Current requirements for ensuring data exchange over the internet to fight against security breaches have to consider new cryptographic attacks. The most recent advances in cryptanalysis are boosted by quantum computers, which are able to break common ...
Edgar González Fernández +2 more
doaj +1 more source
An improvement of a key exchange protocol relying on polynomial maps
Akiyama et al. [A key exchange protocol relying on polynomial maps, Int. J. Math. Ind. 11 (2019) 195003] proposed a post-quantum key exchange protocol that is based on the hardness of solving a system of multivariate nonlinear polynomial equations but ...
Keita Suzuki, Koji Nuida
doaj +1 more source
Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms [PDF]
We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in \mathbb{F}_q[x_1,
Joshua A. Grochow +2 more
doaj +1 more source
An Improved Identity-Based Multivariate Signature Scheme Based on Rainbow
Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one ...
Le Van Luyen
doaj +1 more source
Recent progress in the security evaluation of multivariate public‐key cryptography
Multivariate public‐key cryptography (MPKC) is considered a leading candidate for post‐quantum cryptography (PQC). It is based on the hardness of the multivariate quadratic polynomial (MQ) problem, which is a problem of finding a solution to a system of ...
Yasuhiko Ikematsu +2 more
doaj +1 more source

