標(biāo)題: Titlebook: Arithmetic of Finite Fields; First International Claude Carlet,Berk Sunar Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 20 [打印本頁] 作者: GOLF 時(shí)間: 2025-3-21 16:12
書目名稱Arithmetic of Finite Fields影響因子(影響力)
書目名稱Arithmetic of Finite Fields影響因子(影響力)學(xué)科排名
書目名稱Arithmetic of Finite Fields網(wǎng)絡(luò)公開度
書目名稱Arithmetic of Finite Fields網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Arithmetic of Finite Fields被引頻次
書目名稱Arithmetic of Finite Fields被引頻次學(xué)科排名
書目名稱Arithmetic of Finite Fields年度引用
書目名稱Arithmetic of Finite Fields年度引用學(xué)科排名
書目名稱Arithmetic of Finite Fields讀者反饋
書目名稱Arithmetic of Finite Fields讀者反饋學(xué)科排名
作者: Bouquet 時(shí)間: 2025-3-21 23:42
Efficient Multiplication Using Type 2 Optimal Normal Bases bases of type 2 from . reported by Gao et al.?(2000) to .(.)?+?.(. log.) operations in ., where .(.) is the number of .-operations to multiply two polynomials of degree .???1 over .. We show that this cost is also smaller than other proposed multipliers for .?>?160, values which are used in ellipti作者: 匍匐 時(shí)間: 2025-3-22 00:38
Effects of Optimizations for Software Implementations of Small Binary Field Arithmetics of different sizes without worrying about penalties introduced by field arithmetic and concentrating on the curve arithmetic itself. Moreover, the cost of field inversion is very low, making the use of affine coordinates in curve arithmetic more interesting. These applications will be mentioned.作者: 革新 時(shí)間: 2025-3-22 08:17
Introduction to the Oracle9, Architectureults show that the FU allows to accelerate the execution of 128-bit AES by up to 78% compared to a conventional software implementation using only native SPARC?V8 instructions. Moreover, the custom instructions reduce the code size by up to 87.4%. The FU increases the silicon area of the Leon2 core 作者: 責(zé)任 時(shí)間: 2025-3-22 12:39
https://doi.org/10.1007/978-1-4302-0773-3 bases of type 2 from . reported by Gao et al.?(2000) to .(.)?+?.(. log.) operations in ., where .(.) is the number of .-operations to multiply two polynomials of degree .???1 over .. We show that this cost is also smaller than other proposed multipliers for .?>?160, values which are used in ellipti作者: right-atrium 時(shí)間: 2025-3-22 15:21 作者: 飛鏢 時(shí)間: 2025-3-22 17:56
Expert Oracle and Java Securityonstructed from a difference-balanced .-form function. Although neither of the inversions of Klapper A.′. and No J. S.′. main theorems is true, we prove that a difference-balanced .-form function can be obtained by the cyclic relative difference set and the cyclic difference set introduced by these 作者: 眼界 時(shí)間: 2025-3-23 00:41
User Management and Database Securityd on pairings have appeared in the literature. Software implementations being rather slow, the study of hardware architectures became an active research area. Beuchat?. proposed for instance a coprocessor which computes the characteristic three .. pairing, from which the Tate pairing can easily be d作者: 交響樂 時(shí)間: 2025-3-23 03:39
Introduction to the Oracle9, Architecturethis paper we present the design of a functional unit (FU) for accelerating the execution of cryptographic software on 32-bit processors. The FU is basically a multiply-accumulate (MAC) unit able to perform multiplications and MAC operations on integers and binary polynomials. Polynomial arithmetic 作者: Lacunar-Stroke 時(shí)間: 2025-3-23 05:36
https://doi.org/10.1007/978-1-4302-0773-3on to convert the normal basis representations of elements of . to suitable polynomials of degree at most . over .. These polynomials are multiplied using any method which is suitable for the implementation platform, then the product is converted back to the normal basis using the inverse of the abo作者: cushion 時(shí)間: 2025-3-23 12:08
Expert Oracle9i Database Administratione results can be applied also to CPUs with different granularity..We begin with separate routines for each operand size . to minimize performance penalties that have a bigger relative impact for shorter operands – such as those used to implement modern curve based cryptography. We then proceed to us作者: 無思維能力 時(shí)間: 2025-3-23 14:51 作者: 行業(yè) 時(shí)間: 2025-3-23 21:57 作者: 整頓 時(shí)間: 2025-3-23 22:24
Security, Forms, and Error Handling,pends on the choice of interpolation points and on the exact sequence of operations for evaluation and interpolation. If carefully tuned, it gives the fastest algorithm for a wide range of inputs..This work smoothly extends the Toom strategy to polynomial rings, with a focus on .. Moreover a method 作者: 享樂主義者 時(shí)間: 2025-3-24 03:31
https://doi.org/10.1007/978-1-4302-3486-9that for some . with 0?≤?.?≤?.???1, the function . is a two to one map on a certain subset ..(.) of .(2.). We conjecture that .. is two to one on ..(.) if and only if (.,.) belongs to a certain list. For (.,.) in this list, .. is proved to be two to one. We also prove that if .. is two to one on ..(作者: 泥沼 時(shí)間: 2025-3-24 10:16 作者: constitutional 時(shí)間: 2025-3-24 13:32
https://doi.org/10.1007/978-1-4302-3742-6on can be used to efficiently generate optimal S-boxes fulfilling additional criteria. One result is that an S-box which is optimal against differential and linear attacks is always optimal with respect to algebraic attacks as well. We also classify all optimal S-boxes up to the so called CCZ equiva作者: Interlocking 時(shí)間: 2025-3-24 17:56 作者: Mercurial 時(shí)間: 2025-3-24 19:29
Indexing Myths and Best Practices,based on new point addition formulae that suit very well to exponentiation algorithms based on Euclidean addition chains. However finding small chains remains a very difficult problem, so we also develop a specific exponentiation algorithm, based on Zeckendorf representation (i.e. representing the s作者: predict 時(shí)間: 2025-3-25 01:02
Indexing Myths and Best Practices,rve. Hereby, we consider real hyperelliptic curves of genus 2 given in affine coordinates for which the underlying finite field has characteristic >?3. These formulas are much faster than the optimized generic algorithms for real hyperelliptic curves and the cryptographic protocols in the real setti作者: anatomical 時(shí)間: 2025-3-25 06:49 作者: 起來了 時(shí)間: 2025-3-25 10:32 作者: goodwill 時(shí)間: 2025-3-25 12:04 作者: galley 時(shí)間: 2025-3-25 15:54 作者: Conclave 時(shí)間: 2025-3-25 22:23 作者: SPALL 時(shí)間: 2025-3-26 01:41 作者: 誓言 時(shí)間: 2025-3-26 04:57
https://doi.org/10.1007/978-1-4302-3832-4Finite upper half planes are finite field analogues of the Poincaré upper half plane. We introduce modular forms of new type on finite upper half planes, and consider related topics.作者: 暫時(shí)休息 時(shí)間: 2025-3-26 09:08 作者: 樹木心 時(shí)間: 2025-3-26 15:48
A Note on Modular Forms on Finite Upper Half PlanesFinite upper half planes are finite field analogues of the Poincaré upper half plane. We introduce modular forms of new type on finite upper half planes, and consider related topics.作者: 撫育 時(shí)間: 2025-3-26 17:31 作者: 有角 時(shí)間: 2025-3-26 23:27 作者: CLEFT 時(shí)間: 2025-3-27 02:00
0302-9743 Overview: 978-3-540-73073-6978-3-540-73074-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CLIFF 時(shí)間: 2025-3-27 06:00
Expert Oracle and Java Securityonstructed from a difference-balanced .-form function. Although neither of the inversions of Klapper A.′. and No J. S.′. main theorems is true, we prove that a difference-balanced .-form function can be obtained by the cyclic relative difference set and the cyclic difference set introduced by these two main theorems respectively.作者: bifurcate 時(shí)間: 2025-3-27 12:18 作者: 沉著 時(shí)間: 2025-3-27 13:40
Expert Performance Indexing in SQL Serverextractor, for a given point . on ., outputs the first .-coefficient of the abscissa of the point .. We show that if a point . is chosen uniformly at random in ., the element extracted from the point . is indistinguishable from a uniformly random variable in ..作者: 構(gòu)想 時(shí)間: 2025-3-27 21:33 作者: mitral-valve 時(shí)間: 2025-3-28 00:01
A Construction of Differentially 4-Uniform Functions from Commutative Semifields of Characteristic 2that for some . with 0?≤?.?≤?.???1, the function . is a two to one map on a certain subset ..(.) of .(2.). We conjecture that .. is two to one on ..(.) if and only if (.,.) belongs to a certain list. For (.,.) in this list, .. is proved to be two to one. We also prove that if .. is two to one on ..(.) then (.,2) belongs to the list.作者: GENUS 時(shí)間: 2025-3-28 02:26 作者: 慷慨援助 時(shí)間: 2025-3-28 08:35
Some Notes on ,-Form Functions with Difference-Balanced Propertyonstructed from a difference-balanced .-form function. Although neither of the inversions of Klapper A.′. and No J. S.′. main theorems is true, we prove that a difference-balanced .-form function can be obtained by the cyclic relative difference set and the cyclic difference set introduced by these 作者: ERUPT 時(shí)間: 2025-3-28 12:31 作者: SPASM 時(shí)間: 2025-3-28 16:00
VLSI Implementation of a Functional Unit to Accelerate ECC?and?AES on 32-Bit Processorsthis paper we present the design of a functional unit (FU) for accelerating the execution of cryptographic software on 32-bit processors. The FU is basically a multiply-accumulate (MAC) unit able to perform multiplications and MAC operations on integers and binary polynomials. Polynomial arithmetic 作者: single 時(shí)間: 2025-3-28 22:30 作者: 好開玩笑 時(shí)間: 2025-3-29 02:33 作者: 正式演說 時(shí)間: 2025-3-29 03:17 作者: ALTER 時(shí)間: 2025-3-29 10:52 作者: Callus 時(shí)間: 2025-3-29 12:08
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristpends on the choice of interpolation points and on the exact sequence of operations for evaluation and interpolation. If carefully tuned, it gives the fastest algorithm for a wide range of inputs..This work smoothly extends the Toom strategy to polynomial rings, with a focus on .. Moreover a method 作者: placebo 時(shí)間: 2025-3-29 16:57
A Construction of Differentially 4-Uniform Functions from Commutative Semifields of Characteristic 2that for some . with 0?≤?.?≤?.???1, the function . is a two to one map on a certain subset ..(.) of .(2.). We conjecture that .. is two to one on ..(.) if and only if (.,.) belongs to a certain list. For (.,.) in this list, .. is proved to be two to one. We also prove that if .. is two to one on ..(作者: GROG 時(shí)間: 2025-3-29 22:31 作者: 做事過頭 時(shí)間: 2025-3-30 01:17
On the Classification of 4 Bit S-Boxeson can be used to efficiently generate optimal S-boxes fulfilling additional criteria. One result is that an S-box which is optimal against differential and linear attacks is always optimal with respect to algebraic attacks as well. We also classify all optimal S-boxes up to the so called CCZ equiva作者: 對手 時(shí)間: 2025-3-30 04:13 作者: 傾聽 時(shí)間: 2025-3-30 12:17 作者: 骯臟 時(shí)間: 2025-3-30 13:10 作者: 制度 時(shí)間: 2025-3-30 20:27 作者: Ejaculate 時(shí)間: 2025-3-30 21:38
On Kabatianskii-Krouk-Smeets Signaturesecurity and the efficiency of their proposal. We show that a passive attacker who may intercept just a few signatures can recover the private key. We give precisely the number of signatures required to achieve this goal. This enables us to prove that all the schemes given in the original paper can b作者: pantomime 時(shí)間: 2025-3-31 03:50
Self-certified Signatures Based on Discrete Logarithmsic key with respect to a signer lies on a certificate provided by a certificate authority. To verify a signature, verifiers have to first verify the corresponding certificate. To avoid this burden, in this paper, we propose a self-certified signature scheme based on discrete logarithms to provide an作者: JEER 時(shí)間: 2025-3-31 05:33 作者: 埋伏 時(shí)間: 2025-3-31 11:26
Security, Forms, and Error Handling,is proposed to find the faster Toom multiplication algorithm for any given splitting order. New results found with it, for polynomials in characteristic 2, are presented..A new extension for multivariate polynomials is also introduced; through a new definition of density leading Toom strategy to be efficient.作者: ingestion 時(shí)間: 2025-3-31 16:39
https://doi.org/10.1007/978-1-4302-3742-6ns. In the present paper we prove that the answer to this question is positive. By this method we construct a class of APN polynomials EA-inequivalent to power functions. On the other hand it is shown that the APN polynomials constructed by Budaghyan, Carlet and Pott cannot be obtained by the introduced method.作者: BLANC 時(shí)間: 2025-3-31 20:54
Expert Performance Indexing in SQL Servere broken with at most 20 signatures. We improve the efficiency of these schemes by firstly providing parameters that enable to sign about 40 messages, and secondly, by describing a way to extend these . signatures into classical . signatures. We finally study their key sizes and a mean to reduce them by means of more compact matrices.作者: 是他笨 時(shí)間: 2025-3-31 22:21
Software Implementation of Arithmetic in ,ed of encryption and decryption for the Boneh-Franklin and Sakai-Kasahara identity-based encryption schemes at the 128-bit security level, in the case where supersingular elliptic curves with embedding degrees 2, 4 and 6 are employed.作者: 消耗 時(shí)間: 2025-4-1 03:57
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristis proposed to find the faster Toom multiplication algorithm for any given splitting order. New results found with it, for polynomials in characteristic 2, are presented..A new extension for multivariate polynomials is also introduced; through a new definition of density leading Toom strategy to be efficient.作者: 黑豹 時(shí)間: 2025-4-1 08:37
The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functionsns. In the present paper we prove that the answer to this question is positive. By this method we construct a class of APN polynomials EA-inequivalent to power functions. On the other hand it is shown that the APN polynomials constructed by Budaghyan, Carlet and Pott cannot be obtained by the introduced method.作者: 滔滔不絕地講 時(shí)間: 2025-4-1 11:58 作者: 等級的上升 時(shí)間: 2025-4-1 16:32
https://doi.org/10.1007/978-1-4302-6008-0(CRCs), linear feedback shift-registers (LFSRs), and implementations of the Advanced Encryption Standard (AES) algorithm. As the proposed algorithm can utilize cancellation of terms it outperforms in general previously proposed algorithms based on sub-expression sharing.作者: ASSAY 時(shí)間: 2025-4-1 20:45
