搜索结果: 1-15 共查到“prime”相关记录184条 . 查询时间(0.062 秒)
引导编辑（prime editing，PE）是David Liu实验室新开发的精准基因编辑系统：在PE向导RNA（pegRNAs）的引导下，逆转录酶MMLV与nCas9组成的融合蛋白可实现四种碱基之间的自由替换，以及目标位点碱基的精准插入与删除（详见BioArt报道：专家点评Nature | David Liu再出重磅基因编辑新工具，可实现碱基随意转换与增删）【1】。绝大多数致病遗传变异都是碱基点...
中国科学院遗传与发育生物学研究所高彩霞研究组建立植物基因组引导编辑技术体系“Plant Prime Editing”（图）
中国科学院遗传与发育生物学研究所 高彩霞 植物基因组 编辑技术体系 Plant Prime Editing
2020/3/17
基因组编辑技术可以定向修饰植物基因组，从而大大加速植物育种的进程，是实现作物精准育种的重要技术突破。然而，作物的许多重要农艺性状是由基因组中的单个或少数核苷酸的改变或突变造成的。基于CRISPR/Cas系统的基因组编辑，可利用外源修复模板通过同源重组介导的修复方式（HDR）实现目标基因特定核苷酸的改变。目前，同源重组在植物中的效率非常低，很难以此方式实现高效、稳定的植物基因组的精准编辑。CRISP...
探讨Axium? Prime 系列弹簧圈在颅内破裂微小动脉瘤栓塞中的安全性及临床效果。方法 回顾性分析2017年1月至2018年6月使用Axium? Prime 系列弹簧圈栓塞治疗的32例颅内破裂微小动脉瘤的临床资料，其中LVIS支架辅助栓塞15例，单纯弹簧圈栓塞17例。
Faster Bootstrapping of FHE over the integers with large prime message space
Fully homomorphic encryption Bootstrapping Restricted depth-3 circuit
2019/5/27
Prime, Order Please! Revisiting Small Subgroup and Invalid Curve Attacks on Protocols using Diffie-Hellman
formal verification symbolic model tamarin prover
2019/5/21
Diffie-Hellman groups are a widely used component in cryptographic protocols in which a shared secret is needed. These protocols are typically proven to be secure under the assumption they are impleme...
Fast Scalar Multiplication for Elliptic Curves over Prime Fields by Efficiently Computable Formulas
twisted Edwards curves Edwards curves scalar multiplication
2018/11/6
This paper addresses fast scalar multiplication for elliptic curves over finite fields. In the first part of the paper, we obtain several efficiently computable formulas for basic elliptic curves arit...
Efficient Inversion In (Pseudo-)Mersenne Prime Order Fields
finite fields inversion multiplication
2018/11/5
Efficient scalar multiplication algorithms require a single finite field inversion at the end to convert from projective to affine coordinates. This inversion consumes a significant proportion of the ...
A Key Recovery Attack on Streamlined NTRU Prime
NTRU Prime key encapsulation mechanism IND-CCA security
2018/11/5
For years, researchers have been engaged in finding new cryptography schemes with high security and efficiency that can resist against the attacking from quantum computers. Lattice-based cryptography ...
Prime and Prejudice: Primality Testing Under Adversarial Conditions
Primality testing Miller-Rabin test Lucas test
2018/8/20
This work provides a systematic analysis of primality testing under adversarial conditions, where the numbers being tested for primality are not generated randomly, but instead provided by a possibly ...
Cost-Effective Private Linear Key Agreement With Adaptive CCA Security from Prime Order Multilinear Maps and Tracing Traitors
broadcast encryption private linear key agreement traitor tracing
2018/5/28
Private linear key agreement (PLKA) enables a group of users to agree upon a common session key in a broadcast encryption (BE) scenario, while traitor tracing (TT) system allows a tracer to identify c...
Threshold Properties of Prime Power Subgroups with Application to Secure Integer Comparisons
RSA homomorphic encryption homomorphic threshold
2018/3/5
In contrast to related work which encrypts and acts on each bit of the input separately, our protocol compares multiple input bits simultaneously within a single ciphertext. Compared to the related pr...
ABE with Tag Made Easy: Concise Framework and New Instantiations in Prime-order Groups
Attribute-based encryption Predicate encoding Prime-order bilinear group
2017/9/13
Among all existing identity-based encryption (IBE) schemes in the bilinear group, Wat-IBE proposed by Waters [CRYPTO, 2009] and JR-IBE proposed by Jutla and Roy [AsiaCrypt, 2013] are quite special. A ...
Non-Interactive Provably Secure Attestations for Arbitrary RSA Prime
RSA key generation random oracle non-interactive proof
2017/7/6
Generic non-interactive zero-knowledge (NIZK) proofs can be used to prove such properties. However, generic NIZK proofs are not practical at all. For some very specific properties, specialized proofs ...
CCA-secure Predicate Encryption from Pair Encoding in Prime Order Groups: Generic and Efficient
Predicate Encryption CCA Security Pair Encoding Scheme
2017/7/6
Attrapadung (Eurocrypt 2014) proposed a generic framework called pair encoding to simplify the design and proof of security of CPA-secure predicate encryption (PE) instantiated in composite order grou...