copy and paste this google map to your website or blog!
Press copy button and paste into your blog or website.
(Please switch to 'HTML' mode when posting into your blog. Examples: WordPress Example, Blogger Example)
Input Form:Deal with this potential dealer,buyer,seller,supplier,manufacturer,exporter,importer
(Any information to deal,buy, sell, quote for products or service)
Cryptology ePrint Archive For more than 20 years, the Cryptology ePrint Archive has been publishing pre-print papers relevant to the field of cryptology You can read more about our goals and history, see our acceptance and publishing conditions, check out some statistics, or contact us
About the Cryptology ePrint Archive - IACR The Cryptology ePrint Archive provides rapid access to recent research in cryptology Papers have been placed here by the authors and did not undergo any refereeing process other than verifying that the work seems to be within the scope of cryptology and meets some minimal acceptance criteria
Operations of the Cryptology ePrint Archive - IACR The Cryptology ePrint Archive provides another way to announcing new results This reflects IACR's goals and policies, as confirmed by the IACR Board of Directors meeting on May 2, 1999 in Prague:
Lova: Lattice-Based Folding Scheme from Unstructured Lattices Existing post-quantum folding schemes (Boneh, Chen, ePrint 2024 257) based on lattice assumptions instead are secure under structured lattice assumptions, such as the Module Short Integer Solution Assumption (MSIS), which also binds them to relatively complex arithmetic
Cool + Cruel = Dual - eprint. iacr. org Recently [Wenger et al ~IEEE S\\ P 2025] claimed that the `Cool and Cruel' (C+C) approach to solving LWE with sparse secrets [Nolte et al ~AFRICACRYPT 2024] outperforms other approaches, in particular the well established primal attack In this work we show that i ~C+C is an instantiation of a known dual attack [Albrecht, EUROCRYPT 2017], ii ~experimental evidence that the primal attack can
ReSolveD: Shorter Signatures from Regular Syndrome Decoding and VOLE-in . . . We present ReSolveD, a new candidate post-quantum signature scheme under the regular syndrome decoding (RSD) assumption for random linear codes, which is a well-established variant of the well-known syndrome decoding (SD) assumption Our signature scheme is obtained by designing a new zero-knowledge proof for proving knowledge of a solution to the RSD problem in the recent VOLE-in-the-head
Blaze: Fast SNARKs from Interleaved RAA Codes - eprint. iacr. org In this work we construct a new and highly efficient multilinear polynomial commitment scheme (MLPCS) over binary fields, which we call \\emph{Blaze} Polynomial commitment schemes allow a server to commit to a large polynomial and later decommit to its evaluations Such schemes have emerged as a key component in recent efficient SNARK constructions Blaze has an extremely efficient prover
SQISign: compact post-quantum signatures from quaternions and isogenies We introduce a new signature scheme, SQISign, (for Short Quaternion and Isogeny Signature) from isogeny graphs of supersingular elliptic curves The signature scheme is derived from a new one-round, high soundness, interactive identification protocol Targeting the post-quantum NIST-1 level of security, our implementation results in signatures of $204$ bytes, secret keys of $16$ bytes and